/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-de61.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:41:27,670 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:41:27,679 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:41:27,724 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:41:27,724 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:41:27,725 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:41:27,725 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:41:27,726 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:41:27,727 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:41:27,728 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:41:27,728 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:41:27,729 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:41:27,729 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:41:27,730 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:41:27,730 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:41:27,731 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:41:27,732 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:41:27,732 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:41:27,733 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:41:27,734 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:41:27,736 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:41:27,737 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:41:27,737 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:41:27,738 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:41:27,739 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:41:27,740 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:41:27,741 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:41:27,741 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:41:27,741 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:41:27,741 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:41:27,742 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:41:27,742 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:41:27,743 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:41:27,743 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:41:27,743 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:41:27,744 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:41:27,744 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:41:27,745 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:41:27,745 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:41:27,745 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:41:27,745 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:41:27,746 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:41:27,746 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:41:27,752 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:41:27,752 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:41:27,753 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:41:27,753 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:41:27,753 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:41:27,753 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:41:27,753 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:41:27,753 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:41:27,754 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:41:27,754 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:41:27,754 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:41:27,754 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:41:27,754 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:41:27,754 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:41:27,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:41:27,755 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:41:27,755 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:41:27,755 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:41:27,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:41:27,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:41:27,755 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:41:27,755 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:41:27,755 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:41:27,756 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:41:27,756 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:41:27,756 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 03:41:27,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:41:27,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:41:27,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:41:27,958 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:41:27,959 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:41:27,960 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de61.c [2022-04-28 03:41:27,998 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6afaf6836/567be504c15e4c8faf290b2f968ad7ac/FLAG05dcb2188 [2022-04-28 03:41:28,348 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:41:28,348 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de61.c [2022-04-28 03:41:28,352 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6afaf6836/567be504c15e4c8faf290b2f968ad7ac/FLAG05dcb2188 [2022-04-28 03:41:28,362 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6afaf6836/567be504c15e4c8faf290b2f968ad7ac [2022-04-28 03:41:28,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:41:28,364 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:41:28,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:41:28,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:41:28,368 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:41:28,369 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:41:28" (1/1) ... [2022-04-28 03:41:28,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@313ddb28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:28, skipping insertion in model container [2022-04-28 03:41:28,370 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:41:28" (1/1) ... [2022-04-28 03:41:28,374 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:41:28,382 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:41:28,481 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-de61.c[368,381] [2022-04-28 03:41:28,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:41:28,510 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:41:28,521 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-de61.c[368,381] [2022-04-28 03:41:28,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:41:28,533 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:41:28,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:28 WrapperNode [2022-04-28 03:41:28,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:41:28,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:41:28,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:41:28,534 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:41:28,540 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:28" (1/1) ... [2022-04-28 03:41:28,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:28" (1/1) ... [2022-04-28 03:41:28,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:28" (1/1) ... [2022-04-28 03:41:28,545 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:28" (1/1) ... [2022-04-28 03:41:28,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:28" (1/1) ... [2022-04-28 03:41:28,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:28" (1/1) ... [2022-04-28 03:41:28,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:28" (1/1) ... [2022-04-28 03:41:28,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:41:28,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:41:28,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:41:28,554 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:41:28,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:28" (1/1) ... [2022-04-28 03:41:28,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:41:28,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:28,586 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 03:41:28,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 03:41:28,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:41:28,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:41:28,612 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:41:28,613 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:41:28,613 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:41:28,613 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:41:28,613 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:41:28,613 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:41:28,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:41:28,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 03:41:28,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:41:28,613 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:41:28,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:41:28,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:41:28,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:41:28,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:41:28,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:41:28,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:41:28,659 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:41:28,660 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:41:28,903 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:41:28,907 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:41:28,907 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-04-28 03:41:28,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:41:28 BoogieIcfgContainer [2022-04-28 03:41:28,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:41:28,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:41:28,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:41:28,916 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:41:28,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:41:28" (1/3) ... [2022-04-28 03:41:28,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be56d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:41:28, skipping insertion in model container [2022-04-28 03:41:28,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:28" (2/3) ... [2022-04-28 03:41:28,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be56d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:41:28, skipping insertion in model container [2022-04-28 03:41:28,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:41:28" (3/3) ... [2022-04-28 03:41:28,918 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de61.c [2022-04-28 03:41:28,927 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:41:28,927 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:41:28,957 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:41:28,962 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@7958654f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1265f3d2 [2022-04-28 03:41:28,963 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:41:28,975 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:41:28,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:41:28,981 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:28,982 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:28,982 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:28,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:28,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1370249117, now seen corresponding path program 1 times [2022-04-28 03:41:28,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:28,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1281657249] [2022-04-28 03:41:29,003 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:41:29,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1370249117, now seen corresponding path program 2 times [2022-04-28 03:41:29,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:29,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146314657] [2022-04-28 03:41:29,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:29,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:29,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:29,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28#true} is VALID [2022-04-28 03:41:29,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-28 03:41:29,152 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #94#return; {28#true} is VALID [2022-04-28 03:41:29,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:29,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28#true} is VALID [2022-04-28 03:41:29,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-28 03:41:29,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #94#return; {28#true} is VALID [2022-04-28 03:41:29,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret17 := main(); {28#true} is VALID [2022-04-28 03:41:29,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28#true} is VALID [2022-04-28 03:41:29,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} assume !(~x~0 % 4294967296 > 0); {28#true} is VALID [2022-04-28 03:41:29,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#true} ~z~0 := ~y~0; {28#true} is VALID [2022-04-28 03:41:29,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#true} assume !(~z~0 % 4294967296 > 0); {28#true} is VALID [2022-04-28 03:41:29,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#true} assume !(~y~0 % 4294967296 > 0); {28#true} is VALID [2022-04-28 03:41:29,156 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-04-28 03:41:29,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume !(~z~0 % 4294967296 > 0); {29#false} is VALID [2022-04-28 03:41:29,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} assume !(~y~0 % 4294967296 > 0); {29#false} is VALID [2022-04-28 03:41:29,157 INFO L272 TraceCheckUtils]: 13: Hoare triple {29#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29#false} is VALID [2022-04-28 03:41:29,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-04-28 03:41:29,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-04-28 03:41:29,159 INFO L290 TraceCheckUtils]: 16: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-28 03:41:29,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:41:29,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:29,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146314657] [2022-04-28 03:41:29,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146314657] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:29,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:29,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:41:29,163 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:29,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1281657249] [2022-04-28 03:41:29,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1281657249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:29,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:29,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:41:29,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252654916] [2022-04-28 03:41:29,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:29,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:41:29,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:29,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:29,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:29,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 03:41:29,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:29,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 03:41:29,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:41:29,212 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:29,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:29,320 INFO L93 Difference]: Finished difference Result 43 states and 66 transitions. [2022-04-28 03:41:29,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 03:41:29,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:41:29,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:29,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:29,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-28 03:41:29,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:29,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-28 03:41:29,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2022-04-28 03:41:29,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:29,414 INFO L225 Difference]: With dead ends: 43 [2022-04-28 03:41:29,414 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 03:41:29,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:41:29,420 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:29,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:41:29,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 03:41:29,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-28 03:41:29,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:29,446 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:29,446 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:29,447 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:29,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:29,449 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-04-28 03:41:29,449 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-28 03:41:29,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:29,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:29,450 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states 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:41:29,450 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states 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:41:29,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:29,452 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-04-28 03:41:29,452 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-28 03:41:29,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:29,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:29,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:29,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:29,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:29,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-04-28 03:41:29,457 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 17 [2022-04-28 03:41:29,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:29,459 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-04-28 03:41:29,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:29,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 23 transitions. [2022-04-28 03:41:29,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:29,486 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-28 03:41:29,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:41:29,487 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:29,487 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:29,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:41:29,488 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:29,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:29,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2115201689, now seen corresponding path program 1 times [2022-04-28 03:41:29,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:29,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [629582727] [2022-04-28 03:41:29,490 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:41:29,490 INFO L85 PathProgramCache]: Analyzing trace with hash 2115201689, now seen corresponding path program 2 times [2022-04-28 03:41:29,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:29,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962670617] [2022-04-28 03:41:29,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:29,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:29,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:29,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {205#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {194#true} is VALID [2022-04-28 03:41:29,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#true} assume true; {194#true} is VALID [2022-04-28 03:41:29,861 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {194#true} {194#true} #94#return; {194#true} is VALID [2022-04-28 03:41:29,862 INFO L272 TraceCheckUtils]: 0: Hoare triple {194#true} call ULTIMATE.init(); {205#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:29,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {205#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {194#true} is VALID [2022-04-28 03:41:29,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {194#true} assume true; {194#true} is VALID [2022-04-28 03:41:29,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {194#true} {194#true} #94#return; {194#true} is VALID [2022-04-28 03:41:29,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {194#true} call #t~ret17 := main(); {194#true} is VALID [2022-04-28 03:41:29,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {194#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {199#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:41:29,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {199#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !(~x~0 % 4294967296 > 0); {200#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-28 03:41:29,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {200#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {201#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:41:29,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {201#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {201#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:41:29,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {201#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~y~0 % 4294967296 > 0); {201#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:41:29,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {201#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~x~0 % 4294967296 > 0); {202#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:41:29,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {202#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {202#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:41:29,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {202#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~y~0 % 4294967296 > 0); {202#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:41:29,871 INFO L272 TraceCheckUtils]: 13: Hoare triple {202#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {203#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:41:29,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {203#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {204#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:41:29,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {204#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {195#false} is VALID [2022-04-28 03:41:29,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {195#false} assume !false; {195#false} is VALID [2022-04-28 03:41:29,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:41:29,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:29,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962670617] [2022-04-28 03:41:29,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962670617] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:29,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:29,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:41:29,874 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:29,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [629582727] [2022-04-28 03:41:29,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [629582727] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:29,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:29,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:41:29,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781288493] [2022-04-28 03:41:29,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:29,876 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:41:29,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:29,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:29,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:29,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:41:29,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:29,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:41:29,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-28 03:41:29,891 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:30,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:30,216 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2022-04-28 03:41:30,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:41:30,216 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:41:30,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:30,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:30,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-28 03:41:30,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:30,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-28 03:41:30,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 53 transitions. [2022-04-28 03:41:30,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:30,273 INFO L225 Difference]: With dead ends: 38 [2022-04-28 03:41:30,273 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 03:41:30,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-04-28 03:41:30,276 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 38 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:30,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 46 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:41:30,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 03:41:30,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-28 03:41:30,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:30,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:30,285 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:30,285 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:30,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:30,287 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-28 03:41:30,287 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-28 03:41:30,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:30,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:30,287 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 03:41:30,288 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 03:41:30,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:30,289 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-28 03:41:30,289 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-28 03:41:30,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:30,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:30,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:30,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:30,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:30,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-04-28 03:41:30,291 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 17 [2022-04-28 03:41:30,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:30,291 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-04-28 03:41:30,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:30,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 24 transitions. [2022-04-28 03:41:30,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:30,313 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-28 03:41:30,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 03:41:30,314 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:30,314 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:30,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:41:30,316 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:30,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:30,316 INFO L85 PathProgramCache]: Analyzing trace with hash -121895178, now seen corresponding path program 1 times [2022-04-28 03:41:30,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:30,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [534321138] [2022-04-28 03:41:30,628 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:41:30,630 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:30,633 INFO L85 PathProgramCache]: Analyzing trace with hash -994530153, now seen corresponding path program 1 times [2022-04-28 03:41:30,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:30,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393831116] [2022-04-28 03:41:30,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:30,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:30,647 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:30,691 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:30,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:30,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {382#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {370#true} is VALID [2022-04-28 03:41:30,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {370#true} assume true; {370#true} is VALID [2022-04-28 03:41:30,836 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {370#true} {370#true} #94#return; {370#true} is VALID [2022-04-28 03:41:30,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {370#true} call ULTIMATE.init(); {382#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:30,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {382#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {370#true} is VALID [2022-04-28 03:41:30,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {370#true} assume true; {370#true} is VALID [2022-04-28 03:41:30,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {370#true} {370#true} #94#return; {370#true} is VALID [2022-04-28 03:41:30,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {370#true} call #t~ret17 := main(); {370#true} is VALID [2022-04-28 03:41:30,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {370#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {375#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:41:30,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {375#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [98] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_13 4294967296)) (.cse1 (= |v_main_#t~post6_4| |v_main_#t~post6_3|)) (.cse2 (= |v_main_#t~post5_4| |v_main_#t~post5_3|)) (.cse3 (= v_main_~x~0_13 v_main_~x~0_12)) (.cse4 (= v_main_~y~0_14 v_main_~y~0_13))) (or (and (< 0 .cse0) (< v_main_~x~0_12 v_main_~x~0_13) (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~x~0_13 (* v_it_1 4294967295)) 4294967296)) (not (<= (+ v_main_~x~0_12 v_it_1 1) v_main_~x~0_13)) (not (<= 1 v_it_1)))) (= v_main_~y~0_13 (+ v_main_~x~0_13 v_main_~y~0_14 (* (- 1) v_main_~x~0_12)))) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_14, main_#t~post5=|v_main_#t~post5_4|, main_~x~0=v_main_~x~0_13, main_#t~post6=|v_main_#t~post6_4|} OutVars{main_~y~0=v_main_~y~0_13, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_12, main_#t~post6=|v_main_#t~post6_3|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {376#(or (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) 4294967295)))} is VALID [2022-04-28 03:41:30,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {376#(or (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) 4294967295)))} [97] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {377#(or (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ 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:41:30,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {377#(or (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ 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; {378#(or (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:41:30,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {378#(or (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {379#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:41:30,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {379#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {379#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:41:30,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {379#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {379#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:41:30,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {379#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {379#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:41:30,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {379#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {379#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:41:30,854 INFO L272 TraceCheckUtils]: 14: Hoare triple {379#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {380#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:41:30,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {380#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {381#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:41:30,854 INFO L290 TraceCheckUtils]: 16: Hoare triple {381#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {371#false} is VALID [2022-04-28 03:41:30,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {371#false} assume !false; {371#false} is VALID [2022-04-28 03:41:30,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:41:30,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:30,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393831116] [2022-04-28 03:41:30,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393831116] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:30,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:30,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:41:31,179 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:31,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [534321138] [2022-04-28 03:41:31,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [534321138] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:31,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:31,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:41:31,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455371932] [2022-04-28 03:41:31,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:31,180 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 03:41:31,180 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:31,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.4) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:31,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:41:31,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:31,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:41:31,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:41:31,199 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:31,718 INFO L93 Difference]: Finished difference Result 39 states and 57 transitions. [2022-04-28 03:41:31,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 03:41:31,718 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 03:41:31,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:31,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 57 transitions. [2022-04-28 03:41:31,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 57 transitions. [2022-04-28 03:41:31,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 57 transitions. [2022-04-28 03:41:31,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:31,847 INFO L225 Difference]: With dead ends: 39 [2022-04-28 03:41:31,847 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 03:41:31,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2022-04-28 03:41:31,848 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 49 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:31,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 41 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 79 Invalid, 0 Unknown, 39 Unchecked, 0.1s Time] [2022-04-28 03:41:31,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 03:41:31,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 23. [2022-04-28 03:41:31,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:31,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,880 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,880 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:31,881 INFO L93 Difference]: Finished difference Result 34 states and 52 transitions. [2022-04-28 03:41:31,881 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 52 transitions. [2022-04-28 03:41:31,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:31,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:31,882 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-28 03:41:31,882 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-28 03:41:31,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:31,884 INFO L93 Difference]: Finished difference Result 34 states and 52 transitions. [2022-04-28 03:41:31,884 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 52 transitions. [2022-04-28 03:41:31,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:31,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:31,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:31,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:31,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-04-28 03:41:31,885 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 18 [2022-04-28 03:41:31,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:31,886 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-04-28 03:41:31,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 31 transitions. [2022-04-28 03:41:31,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:31,945 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-04-28 03:41:31,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 03:41:31,946 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:31,946 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:31,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 03:41:31,946 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:31,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:31,947 INFO L85 PathProgramCache]: Analyzing trace with hash 550711896, now seen corresponding path program 1 times [2022-04-28 03:41:31,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:31,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [86785729] [2022-04-28 03:41:33,007 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:41:33,009 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:33,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1059809129, now seen corresponding path program 1 times [2022-04-28 03:41:33,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:33,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394611013] [2022-04-28 03:41:33,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:33,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:33,022 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:33,033 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:33,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:33,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:33,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {601#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {595#true} is VALID [2022-04-28 03:41:33,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {595#true} assume true; {595#true} is VALID [2022-04-28 03:41:33,060 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {595#true} {595#true} #94#return; {595#true} is VALID [2022-04-28 03:41:33,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {595#true} call ULTIMATE.init(); {601#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:33,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {601#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {595#true} is VALID [2022-04-28 03:41:33,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {595#true} assume true; {595#true} is VALID [2022-04-28 03:41:33,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {595#true} {595#true} #94#return; {595#true} is VALID [2022-04-28 03:41:33,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {595#true} call #t~ret17 := main(); {595#true} is VALID [2022-04-28 03:41:33,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {595#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {595#true} is VALID [2022-04-28 03:41:33,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {595#true} [100] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_21 v_main_~y~0_20)) (.cse1 (= |v_main_#t~post6_9| |v_main_#t~post6_8|)) (.cse2 (= |v_main_#t~post5_9| |v_main_#t~post5_8|)) (.cse3 (= v_main_~x~0_20 v_main_~x~0_19)) (.cse4 (mod v_main_~x~0_20 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3) (and (< v_main_~x~0_19 v_main_~x~0_20) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (< 0 (mod (+ v_main_~x~0_20 (* v_it_2 4294967295)) 4294967296)) (not (<= (+ v_main_~x~0_19 v_it_2 1) v_main_~x~0_20)))) (< 0 .cse4) (= v_main_~y~0_20 (+ v_main_~x~0_20 v_main_~y~0_21 (* (- 1) v_main_~x~0_19)))))) InVars {main_~y~0=v_main_~y~0_21, main_#t~post5=|v_main_#t~post5_9|, main_~x~0=v_main_~x~0_20, main_#t~post6=|v_main_#t~post6_9|} OutVars{main_~y~0=v_main_~y~0_20, main_#t~post5=|v_main_#t~post5_8|, main_~x~0=v_main_~x~0_19, main_#t~post6=|v_main_#t~post6_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {595#true} is VALID [2022-04-28 03:41:33,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {595#true} [99] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {595#true} is VALID [2022-04-28 03:41:33,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {595#true} ~z~0 := ~y~0; {595#true} is VALID [2022-04-28 03:41:33,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {595#true} assume !(~z~0 % 4294967296 > 0); {595#true} is VALID [2022-04-28 03:41:33,063 INFO L290 TraceCheckUtils]: 10: Hoare triple {595#true} assume !(~y~0 % 4294967296 > 0); {600#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:33,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {600#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {600#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:33,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {600#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {600#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:33,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {600#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {596#false} is VALID [2022-04-28 03:41:33,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {596#false} assume !(~y~0 % 4294967296 > 0); {596#false} is VALID [2022-04-28 03:41:33,065 INFO L272 TraceCheckUtils]: 15: Hoare triple {596#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {596#false} is VALID [2022-04-28 03:41:33,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {596#false} ~cond := #in~cond; {596#false} is VALID [2022-04-28 03:41:33,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {596#false} assume 0 == ~cond; {596#false} is VALID [2022-04-28 03:41:33,066 INFO L290 TraceCheckUtils]: 18: Hoare triple {596#false} assume !false; {596#false} is VALID [2022-04-28 03:41:33,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:41:33,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:33,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394611013] [2022-04-28 03:41:33,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394611013] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:33,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:33,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:41:33,093 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:33,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [86785729] [2022-04-28 03:41:33,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [86785729] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:33,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:33,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:41:33,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087466206] [2022-04-28 03:41:33,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:33,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 03:41:33,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:33,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:33,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:33,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 03:41:33,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:33,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 03:41:33,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:41:33,106 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:33,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:33,318 INFO L93 Difference]: Finished difference Result 45 states and 67 transitions. [2022-04-28 03:41:33,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:41:33,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 03:41:33,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:33,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:33,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-28 03:41:33,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:33,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-28 03:41:33,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2022-04-28 03:41:33,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:33,365 INFO L225 Difference]: With dead ends: 45 [2022-04-28 03:41:33,365 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 03:41:33,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:41:33,368 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 41 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:33,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 29 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:41:33,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 03:41:33,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2022-04-28 03:41:33,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:33,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:33,424 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:33,424 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:33,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:33,425 INFO L93 Difference]: Finished difference Result 38 states and 57 transitions. [2022-04-28 03:41:33,425 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 57 transitions. [2022-04-28 03:41:33,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:33,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:33,429 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-28 03:41:33,430 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-28 03:41:33,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:33,431 INFO L93 Difference]: Finished difference Result 38 states and 57 transitions. [2022-04-28 03:41:33,431 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 57 transitions. [2022-04-28 03:41:33,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:33,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:33,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:33,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:33,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:33,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-28 03:41:33,434 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 19 [2022-04-28 03:41:33,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:33,434 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-28 03:41:33,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:33,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 39 transitions. [2022-04-28 03:41:33,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:33,500 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-28 03:41:33,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 03:41:33,500 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:33,500 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:33,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 03:41:33,500 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:33,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:33,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1953540295, now seen corresponding path program 1 times [2022-04-28 03:41:33,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:33,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1685064396] [2022-04-28 03:41:33,667 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:41:33,668 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:33,671 INFO L85 PathProgramCache]: Analyzing trace with hash 14378694, now seen corresponding path program 1 times [2022-04-28 03:41:33,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:33,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729568503] [2022-04-28 03:41:33,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:33,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:33,681 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:41:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:33,686 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:33,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:33,703 INFO L290 TraceCheckUtils]: 0: Hoare triple {841#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {835#true} is VALID [2022-04-28 03:41:33,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {835#true} assume true; {835#true} is VALID [2022-04-28 03:41:33,704 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {835#true} {835#true} #94#return; {835#true} is VALID [2022-04-28 03:41:33,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {835#true} call ULTIMATE.init(); {841#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:33,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {841#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {835#true} is VALID [2022-04-28 03:41:33,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {835#true} assume true; {835#true} is VALID [2022-04-28 03:41:33,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {835#true} {835#true} #94#return; {835#true} is VALID [2022-04-28 03:41:33,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {835#true} call #t~ret17 := main(); {835#true} is VALID [2022-04-28 03:41:33,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {835#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {835#true} is VALID [2022-04-28 03:41:33,705 INFO L290 TraceCheckUtils]: 6: Hoare triple {835#true} [102] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_27 4294967296)) (.cse1 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse2 (= |v_main_#t~post5_14| |v_main_#t~post5_13|)) (.cse3 (= v_main_~y~0_29 v_main_~y~0_28)) (.cse4 (= v_main_~x~0_27 v_main_~x~0_26))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (< v_main_~y~0_29 v_main_~y~0_28) (= v_main_~x~0_26 (+ v_main_~x~0_27 v_main_~y~0_29 (* (- 1) v_main_~y~0_28))) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~x~0_27 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_29 v_it_3 1) v_main_~y~0_28))))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_29, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_27, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_28, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_26, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {835#true} is VALID [2022-04-28 03:41:33,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {835#true} [101] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {835#true} is VALID [2022-04-28 03:41:33,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {835#true} ~z~0 := ~y~0; {835#true} is VALID [2022-04-28 03:41:33,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {835#true} assume !(~z~0 % 4294967296 > 0); {840#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:33,706 INFO L290 TraceCheckUtils]: 10: Hoare triple {840#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {840#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:33,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {840#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {840#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:33,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {840#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {836#false} is VALID [2022-04-28 03:41:33,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {836#false} assume !(~z~0 % 4294967296 > 0); {836#false} is VALID [2022-04-28 03:41:33,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {836#false} assume !(~y~0 % 4294967296 > 0); {836#false} is VALID [2022-04-28 03:41:33,707 INFO L272 TraceCheckUtils]: 15: Hoare triple {836#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {836#false} is VALID [2022-04-28 03:41:33,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {836#false} ~cond := #in~cond; {836#false} is VALID [2022-04-28 03:41:33,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {836#false} assume 0 == ~cond; {836#false} is VALID [2022-04-28 03:41:33,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {836#false} assume !false; {836#false} is VALID [2022-04-28 03:41:33,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:41:33,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:33,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729568503] [2022-04-28 03:41:33,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729568503] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:33,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:33,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:41:33,740 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:33,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1685064396] [2022-04-28 03:41:33,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1685064396] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:33,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:33,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:41:33,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280721941] [2022-04-28 03:41:33,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:33,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 03:41:33,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:33,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:33,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:33,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 03:41:33,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:33,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 03:41:33,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:41:33,754 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:33,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:33,990 INFO L93 Difference]: Finished difference Result 51 states and 74 transitions. [2022-04-28 03:41:33,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:41:33,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 03:41:33,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:33,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:33,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-04-28 03:41:33,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:33,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-04-28 03:41:33,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 59 transitions. [2022-04-28 03:41:34,041 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:41:34,042 INFO L225 Difference]: With dead ends: 51 [2022-04-28 03:41:34,042 INFO L226 Difference]: Without dead ends: 41 [2022-04-28 03:41:34,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:41:34,042 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 49 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:34,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 27 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:41:34,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-28 03:41:34,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 27. [2022-04-28 03:41:34,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:34,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:34,089 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:34,089 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:34,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:34,090 INFO L93 Difference]: Finished difference Result 41 states and 59 transitions. [2022-04-28 03:41:34,090 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 59 transitions. [2022-04-28 03:41:34,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:34,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:34,091 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-28 03:41:34,091 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-28 03:41:34,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:34,092 INFO L93 Difference]: Finished difference Result 41 states and 59 transitions. [2022-04-28 03:41:34,092 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 59 transitions. [2022-04-28 03:41:34,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:34,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:34,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:34,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:34,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:34,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2022-04-28 03:41:34,093 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 19 [2022-04-28 03:41:34,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:34,093 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-04-28 03:41:34,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:34,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 36 transitions. [2022-04-28 03:41:34,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:34,163 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-04-28 03:41:34,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 03:41:34,163 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:34,163 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:34,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 03:41:34,163 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:34,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:34,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1989908199, now seen corresponding path program 1 times [2022-04-28 03:41:34,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:34,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [747254003] [2022-04-28 03:41:38,252 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:41:38,379 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:41:38,381 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:38,383 INFO L85 PathProgramCache]: Analyzing trace with hash -277893978, now seen corresponding path program 1 times [2022-04-28 03:41:38,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:38,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566217003] [2022-04-28 03:41:38,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:38,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:38,391 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-28 03:41:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:38,402 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.2))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-28 03:41:38,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:38,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {1099#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1090#true} is VALID [2022-04-28 03:41:38,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {1090#true} assume true; {1090#true} is VALID [2022-04-28 03:41:38,529 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1090#true} {1090#true} #94#return; {1090#true} is VALID [2022-04-28 03:41:38,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {1090#true} call ULTIMATE.init(); {1099#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:38,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {1099#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1090#true} is VALID [2022-04-28 03:41:38,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {1090#true} assume true; {1090#true} is VALID [2022-04-28 03:41:38,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1090#true} {1090#true} #94#return; {1090#true} is VALID [2022-04-28 03:41:38,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {1090#true} call #t~ret17 := main(); {1090#true} is VALID [2022-04-28 03:41:38,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {1090#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1095#(= main_~y~0 0)} is VALID [2022-04-28 03:41:38,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {1095#(= main_~y~0 0)} [104] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_35 4294967296)) (.cse1 (= v_main_~y~0_36 v_main_~y~0_35)) (.cse2 (= v_main_~x~0_35 v_main_~x~0_34)) (.cse3 (= |v_main_#t~post6_19| |v_main_#t~post6_18|)) (.cse4 (= |v_main_#t~post5_19| |v_main_#t~post5_18|))) (or (and (forall ((v_it_4 Int)) (or (not (<= (+ v_main_~y~0_36 v_it_4 1) v_main_~y~0_35)) (not (<= 1 v_it_4)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_35) 4294967296)))) (< 0 .cse0) (< v_main_~y~0_36 v_main_~y~0_35) (= v_main_~x~0_34 (+ v_main_~x~0_35 v_main_~y~0_36 (* (- 1) v_main_~y~0_35)))) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_36, main_#t~post5=|v_main_#t~post5_19|, main_~x~0=v_main_~x~0_35, main_#t~post6=|v_main_#t~post6_19|} OutVars{main_~y~0=v_main_~y~0_35, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_34, main_#t~post6=|v_main_#t~post6_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1096#(or (and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 0)) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) 4294967295)))} is VALID [2022-04-28 03:41:38,536 INFO L290 TraceCheckUtils]: 7: Hoare triple {1096#(or (and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 0)) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) 4294967295)))} [103] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1097#(or (and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 0)) (<= (+ 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:41:38,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {1097#(or (and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 0)) (<= (+ 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; {1098#(or (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0) (and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 0)))} is VALID [2022-04-28 03:41:38,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {1098#(or (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0) (and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 0)))} assume !(~z~0 % 4294967296 > 0); {1095#(= main_~y~0 0)} is VALID [2022-04-28 03:41:38,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {1095#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1091#false} is VALID [2022-04-28 03:41:38,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {1091#false} assume !(~y~0 % 4294967296 > 0); {1091#false} is VALID [2022-04-28 03:41:38,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {1091#false} assume !(~x~0 % 4294967296 > 0); {1091#false} is VALID [2022-04-28 03:41:38,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {1091#false} assume !(~z~0 % 4294967296 > 0); {1091#false} is VALID [2022-04-28 03:41:38,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {1091#false} assume !(~y~0 % 4294967296 > 0); {1091#false} is VALID [2022-04-28 03:41:38,538 INFO L272 TraceCheckUtils]: 15: Hoare triple {1091#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1091#false} is VALID [2022-04-28 03:41:38,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {1091#false} ~cond := #in~cond; {1091#false} is VALID [2022-04-28 03:41:38,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {1091#false} assume 0 == ~cond; {1091#false} is VALID [2022-04-28 03:41:38,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {1091#false} assume !false; {1091#false} is VALID [2022-04-28 03:41:38,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:41:38,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:38,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566217003] [2022-04-28 03:41:38,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566217003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:38,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:38,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:41:38,818 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:38,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [747254003] [2022-04-28 03:41:38,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [747254003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:38,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:38,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:41:38,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317194221] [2022-04-28 03:41:38,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:38,819 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 03:41:38,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:38,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:38,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:38,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:41:38,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:38,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:41:38,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-04-28 03:41:38,879 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:39,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:39,109 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2022-04-28 03:41:39,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:41:39,109 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 03:41:39,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:39,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:39,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-28 03:41:39,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:39,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-28 03:41:39,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-28 03:41:42,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 42 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:42,247 INFO L225 Difference]: With dead ends: 43 [2022-04-28 03:41:42,247 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 03:41:42,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:41:42,248 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 20 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:42,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 33 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 22 Invalid, 0 Unknown, 22 Unchecked, 0.0s Time] [2022-04-28 03:41:42,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 03:41:42,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-04-28 03:41:42,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:42,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:42,307 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:42,307 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:42,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:42,308 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2022-04-28 03:41:42,308 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2022-04-28 03:41:42,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:42,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:42,309 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-28 03:41:42,309 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-28 03:41:42,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:42,310 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2022-04-28 03:41:42,310 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2022-04-28 03:41:42,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:42,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:42,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:42,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:42,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:42,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2022-04-28 03:41:42,311 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 19 [2022-04-28 03:41:42,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:42,311 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2022-04-28 03:41:42,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:42,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 39 transitions. [2022-04-28 03:41:44,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 38 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:44,424 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2022-04-28 03:41:44,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 03:41:44,424 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:44,424 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:44,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 03:41:44,424 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:44,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:44,424 INFO L85 PathProgramCache]: Analyzing trace with hash -36937386, now seen corresponding path program 1 times [2022-04-28 03:41:44,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:44,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [905460534] [2022-04-28 03:41:44,594 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:41:44,595 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:44,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1077715895, now seen corresponding path program 1 times [2022-04-28 03:41:44,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:44,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616112518] [2022-04-28 03:41:44,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:44,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:44,610 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:44,616 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:44,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:44,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {1323#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1317#true} is VALID [2022-04-28 03:41:44,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {1317#true} assume true; {1317#true} is VALID [2022-04-28 03:41:44,636 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1317#true} {1317#true} #94#return; {1317#true} is VALID [2022-04-28 03:41:44,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {1317#true} call ULTIMATE.init(); {1323#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:44,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {1323#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1317#true} is VALID [2022-04-28 03:41:44,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {1317#true} assume true; {1317#true} is VALID [2022-04-28 03:41:44,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1317#true} {1317#true} #94#return; {1317#true} is VALID [2022-04-28 03:41:44,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {1317#true} call #t~ret17 := main(); {1317#true} is VALID [2022-04-28 03:41:44,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {1317#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1317#true} is VALID [2022-04-28 03:41:44,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {1317#true} [106] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_42 v_main_~x~0_41)) (.cse1 (= |v_main_#t~post5_24| |v_main_#t~post5_23|)) (.cse2 (= v_main_~y~0_44 v_main_~y~0_43)) (.cse3 (= |v_main_#t~post6_24| |v_main_#t~post6_23|)) (.cse4 (mod v_main_~x~0_42 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3) (and (< 0 .cse4) (= v_main_~y~0_43 (+ v_main_~x~0_42 v_main_~y~0_44 (* (- 1) v_main_~x~0_41))) (forall ((v_it_5 Int)) (or (not (<= 1 v_it_5)) (not (<= (+ v_main_~x~0_41 v_it_5 1) v_main_~x~0_42)) (< 0 (mod (+ v_main_~x~0_42 (* v_it_5 4294967295)) 4294967296)))) (< v_main_~x~0_41 v_main_~x~0_42)))) InVars {main_~y~0=v_main_~y~0_44, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_42, main_#t~post6=|v_main_#t~post6_24|} OutVars{main_~y~0=v_main_~y~0_43, main_#t~post5=|v_main_#t~post5_23|, main_~x~0=v_main_~x~0_41, main_#t~post6=|v_main_#t~post6_23|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1317#true} is VALID [2022-04-28 03:41:44,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {1317#true} [105] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1322#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:44,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {1322#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1322#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:44,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {1322#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1322#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:44,639 INFO L290 TraceCheckUtils]: 10: Hoare triple {1322#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {1322#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:44,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {1322#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1318#false} is VALID [2022-04-28 03:41:44,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {1318#false} assume !(~x~0 % 4294967296 > 0); {1318#false} is VALID [2022-04-28 03:41:44,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {1318#false} assume !(~z~0 % 4294967296 > 0); {1318#false} is VALID [2022-04-28 03:41:44,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {1318#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {1318#false} is VALID [2022-04-28 03:41:44,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {1318#false} assume !(~y~0 % 4294967296 > 0); {1318#false} is VALID [2022-04-28 03:41:44,640 INFO L272 TraceCheckUtils]: 16: Hoare triple {1318#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1318#false} is VALID [2022-04-28 03:41:44,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {1318#false} ~cond := #in~cond; {1318#false} is VALID [2022-04-28 03:41:44,640 INFO L290 TraceCheckUtils]: 18: Hoare triple {1318#false} assume 0 == ~cond; {1318#false} is VALID [2022-04-28 03:41:44,640 INFO L290 TraceCheckUtils]: 19: Hoare triple {1318#false} assume !false; {1318#false} is VALID [2022-04-28 03:41:44,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:41:44,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:44,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616112518] [2022-04-28 03:41:44,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616112518] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:44,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:44,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:41:44,712 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:44,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [905460534] [2022-04-28 03:41:44,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [905460534] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:44,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:44,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:41:44,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955367563] [2022-04-28 03:41:44,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:44,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 03:41:44,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:44,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:44,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:44,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 03:41:44,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:44,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 03:41:44,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:41:44,727 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:44,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:44,945 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2022-04-28 03:41:44,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 03:41:44,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 03:41:44,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:44,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:44,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-28 03:41:44,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:44,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-28 03:41:44,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-28 03:41:44,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:44,992 INFO L225 Difference]: With dead ends: 54 [2022-04-28 03:41:44,992 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 03:41:44,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:41:44,993 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 42 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:44,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 30 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:41:44,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 03:41:45,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2022-04-28 03:41:45,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:45,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:45,052 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:45,052 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:45,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:45,053 INFO L93 Difference]: Finished difference Result 43 states and 62 transitions. [2022-04-28 03:41:45,053 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 62 transitions. [2022-04-28 03:41:45,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:45,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:45,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-28 03:41:45,054 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-28 03:41:45,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:45,055 INFO L93 Difference]: Finished difference Result 43 states and 62 transitions. [2022-04-28 03:41:45,055 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 62 transitions. [2022-04-28 03:41:45,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:45,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:45,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:45,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:45,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:45,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-04-28 03:41:45,056 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 20 [2022-04-28 03:41:45,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:45,056 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-04-28 03:41:45,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:45,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 37 transitions. [2022-04-28 03:41:49,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 35 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:49,154 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-04-28 03:41:49,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 03:41:49,154 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:49,154 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:49,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 03:41:49,154 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:49,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:49,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1992076293, now seen corresponding path program 1 times [2022-04-28 03:41:49,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:49,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [682554948] [2022-04-28 03:41:49,320 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:41:49,321 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:49,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1508806310, now seen corresponding path program 1 times [2022-04-28 03:41:49,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:49,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698130364] [2022-04-28 03:41:49,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:49,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:49,331 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:49,339 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:49,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:49,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {1588#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1581#true} is VALID [2022-04-28 03:41:49,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {1581#true} assume true; {1581#true} is VALID [2022-04-28 03:41:49,371 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1581#true} {1581#true} #94#return; {1581#true} is VALID [2022-04-28 03:41:49,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {1581#true} call ULTIMATE.init(); {1588#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:49,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {1588#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1581#true} is VALID [2022-04-28 03:41:49,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {1581#true} assume true; {1581#true} is VALID [2022-04-28 03:41:49,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1581#true} {1581#true} #94#return; {1581#true} is VALID [2022-04-28 03:41:49,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {1581#true} call #t~ret17 := main(); {1581#true} is VALID [2022-04-28 03:41:49,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {1581#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1581#true} is VALID [2022-04-28 03:41:49,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {1581#true} [108] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_52 v_main_~y~0_51)) (.cse1 (= |v_main_#t~post5_29| |v_main_#t~post5_28|)) (.cse2 (mod v_main_~x~0_50 4294967296))) (or (and (= |v_main_#t~post6_29| |v_main_#t~post6_28|) (= v_main_~x~0_50 v_main_~x~0_49) .cse0 .cse1) (and (= v_main_~x~0_49 v_main_~x~0_50) (= |v_main_#t~post6_28| |v_main_#t~post6_29|) .cse0 (<= .cse2 0) .cse1) (and (< 0 .cse2) (< v_main_~x~0_49 v_main_~x~0_50) (= v_main_~y~0_51 (+ v_main_~x~0_50 v_main_~y~0_52 (* (- 1) v_main_~x~0_49))) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~x~0_49 v_it_6 1) v_main_~x~0_50)) (not (<= 1 v_it_6)) (< 0 (mod (+ v_main_~x~0_50 (* v_it_6 4294967295)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_52, main_#t~post5=|v_main_#t~post5_29|, main_~x~0=v_main_~x~0_50, main_#t~post6=|v_main_#t~post6_29|} OutVars{main_~y~0=v_main_~y~0_51, main_#t~post5=|v_main_#t~post5_28|, main_~x~0=v_main_~x~0_49, main_#t~post6=|v_main_#t~post6_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1581#true} is VALID [2022-04-28 03:41:49,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {1581#true} [107] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1586#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:49,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {1586#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1586#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:49,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {1586#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1587#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:41:49,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {1587#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1587#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:41:49,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {1587#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1587#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:41:49,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {1587#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1587#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:41:49,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {1587#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1582#false} is VALID [2022-04-28 03:41:49,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {1582#false} assume !(~z~0 % 4294967296 > 0); {1582#false} is VALID [2022-04-28 03:41:49,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {1582#false} assume !(~y~0 % 4294967296 > 0); {1582#false} is VALID [2022-04-28 03:41:49,376 INFO L272 TraceCheckUtils]: 16: Hoare triple {1582#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1582#false} is VALID [2022-04-28 03:41:49,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {1582#false} ~cond := #in~cond; {1582#false} is VALID [2022-04-28 03:41:49,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {1582#false} assume 0 == ~cond; {1582#false} is VALID [2022-04-28 03:41:49,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {1582#false} assume !false; {1582#false} is VALID [2022-04-28 03:41:49,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:41:49,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:49,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698130364] [2022-04-28 03:41:49,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698130364] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:41:49,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130712424] [2022-04-28 03:41:49,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:49,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:49,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:49,380 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:41:49,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 03:41:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:49,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:41:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:49,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:41:49,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {1581#true} call ULTIMATE.init(); {1581#true} is VALID [2022-04-28 03:41:49,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {1581#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1581#true} is VALID [2022-04-28 03:41:49,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {1581#true} assume true; {1581#true} is VALID [2022-04-28 03:41:49,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1581#true} {1581#true} #94#return; {1581#true} is VALID [2022-04-28 03:41:49,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {1581#true} call #t~ret17 := main(); {1581#true} is VALID [2022-04-28 03:41:49,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {1581#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1581#true} is VALID [2022-04-28 03:41:49,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {1581#true} [108] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_52 v_main_~y~0_51)) (.cse1 (= |v_main_#t~post5_29| |v_main_#t~post5_28|)) (.cse2 (mod v_main_~x~0_50 4294967296))) (or (and (= |v_main_#t~post6_29| |v_main_#t~post6_28|) (= v_main_~x~0_50 v_main_~x~0_49) .cse0 .cse1) (and (= v_main_~x~0_49 v_main_~x~0_50) (= |v_main_#t~post6_28| |v_main_#t~post6_29|) .cse0 (<= .cse2 0) .cse1) (and (< 0 .cse2) (< v_main_~x~0_49 v_main_~x~0_50) (= v_main_~y~0_51 (+ v_main_~x~0_50 v_main_~y~0_52 (* (- 1) v_main_~x~0_49))) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~x~0_49 v_it_6 1) v_main_~x~0_50)) (not (<= 1 v_it_6)) (< 0 (mod (+ v_main_~x~0_50 (* v_it_6 4294967295)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_52, main_#t~post5=|v_main_#t~post5_29|, main_~x~0=v_main_~x~0_50, main_#t~post6=|v_main_#t~post6_29|} OutVars{main_~y~0=v_main_~y~0_51, main_#t~post5=|v_main_#t~post5_28|, main_~x~0=v_main_~x~0_49, main_#t~post6=|v_main_#t~post6_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1581#true} is VALID [2022-04-28 03:41:49,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {1581#true} [107] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1581#true} is VALID [2022-04-28 03:41:49,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {1581#true} ~z~0 := ~y~0; {1581#true} is VALID [2022-04-28 03:41:49,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {1581#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1619#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:41:49,487 INFO L290 TraceCheckUtils]: 10: Hoare triple {1619#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !(~z~0 % 4294967296 > 0); {1619#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:41:49,488 INFO L290 TraceCheckUtils]: 11: Hoare triple {1619#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1626#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:41:49,488 INFO L290 TraceCheckUtils]: 12: Hoare triple {1626#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1626#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:41:49,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {1626#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1626#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:41:49,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {1626#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1582#false} is VALID [2022-04-28 03:41:49,489 INFO L290 TraceCheckUtils]: 15: Hoare triple {1582#false} assume !(~y~0 % 4294967296 > 0); {1582#false} is VALID [2022-04-28 03:41:49,489 INFO L272 TraceCheckUtils]: 16: Hoare triple {1582#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1582#false} is VALID [2022-04-28 03:41:49,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {1582#false} ~cond := #in~cond; {1582#false} is VALID [2022-04-28 03:41:49,489 INFO L290 TraceCheckUtils]: 18: Hoare triple {1582#false} assume 0 == ~cond; {1582#false} is VALID [2022-04-28 03:41:49,489 INFO L290 TraceCheckUtils]: 19: Hoare triple {1582#false} assume !false; {1582#false} is VALID [2022-04-28 03:41:49,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:41:49,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:41:49,549 INFO L290 TraceCheckUtils]: 19: Hoare triple {1582#false} assume !false; {1582#false} is VALID [2022-04-28 03:41:49,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {1582#false} assume 0 == ~cond; {1582#false} is VALID [2022-04-28 03:41:49,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {1582#false} ~cond := #in~cond; {1582#false} is VALID [2022-04-28 03:41:49,550 INFO L272 TraceCheckUtils]: 16: Hoare triple {1582#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1582#false} is VALID [2022-04-28 03:41:49,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {1582#false} assume !(~y~0 % 4294967296 > 0); {1582#false} is VALID [2022-04-28 03:41:49,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {1626#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1582#false} is VALID [2022-04-28 03:41:49,551 INFO L290 TraceCheckUtils]: 13: Hoare triple {1626#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1626#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:41:49,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {1626#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1626#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:41:49,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {1619#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1626#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:41:49,552 INFO L290 TraceCheckUtils]: 10: Hoare triple {1619#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !(~z~0 % 4294967296 > 0); {1619#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:41:49,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {1581#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1619#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:41:49,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {1581#true} ~z~0 := ~y~0; {1581#true} is VALID [2022-04-28 03:41:49,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {1581#true} [107] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1581#true} is VALID [2022-04-28 03:41:49,553 INFO L290 TraceCheckUtils]: 6: Hoare triple {1581#true} [108] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_52 v_main_~y~0_51)) (.cse1 (= |v_main_#t~post5_29| |v_main_#t~post5_28|)) (.cse2 (mod v_main_~x~0_50 4294967296))) (or (and (= |v_main_#t~post6_29| |v_main_#t~post6_28|) (= v_main_~x~0_50 v_main_~x~0_49) .cse0 .cse1) (and (= v_main_~x~0_49 v_main_~x~0_50) (= |v_main_#t~post6_28| |v_main_#t~post6_29|) .cse0 (<= .cse2 0) .cse1) (and (< 0 .cse2) (< v_main_~x~0_49 v_main_~x~0_50) (= v_main_~y~0_51 (+ v_main_~x~0_50 v_main_~y~0_52 (* (- 1) v_main_~x~0_49))) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~x~0_49 v_it_6 1) v_main_~x~0_50)) (not (<= 1 v_it_6)) (< 0 (mod (+ v_main_~x~0_50 (* v_it_6 4294967295)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_52, main_#t~post5=|v_main_#t~post5_29|, main_~x~0=v_main_~x~0_50, main_#t~post6=|v_main_#t~post6_29|} OutVars{main_~y~0=v_main_~y~0_51, main_#t~post5=|v_main_#t~post5_28|, main_~x~0=v_main_~x~0_49, main_#t~post6=|v_main_#t~post6_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1581#true} is VALID [2022-04-28 03:41:49,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {1581#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1581#true} is VALID [2022-04-28 03:41:49,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {1581#true} call #t~ret17 := main(); {1581#true} is VALID [2022-04-28 03:41:49,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1581#true} {1581#true} #94#return; {1581#true} is VALID [2022-04-28 03:41:49,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {1581#true} assume true; {1581#true} is VALID [2022-04-28 03:41:49,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {1581#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1581#true} is VALID [2022-04-28 03:41:49,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {1581#true} call ULTIMATE.init(); {1581#true} is VALID [2022-04-28 03:41:49,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:41:49,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130712424] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:41:49,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:41:49,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-28 03:41:49,605 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:49,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [682554948] [2022-04-28 03:41:49,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [682554948] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:49,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:49,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:41:49,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074675754] [2022-04-28 03:41:49,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:49,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 03:41:49,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:49,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:49,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:49,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:41:49,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:49,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:41:49,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:41:49,622 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:50,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:50,013 INFO L93 Difference]: Finished difference Result 60 states and 86 transitions. [2022-04-28 03:41:50,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:41:50,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 03:41:50,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:50,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:50,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-04-28 03:41:50,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:50,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-04-28 03:41:50,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 61 transitions. [2022-04-28 03:41:50,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:50,068 INFO L225 Difference]: With dead ends: 60 [2022-04-28 03:41:50,068 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 03:41:50,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:41:50,069 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 50 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:50,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 39 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:41:50,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 03:41:50,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 33. [2022-04-28 03:41:50,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:50,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:50,140 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:50,140 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:50,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:50,142 INFO L93 Difference]: Finished difference Result 53 states and 77 transitions. [2022-04-28 03:41:50,142 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 77 transitions. [2022-04-28 03:41:50,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:50,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:50,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-28 03:41:50,142 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-28 03:41:50,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:50,143 INFO L93 Difference]: Finished difference Result 53 states and 77 transitions. [2022-04-28 03:41:50,143 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 77 transitions. [2022-04-28 03:41:50,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:50,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:50,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:50,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:50,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:50,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2022-04-28 03:41:50,144 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 20 [2022-04-28 03:41:50,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:50,144 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2022-04-28 03:41:50,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:50,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 46 transitions. [2022-04-28 03:41:54,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 44 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:54,314 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2022-04-28 03:41:54,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 03:41:54,314 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:54,314 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:54,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 03:41:54,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:54,515 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:54,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:54,516 INFO L85 PathProgramCache]: Analyzing trace with hash 30273528, now seen corresponding path program 1 times [2022-04-28 03:41:54,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:54,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1756352213] [2022-04-28 03:41:54,688 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:41:54,690 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:54,691 INFO L85 PathProgramCache]: Analyzing trace with hash -62207689, now seen corresponding path program 1 times [2022-04-28 03:41:54,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:54,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106369654] [2022-04-28 03:41:54,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:54,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:54,700 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_7.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:54,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:54,709 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_7.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:54,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:54,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {2018#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2011#true} is VALID [2022-04-28 03:41:54,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {2011#true} assume true; {2011#true} is VALID [2022-04-28 03:41:54,737 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2011#true} {2011#true} #94#return; {2011#true} is VALID [2022-04-28 03:41:54,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {2011#true} call ULTIMATE.init(); {2018#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:54,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {2018#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2011#true} is VALID [2022-04-28 03:41:54,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {2011#true} assume true; {2011#true} is VALID [2022-04-28 03:41:54,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2011#true} {2011#true} #94#return; {2011#true} is VALID [2022-04-28 03:41:54,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {2011#true} call #t~ret17 := main(); {2011#true} is VALID [2022-04-28 03:41:54,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {2011#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2011#true} is VALID [2022-04-28 03:41:54,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {2011#true} [110] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_58 v_main_~x~0_57)) (.cse2 (= |v_main_#t~post5_34| |v_main_#t~post5_33|)) (.cse3 (= |v_main_#t~post6_34| |v_main_#t~post6_33|)) (.cse0 (mod v_main_~x~0_58 4294967296))) (or (and (<= .cse0 0) .cse1 (= v_main_~y~0_59 v_main_~y~0_60) .cse2 .cse3) (and .cse1 (= v_main_~y~0_60 v_main_~y~0_59) .cse2 .cse3) (and (= v_main_~y~0_59 (+ v_main_~x~0_58 v_main_~y~0_60 (* (- 1) v_main_~x~0_57))) (< 0 .cse0) (forall ((v_it_7 Int)) (or (< 0 (mod (+ v_main_~x~0_58 (* v_it_7 4294967295)) 4294967296)) (not (<= (+ v_main_~x~0_57 v_it_7 1) v_main_~x~0_58)) (not (<= 1 v_it_7)))) (< v_main_~x~0_57 v_main_~x~0_58)))) InVars {main_~y~0=v_main_~y~0_60, main_#t~post5=|v_main_#t~post5_34|, main_~x~0=v_main_~x~0_58, main_#t~post6=|v_main_#t~post6_34|} OutVars{main_~y~0=v_main_~y~0_59, main_#t~post5=|v_main_#t~post5_33|, main_~x~0=v_main_~x~0_57, main_#t~post6=|v_main_#t~post6_33|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2011#true} is VALID [2022-04-28 03:41:54,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {2011#true} [109] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2011#true} is VALID [2022-04-28 03:41:54,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {2011#true} ~z~0 := ~y~0; {2016#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:41:54,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {2016#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2017#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:41:54,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {2017#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~z~0 % 4294967296 > 0); {2017#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:41:54,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {2017#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {2012#false} is VALID [2022-04-28 03:41:54,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {2012#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2012#false} is VALID [2022-04-28 03:41:54,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {2012#false} assume !(~x~0 % 4294967296 > 0); {2012#false} is VALID [2022-04-28 03:41:54,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {2012#false} assume !(~z~0 % 4294967296 > 0); {2012#false} is VALID [2022-04-28 03:41:54,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {2012#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {2012#false} is VALID [2022-04-28 03:41:54,741 INFO L290 TraceCheckUtils]: 16: Hoare triple {2012#false} assume !(~y~0 % 4294967296 > 0); {2012#false} is VALID [2022-04-28 03:41:54,741 INFO L272 TraceCheckUtils]: 17: Hoare triple {2012#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2012#false} is VALID [2022-04-28 03:41:54,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {2012#false} ~cond := #in~cond; {2012#false} is VALID [2022-04-28 03:41:54,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {2012#false} assume 0 == ~cond; {2012#false} is VALID [2022-04-28 03:41:54,741 INFO L290 TraceCheckUtils]: 20: Hoare triple {2012#false} assume !false; {2012#false} is VALID [2022-04-28 03:41:54,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:41:54,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:54,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106369654] [2022-04-28 03:41:54,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106369654] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:41:54,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369598706] [2022-04-28 03:41:54,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:54,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:54,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:54,742 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:41:54,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 03:41:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:54,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:41:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:54,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:41:55,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {2011#true} call ULTIMATE.init(); {2011#true} is VALID [2022-04-28 03:41:55,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {2011#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2011#true} is VALID [2022-04-28 03:41:55,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {2011#true} assume true; {2011#true} is VALID [2022-04-28 03:41:55,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2011#true} {2011#true} #94#return; {2011#true} is VALID [2022-04-28 03:41:55,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {2011#true} call #t~ret17 := main(); {2011#true} is VALID [2022-04-28 03:41:55,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {2011#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2011#true} is VALID [2022-04-28 03:41:55,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {2011#true} [110] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_58 v_main_~x~0_57)) (.cse2 (= |v_main_#t~post5_34| |v_main_#t~post5_33|)) (.cse3 (= |v_main_#t~post6_34| |v_main_#t~post6_33|)) (.cse0 (mod v_main_~x~0_58 4294967296))) (or (and (<= .cse0 0) .cse1 (= v_main_~y~0_59 v_main_~y~0_60) .cse2 .cse3) (and .cse1 (= v_main_~y~0_60 v_main_~y~0_59) .cse2 .cse3) (and (= v_main_~y~0_59 (+ v_main_~x~0_58 v_main_~y~0_60 (* (- 1) v_main_~x~0_57))) (< 0 .cse0) (forall ((v_it_7 Int)) (or (< 0 (mod (+ v_main_~x~0_58 (* v_it_7 4294967295)) 4294967296)) (not (<= (+ v_main_~x~0_57 v_it_7 1) v_main_~x~0_58)) (not (<= 1 v_it_7)))) (< v_main_~x~0_57 v_main_~x~0_58)))) InVars {main_~y~0=v_main_~y~0_60, main_#t~post5=|v_main_#t~post5_34|, main_~x~0=v_main_~x~0_58, main_#t~post6=|v_main_#t~post6_34|} OutVars{main_~y~0=v_main_~y~0_59, main_#t~post5=|v_main_#t~post5_33|, main_~x~0=v_main_~x~0_57, main_#t~post6=|v_main_#t~post6_33|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2011#true} is VALID [2022-04-28 03:41:55,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {2011#true} [109] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2011#true} is VALID [2022-04-28 03:41:55,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {2011#true} ~z~0 := ~y~0; {2016#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:41:55,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {2016#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2049#(and (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:41:55,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {2049#(and (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2049#(and (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:41:55,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {2049#(and (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2049#(and (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:41:55,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {2049#(and (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2059#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-28 03:41:55,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {2059#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} assume !(~x~0 % 4294967296 > 0); {2059#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-28 03:41:55,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {2059#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} assume !(~z~0 % 4294967296 > 0); {2059#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-28 03:41:55,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {2059#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {2017#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:41:55,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {2017#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {2012#false} is VALID [2022-04-28 03:41:55,090 INFO L272 TraceCheckUtils]: 17: Hoare triple {2012#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2012#false} is VALID [2022-04-28 03:41:55,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {2012#false} ~cond := #in~cond; {2012#false} is VALID [2022-04-28 03:41:55,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {2012#false} assume 0 == ~cond; {2012#false} is VALID [2022-04-28 03:41:55,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {2012#false} assume !false; {2012#false} is VALID [2022-04-28 03:41:55,091 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:41:55,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:41:55,336 INFO L290 TraceCheckUtils]: 20: Hoare triple {2012#false} assume !false; {2012#false} is VALID [2022-04-28 03:41:55,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {2012#false} assume 0 == ~cond; {2012#false} is VALID [2022-04-28 03:41:55,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {2012#false} ~cond := #in~cond; {2012#false} is VALID [2022-04-28 03:41:55,337 INFO L272 TraceCheckUtils]: 17: Hoare triple {2012#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2012#false} is VALID [2022-04-28 03:41:55,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {2017#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {2012#false} is VALID [2022-04-28 03:41:55,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {2099#(<= (+ 2 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))) main_~y~0)} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {2017#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:41:55,338 INFO L290 TraceCheckUtils]: 14: Hoare triple {2099#(<= (+ 2 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))) main_~y~0)} assume !(~z~0 % 4294967296 > 0); {2099#(<= (+ 2 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))) main_~y~0)} is VALID [2022-04-28 03:41:55,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {2099#(<= (+ 2 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))) main_~y~0)} assume !(~x~0 % 4294967296 > 0); {2099#(<= (+ 2 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))) main_~y~0)} is VALID [2022-04-28 03:41:55,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {2017#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2099#(<= (+ 2 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))) main_~y~0)} is VALID [2022-04-28 03:41:55,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {2017#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {2017#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:41:55,340 INFO L290 TraceCheckUtils]: 10: Hoare triple {2017#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~z~0 % 4294967296 > 0); {2017#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:41:55,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {2118#(or (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0) (<= (mod main_~z~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2017#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:41:55,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {2011#true} ~z~0 := ~y~0; {2118#(or (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-28 03:41:55,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {2011#true} [109] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2011#true} is VALID [2022-04-28 03:41:55,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {2011#true} [110] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_58 v_main_~x~0_57)) (.cse2 (= |v_main_#t~post5_34| |v_main_#t~post5_33|)) (.cse3 (= |v_main_#t~post6_34| |v_main_#t~post6_33|)) (.cse0 (mod v_main_~x~0_58 4294967296))) (or (and (<= .cse0 0) .cse1 (= v_main_~y~0_59 v_main_~y~0_60) .cse2 .cse3) (and .cse1 (= v_main_~y~0_60 v_main_~y~0_59) .cse2 .cse3) (and (= v_main_~y~0_59 (+ v_main_~x~0_58 v_main_~y~0_60 (* (- 1) v_main_~x~0_57))) (< 0 .cse0) (forall ((v_it_7 Int)) (or (< 0 (mod (+ v_main_~x~0_58 (* v_it_7 4294967295)) 4294967296)) (not (<= (+ v_main_~x~0_57 v_it_7 1) v_main_~x~0_58)) (not (<= 1 v_it_7)))) (< v_main_~x~0_57 v_main_~x~0_58)))) InVars {main_~y~0=v_main_~y~0_60, main_#t~post5=|v_main_#t~post5_34|, main_~x~0=v_main_~x~0_58, main_#t~post6=|v_main_#t~post6_34|} OutVars{main_~y~0=v_main_~y~0_59, main_#t~post5=|v_main_#t~post5_33|, main_~x~0=v_main_~x~0_57, main_#t~post6=|v_main_#t~post6_33|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2011#true} is VALID [2022-04-28 03:41:55,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {2011#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2011#true} is VALID [2022-04-28 03:41:55,342 INFO L272 TraceCheckUtils]: 4: Hoare triple {2011#true} call #t~ret17 := main(); {2011#true} is VALID [2022-04-28 03:41:55,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2011#true} {2011#true} #94#return; {2011#true} is VALID [2022-04-28 03:41:55,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {2011#true} assume true; {2011#true} is VALID [2022-04-28 03:41:55,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {2011#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2011#true} is VALID [2022-04-28 03:41:55,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {2011#true} call ULTIMATE.init(); {2011#true} is VALID [2022-04-28 03:41:55,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:41:55,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369598706] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:41:55,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:41:55,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 9 [2022-04-28 03:41:55,366 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:55,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1756352213] [2022-04-28 03:41:55,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1756352213] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:55,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:55,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:41:55,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761063985] [2022-04-28 03:41:55,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:55,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 03:41:55,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:55,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:55,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:55,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:41:55,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:55,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:41:55,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:41:55,396 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:55,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:55,629 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2022-04-28 03:41:55,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:41:55,629 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 03:41:55,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:55,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:55,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-28 03:41:55,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:55,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-28 03:41:55,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2022-04-28 03:41:55,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:55,668 INFO L225 Difference]: With dead ends: 44 [2022-04-28 03:41:55,669 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 03:41:55,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-28 03:41:55,671 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:55,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 36 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:41:55,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 03:41:55,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-04-28 03:41:55,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:55,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:55,731 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:55,731 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:55,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:55,732 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2022-04-28 03:41:55,732 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2022-04-28 03:41:55,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:55,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:55,732 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-28 03:41:55,733 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-28 03:41:55,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:55,733 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2022-04-28 03:41:55,733 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2022-04-28 03:41:55,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:55,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:55,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:55,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:55,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:55,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2022-04-28 03:41:55,734 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 21 [2022-04-28 03:41:55,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:55,734 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2022-04-28 03:41:55,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:55,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 39 transitions. [2022-04-28 03:41:59,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 37 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:59,847 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2022-04-28 03:41:59,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 03:41:59,847 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:59,848 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:59,864 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:42:00,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-28 03:42:00,048 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:00,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:00,049 INFO L85 PathProgramCache]: Analyzing trace with hash -694813431, now seen corresponding path program 1 times [2022-04-28 03:42:00,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:00,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1036943234] [2022-04-28 03:42:02,136 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:42:02,215 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:42:02,217 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:42:02,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1216691720, now seen corresponding path program 1 times [2022-04-28 03:42:02,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:02,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105143719] [2022-04-28 03:42:02,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:02,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:02,230 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_8.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-28 03:42:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:02,243 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_8.2))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-28 03:42:02,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:02,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {2384#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2370#true} is VALID [2022-04-28 03:42:02,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {2370#true} assume true; {2370#true} is VALID [2022-04-28 03:42:02,408 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2370#true} {2370#true} #94#return; {2370#true} is VALID [2022-04-28 03:42:02,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {2370#true} call ULTIMATE.init(); {2384#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:02,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {2384#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2370#true} is VALID [2022-04-28 03:42:02,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {2370#true} assume true; {2370#true} is VALID [2022-04-28 03:42:02,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2370#true} {2370#true} #94#return; {2370#true} is VALID [2022-04-28 03:42:02,409 INFO L272 TraceCheckUtils]: 4: Hoare triple {2370#true} call #t~ret17 := main(); {2370#true} is VALID [2022-04-28 03:42:02,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {2370#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2375#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:42:02,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {2375#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [112] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_67 4294967296)) (.cse1 (= |v_main_#t~post6_39| |v_main_#t~post6_38|)) (.cse2 (= v_main_~y~0_71 v_main_~y~0_70)) (.cse3 (= v_main_~x~0_67 v_main_~x~0_66))) (or (and (< 0 .cse0) (< v_main_~x~0_66 v_main_~x~0_67) (= v_main_~y~0_70 (+ v_main_~x~0_67 v_main_~y~0_71 (* (- 1) v_main_~x~0_66))) (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_67) 4294967296)) (not (<= (+ v_main_~x~0_66 v_it_8 1) v_main_~x~0_67)) (not (<= 1 v_it_8))))) (and (= |v_main_#t~post5_38| |v_main_#t~post5_39|) .cse1 .cse2 (<= .cse0 0) .cse3) (and .cse1 (= |v_main_#t~post5_39| |v_main_#t~post5_38|) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_71, main_#t~post5=|v_main_#t~post5_39|, main_~x~0=v_main_~x~0_67, main_#t~post6=|v_main_#t~post6_39|} OutVars{main_~y~0=v_main_~y~0_70, main_#t~post5=|v_main_#t~post5_38|, main_~x~0=v_main_~x~0_66, main_#t~post6=|v_main_#t~post6_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2376#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))))} is VALID [2022-04-28 03:42:02,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {2376#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))))} [111] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2377#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-28 03:42:02,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {2377#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} ~z~0 := ~y~0; {2378#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (and (<= (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-28 03:42:02,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {2378#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (and (<= (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2379#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:02,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {2379#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {2379#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:02,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {2379#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2380#(< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:02,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {2380#(< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {2380#(< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:02,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {2380#(< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2380#(< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:02,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {2380#(< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1))} assume !(~x~0 % 4294967296 > 0); {2380#(< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:02,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {2380#(< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {2381#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:42:02,417 INFO L290 TraceCheckUtils]: 16: Hoare triple {2381#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {2381#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:42:02,418 INFO L272 TraceCheckUtils]: 17: Hoare triple {2381#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2382#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:42:02,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {2382#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2383#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:42:02,419 INFO L290 TraceCheckUtils]: 19: Hoare triple {2383#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2371#false} is VALID [2022-04-28 03:42:02,419 INFO L290 TraceCheckUtils]: 20: Hoare triple {2371#false} assume !false; {2371#false} is VALID [2022-04-28 03:42:02,419 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:42:02,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:02,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105143719] [2022-04-28 03:42:02,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105143719] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:42:02,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228063235] [2022-04-28 03:42:02,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:02,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:02,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:42:02,420 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:42:02,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 03:42:02,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:02,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:42:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:02,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:42:02,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {2370#true} call ULTIMATE.init(); {2370#true} is VALID [2022-04-28 03:42:02,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {2370#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2370#true} is VALID [2022-04-28 03:42:02,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {2370#true} assume true; {2370#true} is VALID [2022-04-28 03:42:02,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2370#true} {2370#true} #94#return; {2370#true} is VALID [2022-04-28 03:42:02,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {2370#true} call #t~ret17 := main(); {2370#true} is VALID [2022-04-28 03:42:02,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {2370#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2370#true} is VALID [2022-04-28 03:42:02,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {2370#true} [112] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_67 4294967296)) (.cse1 (= |v_main_#t~post6_39| |v_main_#t~post6_38|)) (.cse2 (= v_main_~y~0_71 v_main_~y~0_70)) (.cse3 (= v_main_~x~0_67 v_main_~x~0_66))) (or (and (< 0 .cse0) (< v_main_~x~0_66 v_main_~x~0_67) (= v_main_~y~0_70 (+ v_main_~x~0_67 v_main_~y~0_71 (* (- 1) v_main_~x~0_66))) (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_67) 4294967296)) (not (<= (+ v_main_~x~0_66 v_it_8 1) v_main_~x~0_67)) (not (<= 1 v_it_8))))) (and (= |v_main_#t~post5_38| |v_main_#t~post5_39|) .cse1 .cse2 (<= .cse0 0) .cse3) (and .cse1 (= |v_main_#t~post5_39| |v_main_#t~post5_38|) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_71, main_#t~post5=|v_main_#t~post5_39|, main_~x~0=v_main_~x~0_67, main_#t~post6=|v_main_#t~post6_39|} OutVars{main_~y~0=v_main_~y~0_70, main_#t~post5=|v_main_#t~post5_38|, main_~x~0=v_main_~x~0_66, main_#t~post6=|v_main_#t~post6_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2370#true} is VALID [2022-04-28 03:42:02,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {2370#true} [111] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2370#true} is VALID [2022-04-28 03:42:02,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {2370#true} ~z~0 := ~y~0; {2370#true} is VALID [2022-04-28 03:42:02,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {2370#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2415#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:42:02,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {2415#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2415#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:42:02,535 INFO L290 TraceCheckUtils]: 11: Hoare triple {2415#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2422#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:02,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {2422#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {2422#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:02,536 INFO L290 TraceCheckUtils]: 13: Hoare triple {2422#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2422#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:02,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {2422#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {2422#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:02,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {2422#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {2371#false} is VALID [2022-04-28 03:42:02,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {2371#false} assume !(~y~0 % 4294967296 > 0); {2371#false} is VALID [2022-04-28 03:42:02,537 INFO L272 TraceCheckUtils]: 17: Hoare triple {2371#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2371#false} is VALID [2022-04-28 03:42:02,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {2371#false} ~cond := #in~cond; {2371#false} is VALID [2022-04-28 03:42:02,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {2371#false} assume 0 == ~cond; {2371#false} is VALID [2022-04-28 03:42:02,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {2371#false} assume !false; {2371#false} is VALID [2022-04-28 03:42:02,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:42:02,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:42:02,599 INFO L290 TraceCheckUtils]: 20: Hoare triple {2371#false} assume !false; {2371#false} is VALID [2022-04-28 03:42:02,599 INFO L290 TraceCheckUtils]: 19: Hoare triple {2371#false} assume 0 == ~cond; {2371#false} is VALID [2022-04-28 03:42:02,599 INFO L290 TraceCheckUtils]: 18: Hoare triple {2371#false} ~cond := #in~cond; {2371#false} is VALID [2022-04-28 03:42:02,599 INFO L272 TraceCheckUtils]: 17: Hoare triple {2371#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2371#false} is VALID [2022-04-28 03:42:02,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {2371#false} assume !(~y~0 % 4294967296 > 0); {2371#false} is VALID [2022-04-28 03:42:02,599 INFO L290 TraceCheckUtils]: 15: Hoare triple {2422#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {2371#false} is VALID [2022-04-28 03:42:02,600 INFO L290 TraceCheckUtils]: 14: Hoare triple {2422#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {2422#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:02,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {2422#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2422#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:02,600 INFO L290 TraceCheckUtils]: 12: Hoare triple {2422#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {2422#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:02,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {2415#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2422#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:02,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {2415#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2415#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:42:02,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {2370#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2415#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:42:02,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {2370#true} ~z~0 := ~y~0; {2370#true} is VALID [2022-04-28 03:42:02,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {2370#true} [111] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2370#true} is VALID [2022-04-28 03:42:02,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {2370#true} [112] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_67 4294967296)) (.cse1 (= |v_main_#t~post6_39| |v_main_#t~post6_38|)) (.cse2 (= v_main_~y~0_71 v_main_~y~0_70)) (.cse3 (= v_main_~x~0_67 v_main_~x~0_66))) (or (and (< 0 .cse0) (< v_main_~x~0_66 v_main_~x~0_67) (= v_main_~y~0_70 (+ v_main_~x~0_67 v_main_~y~0_71 (* (- 1) v_main_~x~0_66))) (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_67) 4294967296)) (not (<= (+ v_main_~x~0_66 v_it_8 1) v_main_~x~0_67)) (not (<= 1 v_it_8))))) (and (= |v_main_#t~post5_38| |v_main_#t~post5_39|) .cse1 .cse2 (<= .cse0 0) .cse3) (and .cse1 (= |v_main_#t~post5_39| |v_main_#t~post5_38|) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_71, main_#t~post5=|v_main_#t~post5_39|, main_~x~0=v_main_~x~0_67, main_#t~post6=|v_main_#t~post6_39|} OutVars{main_~y~0=v_main_~y~0_70, main_#t~post5=|v_main_#t~post5_38|, main_~x~0=v_main_~x~0_66, main_#t~post6=|v_main_#t~post6_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2370#true} is VALID [2022-04-28 03:42:02,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {2370#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2370#true} is VALID [2022-04-28 03:42:02,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {2370#true} call #t~ret17 := main(); {2370#true} is VALID [2022-04-28 03:42:02,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2370#true} {2370#true} #94#return; {2370#true} is VALID [2022-04-28 03:42:02,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {2370#true} assume true; {2370#true} is VALID [2022-04-28 03:42:02,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {2370#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2370#true} is VALID [2022-04-28 03:42:02,605 INFO L272 TraceCheckUtils]: 0: Hoare triple {2370#true} call ULTIMATE.init(); {2370#true} is VALID [2022-04-28 03:42:02,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:42:02,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228063235] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:42:02,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:42:02,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4, 4] total 14 [2022-04-28 03:42:02,876 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:02,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1036943234] [2022-04-28 03:42:02,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1036943234] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:02,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:02,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 03:42:02,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529483480] [2022-04-28 03:42:02,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:02,878 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 03:42:02,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:02,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:02,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:02,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 03:42:02,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:02,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 03:42:02,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-04-28 03:42:02,902 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:03,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:03,667 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2022-04-28 03:42:03,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 03:42:03,667 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 03:42:03,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:03,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:03,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 45 transitions. [2022-04-28 03:42:03,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:03,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 45 transitions. [2022-04-28 03:42:03,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 45 transitions. [2022-04-28 03:42:03,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:03,854 INFO L225 Difference]: With dead ends: 43 [2022-04-28 03:42:03,854 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 03:42:03,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2022-04-28 03:42:03,855 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 31 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:03,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 52 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 142 Invalid, 0 Unknown, 25 Unchecked, 0.2s Time] [2022-04-28 03:42:03,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 03:42:03,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-28 03:42:03,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:03,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 37 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:03,941 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 37 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:03,942 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 37 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:03,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:03,943 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2022-04-28 03:42:03,943 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2022-04-28 03:42:03,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:03,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:03,943 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-28 03:42:03,943 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-28 03:42:03,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:03,944 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2022-04-28 03:42:03,944 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2022-04-28 03:42:03,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:03,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:03,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:03,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:03,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:03,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 52 transitions. [2022-04-28 03:42:03,945 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 52 transitions. Word has length 21 [2022-04-28 03:42:03,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:03,945 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 52 transitions. [2022-04-28 03:42:03,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:03,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 52 transitions. [2022-04-28 03:42:06,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 51 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:06,357 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 52 transitions. [2022-04-28 03:42:06,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 03:42:06,357 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:06,357 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:06,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-28 03:42:06,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:06,558 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:06,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:06,558 INFO L85 PathProgramCache]: Analyzing trace with hash -29884763, now seen corresponding path program 1 times [2022-04-28 03:42:06,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:06,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [644487236] [2022-04-28 03:42:08,814 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:42:08,816 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:42:08,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1091268038, now seen corresponding path program 1 times [2022-04-28 03:42:08,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:08,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395675778] [2022-04-28 03:42:08,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:08,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:08,830 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_9.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:08,842 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_9.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:08,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:08,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {2773#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2762#true} is VALID [2022-04-28 03:42:08,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {2762#true} assume true; {2762#true} is VALID [2022-04-28 03:42:08,944 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2762#true} {2762#true} #94#return; {2762#true} is VALID [2022-04-28 03:42:08,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {2762#true} call ULTIMATE.init(); {2773#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:08,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {2773#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2762#true} is VALID [2022-04-28 03:42:08,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {2762#true} assume true; {2762#true} is VALID [2022-04-28 03:42:08,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2762#true} {2762#true} #94#return; {2762#true} is VALID [2022-04-28 03:42:08,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {2762#true} call #t~ret17 := main(); {2762#true} is VALID [2022-04-28 03:42:08,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {2762#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2767#(= main_~y~0 0)} is VALID [2022-04-28 03:42:08,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {2767#(= main_~y~0 0)} [114] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_76 4294967296)) (.cse1 (= |v_main_#t~post6_44| |v_main_#t~post6_43|)) (.cse2 (= v_main_~x~0_76 v_main_~x~0_75)) (.cse3 (= |v_main_#t~post5_44| |v_main_#t~post5_43|))) (or (and (< v_main_~y~0_80 v_main_~y~0_79) (< 0 .cse0) (forall ((v_it_9 Int)) (or (< 0 (mod (+ v_main_~x~0_76 (* v_it_9 4294967295)) 4294967296)) (not (<= 1 v_it_9)) (not (<= (+ v_main_~y~0_80 v_it_9 1) v_main_~y~0_79)))) (= v_main_~x~0_75 (+ v_main_~x~0_76 v_main_~y~0_80 (* (- 1) v_main_~y~0_79)))) (and (= v_main_~y~0_79 v_main_~y~0_80) .cse1 .cse2 .cse3 (<= .cse0 0)) (and .cse1 .cse2 (= v_main_~y~0_80 v_main_~y~0_79) .cse3))) InVars {main_~y~0=v_main_~y~0_80, main_#t~post5=|v_main_#t~post5_44|, main_~x~0=v_main_~x~0_76, main_#t~post6=|v_main_#t~post6_44|} OutVars{main_~y~0=v_main_~y~0_79, main_#t~post5=|v_main_#t~post5_43|, main_~x~0=v_main_~x~0_75, main_#t~post6=|v_main_#t~post6_43|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2768#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) 4294967295)))} is VALID [2022-04-28 03:42:08,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {2768#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) 4294967295)))} [113] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2769#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ 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:42:08,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {2769#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ 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; {2770#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (<= (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* (div (+ (- 1) main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))))} is VALID [2022-04-28 03:42:08,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {2770#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (<= (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* (div (+ (- 1) main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2771#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:08,950 INFO L290 TraceCheckUtils]: 10: Hoare triple {2771#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2771#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:08,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {2771#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:42:08,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:42:08,952 INFO L290 TraceCheckUtils]: 13: Hoare triple {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:42:08,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:42:08,952 INFO L290 TraceCheckUtils]: 15: Hoare triple {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {2763#false} is VALID [2022-04-28 03:42:08,952 INFO L290 TraceCheckUtils]: 16: Hoare triple {2763#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {2763#false} is VALID [2022-04-28 03:42:08,952 INFO L290 TraceCheckUtils]: 17: Hoare triple {2763#false} assume !(~y~0 % 4294967296 > 0); {2763#false} is VALID [2022-04-28 03:42:08,952 INFO L272 TraceCheckUtils]: 18: Hoare triple {2763#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2763#false} is VALID [2022-04-28 03:42:08,953 INFO L290 TraceCheckUtils]: 19: Hoare triple {2763#false} ~cond := #in~cond; {2763#false} is VALID [2022-04-28 03:42:08,953 INFO L290 TraceCheckUtils]: 20: Hoare triple {2763#false} assume 0 == ~cond; {2763#false} is VALID [2022-04-28 03:42:08,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {2763#false} assume !false; {2763#false} is VALID [2022-04-28 03:42:08,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:42:08,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:08,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395675778] [2022-04-28 03:42:08,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395675778] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:42:08,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857942991] [2022-04-28 03:42:08,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:08,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:08,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:42:08,954 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:42:08,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 03:42:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:08,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:42:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:09,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:42:09,207 INFO L272 TraceCheckUtils]: 0: Hoare triple {2762#true} call ULTIMATE.init(); {2762#true} is VALID [2022-04-28 03:42:09,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {2762#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2762#true} is VALID [2022-04-28 03:42:09,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {2762#true} assume true; {2762#true} is VALID [2022-04-28 03:42:09,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2762#true} {2762#true} #94#return; {2762#true} is VALID [2022-04-28 03:42:09,207 INFO L272 TraceCheckUtils]: 4: Hoare triple {2762#true} call #t~ret17 := main(); {2762#true} is VALID [2022-04-28 03:42:09,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {2762#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2762#true} is VALID [2022-04-28 03:42:09,208 INFO L290 TraceCheckUtils]: 6: Hoare triple {2762#true} [114] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_76 4294967296)) (.cse1 (= |v_main_#t~post6_44| |v_main_#t~post6_43|)) (.cse2 (= v_main_~x~0_76 v_main_~x~0_75)) (.cse3 (= |v_main_#t~post5_44| |v_main_#t~post5_43|))) (or (and (< v_main_~y~0_80 v_main_~y~0_79) (< 0 .cse0) (forall ((v_it_9 Int)) (or (< 0 (mod (+ v_main_~x~0_76 (* v_it_9 4294967295)) 4294967296)) (not (<= 1 v_it_9)) (not (<= (+ v_main_~y~0_80 v_it_9 1) v_main_~y~0_79)))) (= v_main_~x~0_75 (+ v_main_~x~0_76 v_main_~y~0_80 (* (- 1) v_main_~y~0_79)))) (and (= v_main_~y~0_79 v_main_~y~0_80) .cse1 .cse2 .cse3 (<= .cse0 0)) (and .cse1 .cse2 (= v_main_~y~0_80 v_main_~y~0_79) .cse3))) InVars {main_~y~0=v_main_~y~0_80, main_#t~post5=|v_main_#t~post5_44|, main_~x~0=v_main_~x~0_76, main_#t~post6=|v_main_#t~post6_44|} OutVars{main_~y~0=v_main_~y~0_79, main_#t~post5=|v_main_#t~post5_43|, main_~x~0=v_main_~x~0_75, main_#t~post6=|v_main_#t~post6_43|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2762#true} is VALID [2022-04-28 03:42:09,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {2762#true} [113] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2762#true} is VALID [2022-04-28 03:42:09,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {2762#true} ~z~0 := ~y~0; {2762#true} is VALID [2022-04-28 03:42:09,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {2762#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2771#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:09,216 INFO L290 TraceCheckUtils]: 10: Hoare triple {2771#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2771#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:09,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {2771#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:42:09,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:42:09,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:42:09,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:42:09,222 INFO L290 TraceCheckUtils]: 15: Hoare triple {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {2763#false} is VALID [2022-04-28 03:42:09,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {2763#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {2763#false} is VALID [2022-04-28 03:42:09,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {2763#false} assume !(~y~0 % 4294967296 > 0); {2763#false} is VALID [2022-04-28 03:42:09,222 INFO L272 TraceCheckUtils]: 18: Hoare triple {2763#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2763#false} is VALID [2022-04-28 03:42:09,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {2763#false} ~cond := #in~cond; {2763#false} is VALID [2022-04-28 03:42:09,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {2763#false} assume 0 == ~cond; {2763#false} is VALID [2022-04-28 03:42:09,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {2763#false} assume !false; {2763#false} is VALID [2022-04-28 03:42:09,222 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:42:09,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:42:09,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {2763#false} assume !false; {2763#false} is VALID [2022-04-28 03:42:09,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {2763#false} assume 0 == ~cond; {2763#false} is VALID [2022-04-28 03:42:09,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {2763#false} ~cond := #in~cond; {2763#false} is VALID [2022-04-28 03:42:09,311 INFO L272 TraceCheckUtils]: 18: Hoare triple {2763#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2763#false} is VALID [2022-04-28 03:42:09,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {2763#false} assume !(~y~0 % 4294967296 > 0); {2763#false} is VALID [2022-04-28 03:42:09,311 INFO L290 TraceCheckUtils]: 16: Hoare triple {2763#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {2763#false} is VALID [2022-04-28 03:42:09,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {2763#false} is VALID [2022-04-28 03:42:09,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:42:09,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:42:09,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:42:09,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {2771#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:42:09,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {2771#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2771#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:09,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {2762#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2771#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:09,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {2762#true} ~z~0 := ~y~0; {2762#true} is VALID [2022-04-28 03:42:09,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {2762#true} [113] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2762#true} is VALID [2022-04-28 03:42:09,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {2762#true} [114] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_76 4294967296)) (.cse1 (= |v_main_#t~post6_44| |v_main_#t~post6_43|)) (.cse2 (= v_main_~x~0_76 v_main_~x~0_75)) (.cse3 (= |v_main_#t~post5_44| |v_main_#t~post5_43|))) (or (and (< v_main_~y~0_80 v_main_~y~0_79) (< 0 .cse0) (forall ((v_it_9 Int)) (or (< 0 (mod (+ v_main_~x~0_76 (* v_it_9 4294967295)) 4294967296)) (not (<= 1 v_it_9)) (not (<= (+ v_main_~y~0_80 v_it_9 1) v_main_~y~0_79)))) (= v_main_~x~0_75 (+ v_main_~x~0_76 v_main_~y~0_80 (* (- 1) v_main_~y~0_79)))) (and (= v_main_~y~0_79 v_main_~y~0_80) .cse1 .cse2 .cse3 (<= .cse0 0)) (and .cse1 .cse2 (= v_main_~y~0_80 v_main_~y~0_79) .cse3))) InVars {main_~y~0=v_main_~y~0_80, main_#t~post5=|v_main_#t~post5_44|, main_~x~0=v_main_~x~0_76, main_#t~post6=|v_main_#t~post6_44|} OutVars{main_~y~0=v_main_~y~0_79, main_#t~post5=|v_main_#t~post5_43|, main_~x~0=v_main_~x~0_75, main_#t~post6=|v_main_#t~post6_43|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2762#true} is VALID [2022-04-28 03:42:09,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {2762#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2762#true} is VALID [2022-04-28 03:42:09,315 INFO L272 TraceCheckUtils]: 4: Hoare triple {2762#true} call #t~ret17 := main(); {2762#true} is VALID [2022-04-28 03:42:09,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2762#true} {2762#true} #94#return; {2762#true} is VALID [2022-04-28 03:42:09,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {2762#true} assume true; {2762#true} is VALID [2022-04-28 03:42:09,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {2762#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2762#true} is VALID [2022-04-28 03:42:09,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {2762#true} call ULTIMATE.init(); {2762#true} is VALID [2022-04-28 03:42:09,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:42:09,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857942991] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:42:09,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:42:09,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 9 [2022-04-28 03:42:09,566 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:09,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [644487236] [2022-04-28 03:42:09,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [644487236] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:09,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:09,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:42:09,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332910995] [2022-04-28 03:42:09,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:09,566 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 03:42:09,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:09,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:09,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:09,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:42:09,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:09,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:42:09,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-28 03:42:09,602 INFO L87 Difference]: Start difference. First operand 37 states and 52 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:10,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:10,042 INFO L93 Difference]: Finished difference Result 58 states and 83 transitions. [2022-04-28 03:42:10,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 03:42:10,042 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 03:42:10,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:10,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:10,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2022-04-28 03:42:10,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:10,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2022-04-28 03:42:10,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 46 transitions. [2022-04-28 03:42:11,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:11,047 INFO L225 Difference]: With dead ends: 58 [2022-04-28 03:42:11,047 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 03:42:11,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-04-28 03:42:11,047 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:11,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 33 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 63 Invalid, 0 Unknown, 8 Unchecked, 0.1s Time] [2022-04-28 03:42:11,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 03:42:11,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2022-04-28 03:42:11,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:11,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 44 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 39 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:11,179 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 44 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 39 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:11,179 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 44 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 39 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:11,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:11,180 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2022-04-28 03:42:11,180 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2022-04-28 03:42:11,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:11,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:11,180 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 39 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-28 03:42:11,180 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 39 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-28 03:42:11,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:11,181 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2022-04-28 03:42:11,181 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2022-04-28 03:42:11,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:11,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:11,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:11,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:11,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 39 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:11,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 62 transitions. [2022-04-28 03:42:11,182 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 62 transitions. Word has length 22 [2022-04-28 03:42:11,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:11,182 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 62 transitions. [2022-04-28 03:42:11,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:11,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 62 transitions. [2022-04-28 03:42:13,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 61 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:13,491 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2022-04-28 03:42:13,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 03:42:13,492 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:13,492 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:13,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 03:42:13,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:13,695 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:13,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:13,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1372943636, now seen corresponding path program 1 times [2022-04-28 03:42:13,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:13,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2009219434] [2022-04-28 03:42:14,915 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:42:15,006 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:42:15,008 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:42:15,009 INFO L85 PathProgramCache]: Analyzing trace with hash 193164405, now seen corresponding path program 1 times [2022-04-28 03:42:15,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:15,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244207884] [2022-04-28 03:42:15,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:15,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:15,017 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_10.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:15,026 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_10.4))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:15,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:15,063 INFO L290 TraceCheckUtils]: 0: Hoare triple {3229#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3221#true} is VALID [2022-04-28 03:42:15,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {3221#true} assume true; {3221#true} is VALID [2022-04-28 03:42:15,063 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3221#true} {3221#true} #94#return; {3221#true} is VALID [2022-04-28 03:42:15,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {3221#true} call ULTIMATE.init(); {3229#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:15,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {3229#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3221#true} is VALID [2022-04-28 03:42:15,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {3221#true} assume true; {3221#true} is VALID [2022-04-28 03:42:15,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3221#true} {3221#true} #94#return; {3221#true} is VALID [2022-04-28 03:42:15,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {3221#true} call #t~ret17 := main(); {3221#true} is VALID [2022-04-28 03:42:15,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {3221#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3221#true} is VALID [2022-04-28 03:42:15,064 INFO L290 TraceCheckUtils]: 6: Hoare triple {3221#true} [116] L16-2-->L16-3_primed: Formula: (let ((.cse2 (mod v_main_~x~0_85 4294967296)) (.cse0 (= |v_main_#t~post5_49| |v_main_#t~post5_48|)) (.cse1 (= v_main_~y~0_90 v_main_~y~0_89)) (.cse3 (= v_main_~x~0_85 v_main_~x~0_84)) (.cse4 (= |v_main_#t~post6_49| |v_main_#t~post6_48|))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and (< v_main_~x~0_84 v_main_~x~0_85) (< 0 .cse2) (forall ((v_it_10 Int)) (or (not (<= (+ v_main_~x~0_84 v_it_10 1) v_main_~x~0_85)) (not (<= 1 v_it_10)) (< 0 (mod (+ v_main_~x~0_85 (* 4294967295 v_it_10)) 4294967296)))) (= v_main_~y~0_89 (+ v_main_~x~0_85 v_main_~y~0_90 (* (- 1) v_main_~x~0_84)))) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_90, main_#t~post5=|v_main_#t~post5_49|, main_~x~0=v_main_~x~0_85, main_#t~post6=|v_main_#t~post6_49|} OutVars{main_~y~0=v_main_~y~0_89, main_#t~post5=|v_main_#t~post5_48|, main_~x~0=v_main_~x~0_84, main_#t~post6=|v_main_#t~post6_48|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3221#true} is VALID [2022-04-28 03:42:15,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {3221#true} [115] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3221#true} is VALID [2022-04-28 03:42:15,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {3221#true} ~z~0 := ~y~0; {3226#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:42:15,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {3226#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:42:15,066 INFO L290 TraceCheckUtils]: 10: Hoare triple {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:42:15,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3228#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-28 03:42:15,067 INFO L290 TraceCheckUtils]: 12: Hoare triple {3228#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !(~y~0 % 4294967296 > 0); {3228#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-28 03:42:15,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {3228#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:42:15,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:42:15,068 INFO L290 TraceCheckUtils]: 15: Hoare triple {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:42:15,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:42:15,069 INFO L290 TraceCheckUtils]: 17: Hoare triple {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {3222#false} is VALID [2022-04-28 03:42:15,069 INFO L272 TraceCheckUtils]: 18: Hoare triple {3222#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3222#false} is VALID [2022-04-28 03:42:15,069 INFO L290 TraceCheckUtils]: 19: Hoare triple {3222#false} ~cond := #in~cond; {3222#false} is VALID [2022-04-28 03:42:15,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {3222#false} assume 0 == ~cond; {3222#false} is VALID [2022-04-28 03:42:15,069 INFO L290 TraceCheckUtils]: 21: Hoare triple {3222#false} assume !false; {3222#false} is VALID [2022-04-28 03:42:15,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:42:15,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:15,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244207884] [2022-04-28 03:42:15,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244207884] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:42:15,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665088242] [2022-04-28 03:42:15,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:15,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:15,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:42:15,071 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:42:15,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 03:42:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:15,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:42:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:15,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:42:15,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {3221#true} call ULTIMATE.init(); {3221#true} is VALID [2022-04-28 03:42:15,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {3221#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3221#true} is VALID [2022-04-28 03:42:15,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {3221#true} assume true; {3221#true} is VALID [2022-04-28 03:42:15,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3221#true} {3221#true} #94#return; {3221#true} is VALID [2022-04-28 03:42:15,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {3221#true} call #t~ret17 := main(); {3221#true} is VALID [2022-04-28 03:42:15,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {3221#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3221#true} is VALID [2022-04-28 03:42:15,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {3221#true} [116] L16-2-->L16-3_primed: Formula: (let ((.cse2 (mod v_main_~x~0_85 4294967296)) (.cse0 (= |v_main_#t~post5_49| |v_main_#t~post5_48|)) (.cse1 (= v_main_~y~0_90 v_main_~y~0_89)) (.cse3 (= v_main_~x~0_85 v_main_~x~0_84)) (.cse4 (= |v_main_#t~post6_49| |v_main_#t~post6_48|))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and (< v_main_~x~0_84 v_main_~x~0_85) (< 0 .cse2) (forall ((v_it_10 Int)) (or (not (<= (+ v_main_~x~0_84 v_it_10 1) v_main_~x~0_85)) (not (<= 1 v_it_10)) (< 0 (mod (+ v_main_~x~0_85 (* 4294967295 v_it_10)) 4294967296)))) (= v_main_~y~0_89 (+ v_main_~x~0_85 v_main_~y~0_90 (* (- 1) v_main_~x~0_84)))) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_90, main_#t~post5=|v_main_#t~post5_49|, main_~x~0=v_main_~x~0_85, main_#t~post6=|v_main_#t~post6_49|} OutVars{main_~y~0=v_main_~y~0_89, main_#t~post5=|v_main_#t~post5_48|, main_~x~0=v_main_~x~0_84, main_#t~post6=|v_main_#t~post6_48|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3221#true} is VALID [2022-04-28 03:42:15,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {3221#true} [115] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3221#true} is VALID [2022-04-28 03:42:15,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {3221#true} ~z~0 := ~y~0; {3226#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:42:15,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {3226#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3260#(= 0 (+ main_~z~0 (* (- 1) main_~y~0) 1))} is VALID [2022-04-28 03:42:15,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {3260#(= 0 (+ main_~z~0 (* (- 1) main_~y~0) 1))} assume !(~z~0 % 4294967296 > 0); {3260#(= 0 (+ main_~z~0 (* (- 1) main_~y~0) 1))} is VALID [2022-04-28 03:42:15,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {3260#(= 0 (+ main_~z~0 (* (- 1) main_~y~0) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3267#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-28 03:42:15,321 INFO L290 TraceCheckUtils]: 12: Hoare triple {3267#(= main_~z~0 (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {3267#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-28 03:42:15,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {3267#(= main_~z~0 (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3226#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:42:15,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {3226#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !(~x~0 % 4294967296 > 0); {3226#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:42:15,323 INFO L290 TraceCheckUtils]: 15: Hoare triple {3226#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:42:15,323 INFO L290 TraceCheckUtils]: 16: Hoare triple {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:42:15,323 INFO L290 TraceCheckUtils]: 17: Hoare triple {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {3222#false} is VALID [2022-04-28 03:42:15,324 INFO L272 TraceCheckUtils]: 18: Hoare triple {3222#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3222#false} is VALID [2022-04-28 03:42:15,324 INFO L290 TraceCheckUtils]: 19: Hoare triple {3222#false} ~cond := #in~cond; {3222#false} is VALID [2022-04-28 03:42:15,324 INFO L290 TraceCheckUtils]: 20: Hoare triple {3222#false} assume 0 == ~cond; {3222#false} is VALID [2022-04-28 03:42:15,324 INFO L290 TraceCheckUtils]: 21: Hoare triple {3222#false} assume !false; {3222#false} is VALID [2022-04-28 03:42:15,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:42:15,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:42:15,572 INFO L290 TraceCheckUtils]: 21: Hoare triple {3222#false} assume !false; {3222#false} is VALID [2022-04-28 03:42:15,573 INFO L290 TraceCheckUtils]: 20: Hoare triple {3222#false} assume 0 == ~cond; {3222#false} is VALID [2022-04-28 03:42:15,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {3222#false} ~cond := #in~cond; {3222#false} is VALID [2022-04-28 03:42:15,573 INFO L272 TraceCheckUtils]: 18: Hoare triple {3222#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3222#false} is VALID [2022-04-28 03:42:15,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {3222#false} is VALID [2022-04-28 03:42:15,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:42:15,575 INFO L290 TraceCheckUtils]: 15: Hoare triple {3316#(or (<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:42:15,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {3316#(or (<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {3316#(or (<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:42:15,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {3323#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3316#(or (<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:42:15,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {3323#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294)))} assume !(~y~0 % 4294967296 > 0); {3323#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294)))} is VALID [2022-04-28 03:42:15,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {3330#(or (<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)))) (not (< 0 (mod (+ main_~z~0 1) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3323#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294)))} is VALID [2022-04-28 03:42:15,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {3330#(or (<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)))) (not (< 0 (mod (+ main_~z~0 1) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {3330#(or (<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)))) (not (< 0 (mod (+ main_~z~0 1) 4294967296))))} is VALID [2022-04-28 03:42:15,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {3316#(or (<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3330#(or (<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)))) (not (< 0 (mod (+ main_~z~0 1) 4294967296))))} is VALID [2022-04-28 03:42:15,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {3221#true} ~z~0 := ~y~0; {3316#(or (<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:42:15,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {3221#true} [115] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3221#true} is VALID [2022-04-28 03:42:15,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {3221#true} [116] L16-2-->L16-3_primed: Formula: (let ((.cse2 (mod v_main_~x~0_85 4294967296)) (.cse0 (= |v_main_#t~post5_49| |v_main_#t~post5_48|)) (.cse1 (= v_main_~y~0_90 v_main_~y~0_89)) (.cse3 (= v_main_~x~0_85 v_main_~x~0_84)) (.cse4 (= |v_main_#t~post6_49| |v_main_#t~post6_48|))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and (< v_main_~x~0_84 v_main_~x~0_85) (< 0 .cse2) (forall ((v_it_10 Int)) (or (not (<= (+ v_main_~x~0_84 v_it_10 1) v_main_~x~0_85)) (not (<= 1 v_it_10)) (< 0 (mod (+ v_main_~x~0_85 (* 4294967295 v_it_10)) 4294967296)))) (= v_main_~y~0_89 (+ v_main_~x~0_85 v_main_~y~0_90 (* (- 1) v_main_~x~0_84)))) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_90, main_#t~post5=|v_main_#t~post5_49|, main_~x~0=v_main_~x~0_85, main_#t~post6=|v_main_#t~post6_49|} OutVars{main_~y~0=v_main_~y~0_89, main_#t~post5=|v_main_#t~post5_48|, main_~x~0=v_main_~x~0_84, main_#t~post6=|v_main_#t~post6_48|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3221#true} is VALID [2022-04-28 03:42:15,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {3221#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3221#true} is VALID [2022-04-28 03:42:15,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {3221#true} call #t~ret17 := main(); {3221#true} is VALID [2022-04-28 03:42:15,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3221#true} {3221#true} #94#return; {3221#true} is VALID [2022-04-28 03:42:15,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {3221#true} assume true; {3221#true} is VALID [2022-04-28 03:42:15,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {3221#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3221#true} is VALID [2022-04-28 03:42:15,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {3221#true} call ULTIMATE.init(); {3221#true} is VALID [2022-04-28 03:42:15,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:42:15,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665088242] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:42:15,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:42:15,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-04-28 03:42:15,606 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:15,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2009219434] [2022-04-28 03:42:15,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2009219434] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:15,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:15,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:42:15,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563215296] [2022-04-28 03:42:15,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:15,606 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 03:42:15,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:15,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:15,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:15,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:42:15,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:15,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:42:15,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:42:15,624 INFO L87 Difference]: Start difference. First operand 44 states and 62 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:16,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:16,173 INFO L93 Difference]: Finished difference Result 70 states and 102 transitions. [2022-04-28 03:42:16,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 03:42:16,173 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 03:42:16,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:16,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:16,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-28 03:42:16,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:16,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-28 03:42:16,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 59 transitions. [2022-04-28 03:42:16,234 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:42:16,235 INFO L225 Difference]: With dead ends: 70 [2022-04-28 03:42:16,235 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 03:42:16,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-04-28 03:42:16,236 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 37 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:16,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 40 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:42:16,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 03:42:16,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2022-04-28 03:42:16,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:16,418 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 52 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 47 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:16,419 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 52 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 47 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:16,419 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 52 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 47 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:16,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:16,420 INFO L93 Difference]: Finished difference Result 65 states and 95 transitions. [2022-04-28 03:42:16,420 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 95 transitions. [2022-04-28 03:42:16,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:16,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:16,420 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 47 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-28 03:42:16,420 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 47 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-28 03:42:16,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:16,421 INFO L93 Difference]: Finished difference Result 65 states and 95 transitions. [2022-04-28 03:42:16,421 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 95 transitions. [2022-04-28 03:42:16,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:16,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:16,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:16,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:16,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 47 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:16,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2022-04-28 03:42:16,422 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 22 [2022-04-28 03:42:16,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:16,422 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2022-04-28 03:42:16,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:16,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 75 transitions. [2022-04-28 03:42:20,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 73 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:20,667 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2022-04-28 03:42:20,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 03:42:20,667 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:20,668 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:20,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 03:42:20,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 03:42:20,873 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:20,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:20,874 INFO L85 PathProgramCache]: Analyzing trace with hash 547263768, now seen corresponding path program 2 times [2022-04-28 03:42:20,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:20,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [499119693] [2022-04-28 03:42:21,100 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:42:21,101 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:42:21,103 INFO L85 PathProgramCache]: Analyzing trace with hash 19397015, now seen corresponding path program 1 times [2022-04-28 03:42:21,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:21,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495288067] [2022-04-28 03:42:21,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:21,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:21,112 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_11.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:21,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:21,136 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_11.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:21,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:21,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {3765#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3758#true} is VALID [2022-04-28 03:42:21,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {3758#true} assume true; {3758#true} is VALID [2022-04-28 03:42:21,203 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3758#true} {3758#true} #94#return; {3758#true} is VALID [2022-04-28 03:42:21,203 INFO L272 TraceCheckUtils]: 0: Hoare triple {3758#true} call ULTIMATE.init(); {3765#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:21,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {3765#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3758#true} is VALID [2022-04-28 03:42:21,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {3758#true} assume true; {3758#true} is VALID [2022-04-28 03:42:21,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3758#true} {3758#true} #94#return; {3758#true} is VALID [2022-04-28 03:42:21,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {3758#true} call #t~ret17 := main(); {3758#true} is VALID [2022-04-28 03:42:21,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {3758#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3758#true} is VALID [2022-04-28 03:42:21,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {3758#true} [118] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_95 v_main_~x~0_94)) (.cse2 (= v_main_~y~0_101 v_main_~y~0_100)) (.cse3 (= |v_main_#t~post6_54| |v_main_#t~post6_53|)) (.cse4 (= |v_main_#t~post5_54| |v_main_#t~post5_53|)) (.cse0 (mod v_main_~x~0_95 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (= v_main_~y~0_100 (+ v_main_~x~0_95 v_main_~y~0_101 (* (- 1) v_main_~x~0_94))) (< v_main_~x~0_94 v_main_~x~0_95) (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ v_main_~x~0_94 v_it_11 1) v_main_~x~0_95)) (< 0 (mod (+ v_main_~x~0_95 (* 4294967295 v_it_11)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_101, main_#t~post5=|v_main_#t~post5_54|, main_~x~0=v_main_~x~0_95, main_#t~post6=|v_main_#t~post6_54|} OutVars{main_~y~0=v_main_~y~0_100, main_#t~post5=|v_main_#t~post5_53|, main_~x~0=v_main_~x~0_94, main_#t~post6=|v_main_#t~post6_53|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3758#true} is VALID [2022-04-28 03:42:21,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {3758#true} [117] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3763#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:21,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {3763#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3763#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:21,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {3763#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:21,205 INFO L290 TraceCheckUtils]: 10: Hoare triple {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:21,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:21,206 INFO L290 TraceCheckUtils]: 12: Hoare triple {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:21,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3763#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:21,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {3763#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3759#false} is VALID [2022-04-28 03:42:21,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {3759#false} assume !(~x~0 % 4294967296 > 0); {3759#false} is VALID [2022-04-28 03:42:21,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {3759#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3759#false} is VALID [2022-04-28 03:42:21,208 INFO L290 TraceCheckUtils]: 17: Hoare triple {3759#false} assume !(~z~0 % 4294967296 > 0); {3759#false} is VALID [2022-04-28 03:42:21,208 INFO L290 TraceCheckUtils]: 18: Hoare triple {3759#false} assume !(~y~0 % 4294967296 > 0); {3759#false} is VALID [2022-04-28 03:42:21,208 INFO L272 TraceCheckUtils]: 19: Hoare triple {3759#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3759#false} is VALID [2022-04-28 03:42:21,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {3759#false} ~cond := #in~cond; {3759#false} is VALID [2022-04-28 03:42:21,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {3759#false} assume 0 == ~cond; {3759#false} is VALID [2022-04-28 03:42:21,208 INFO L290 TraceCheckUtils]: 22: Hoare triple {3759#false} assume !false; {3759#false} is VALID [2022-04-28 03:42:21,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:42:21,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:21,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495288067] [2022-04-28 03:42:21,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495288067] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:42:21,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565459121] [2022-04-28 03:42:21,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:21,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:21,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:42:21,209 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:42:21,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 03:42:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:21,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:42:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:21,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:42:21,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {3758#true} call ULTIMATE.init(); {3758#true} is VALID [2022-04-28 03:42:21,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {3758#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3758#true} is VALID [2022-04-28 03:42:21,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {3758#true} assume true; {3758#true} is VALID [2022-04-28 03:42:21,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3758#true} {3758#true} #94#return; {3758#true} is VALID [2022-04-28 03:42:21,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {3758#true} call #t~ret17 := main(); {3758#true} is VALID [2022-04-28 03:42:21,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {3758#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3758#true} is VALID [2022-04-28 03:42:21,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {3758#true} [118] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_95 v_main_~x~0_94)) (.cse2 (= v_main_~y~0_101 v_main_~y~0_100)) (.cse3 (= |v_main_#t~post6_54| |v_main_#t~post6_53|)) (.cse4 (= |v_main_#t~post5_54| |v_main_#t~post5_53|)) (.cse0 (mod v_main_~x~0_95 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (= v_main_~y~0_100 (+ v_main_~x~0_95 v_main_~y~0_101 (* (- 1) v_main_~x~0_94))) (< v_main_~x~0_94 v_main_~x~0_95) (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ v_main_~x~0_94 v_it_11 1) v_main_~x~0_95)) (< 0 (mod (+ v_main_~x~0_95 (* 4294967295 v_it_11)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_101, main_#t~post5=|v_main_#t~post5_54|, main_~x~0=v_main_~x~0_95, main_#t~post6=|v_main_#t~post6_54|} OutVars{main_~y~0=v_main_~y~0_100, main_#t~post5=|v_main_#t~post5_53|, main_~x~0=v_main_~x~0_94, main_#t~post6=|v_main_#t~post6_53|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3758#true} is VALID [2022-04-28 03:42:21,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {3758#true} [117] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3763#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:21,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {3763#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3763#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:21,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {3763#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:21,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:21,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:21,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:21,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3763#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:21,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {3763#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3759#false} is VALID [2022-04-28 03:42:21,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {3759#false} assume !(~x~0 % 4294967296 > 0); {3759#false} is VALID [2022-04-28 03:42:21,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {3759#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3759#false} is VALID [2022-04-28 03:42:21,427 INFO L290 TraceCheckUtils]: 17: Hoare triple {3759#false} assume !(~z~0 % 4294967296 > 0); {3759#false} is VALID [2022-04-28 03:42:21,427 INFO L290 TraceCheckUtils]: 18: Hoare triple {3759#false} assume !(~y~0 % 4294967296 > 0); {3759#false} is VALID [2022-04-28 03:42:21,427 INFO L272 TraceCheckUtils]: 19: Hoare triple {3759#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3759#false} is VALID [2022-04-28 03:42:21,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {3759#false} ~cond := #in~cond; {3759#false} is VALID [2022-04-28 03:42:21,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {3759#false} assume 0 == ~cond; {3759#false} is VALID [2022-04-28 03:42:21,427 INFO L290 TraceCheckUtils]: 22: Hoare triple {3759#false} assume !false; {3759#false} is VALID [2022-04-28 03:42:21,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:42:21,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:42:21,589 INFO L290 TraceCheckUtils]: 22: Hoare triple {3759#false} assume !false; {3759#false} is VALID [2022-04-28 03:42:21,589 INFO L290 TraceCheckUtils]: 21: Hoare triple {3759#false} assume 0 == ~cond; {3759#false} is VALID [2022-04-28 03:42:21,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {3759#false} ~cond := #in~cond; {3759#false} is VALID [2022-04-28 03:42:21,590 INFO L272 TraceCheckUtils]: 19: Hoare triple {3759#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3759#false} is VALID [2022-04-28 03:42:21,590 INFO L290 TraceCheckUtils]: 18: Hoare triple {3759#false} assume !(~y~0 % 4294967296 > 0); {3759#false} is VALID [2022-04-28 03:42:21,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {3759#false} assume !(~z~0 % 4294967296 > 0); {3759#false} is VALID [2022-04-28 03:42:21,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {3759#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3759#false} is VALID [2022-04-28 03:42:21,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {3759#false} assume !(~x~0 % 4294967296 > 0); {3759#false} is VALID [2022-04-28 03:42:21,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {3763#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3759#false} is VALID [2022-04-28 03:42:21,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3763#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:21,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:21,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:21,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:21,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {3763#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:21,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {3763#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3763#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:21,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {3758#true} [117] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3763#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:21,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {3758#true} [118] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_95 v_main_~x~0_94)) (.cse2 (= v_main_~y~0_101 v_main_~y~0_100)) (.cse3 (= |v_main_#t~post6_54| |v_main_#t~post6_53|)) (.cse4 (= |v_main_#t~post5_54| |v_main_#t~post5_53|)) (.cse0 (mod v_main_~x~0_95 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (= v_main_~y~0_100 (+ v_main_~x~0_95 v_main_~y~0_101 (* (- 1) v_main_~x~0_94))) (< v_main_~x~0_94 v_main_~x~0_95) (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ v_main_~x~0_94 v_it_11 1) v_main_~x~0_95)) (< 0 (mod (+ v_main_~x~0_95 (* 4294967295 v_it_11)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_101, main_#t~post5=|v_main_#t~post5_54|, main_~x~0=v_main_~x~0_95, main_#t~post6=|v_main_#t~post6_54|} OutVars{main_~y~0=v_main_~y~0_100, main_#t~post5=|v_main_#t~post5_53|, main_~x~0=v_main_~x~0_94, main_#t~post6=|v_main_#t~post6_53|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3758#true} is VALID [2022-04-28 03:42:21,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {3758#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3758#true} is VALID [2022-04-28 03:42:21,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {3758#true} call #t~ret17 := main(); {3758#true} is VALID [2022-04-28 03:42:21,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3758#true} {3758#true} #94#return; {3758#true} is VALID [2022-04-28 03:42:21,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {3758#true} assume true; {3758#true} is VALID [2022-04-28 03:42:21,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {3758#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3758#true} is VALID [2022-04-28 03:42:21,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {3758#true} call ULTIMATE.init(); {3758#true} is VALID [2022-04-28 03:42:21,594 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:42:21,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565459121] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:42:21,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:42:21,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-28 03:42:21,644 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:21,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [499119693] [2022-04-28 03:42:21,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [499119693] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:21,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:21,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:42:21,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76469407] [2022-04-28 03:42:21,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:21,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 03:42:21,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:21,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:21,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:21,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:42:21,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:21,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:42:21,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:42:21,661 INFO L87 Difference]: Start difference. First operand 52 states and 75 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:22,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:22,173 INFO L93 Difference]: Finished difference Result 85 states and 124 transitions. [2022-04-28 03:42:22,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:42:22,173 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 03:42:22,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:22,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:22,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-04-28 03:42:22,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:22,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-04-28 03:42:22,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2022-04-28 03:42:22,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:22,236 INFO L225 Difference]: With dead ends: 85 [2022-04-28 03:42:22,236 INFO L226 Difference]: Without dead ends: 72 [2022-04-28 03:42:22,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 03:42:22,236 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 52 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:22,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 39 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:42:22,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-28 03:42:22,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 51. [2022-04-28 03:42:22,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:22,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 51 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 46 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:22,397 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 51 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 46 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:22,397 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 51 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 46 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:22,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:22,398 INFO L93 Difference]: Finished difference Result 72 states and 104 transitions. [2022-04-28 03:42:22,398 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 104 transitions. [2022-04-28 03:42:22,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:22,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:22,398 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 46 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-28 03:42:22,398 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 46 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-28 03:42:22,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:22,399 INFO L93 Difference]: Finished difference Result 72 states and 104 transitions. [2022-04-28 03:42:22,399 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 104 transitions. [2022-04-28 03:42:22,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:22,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:22,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:22,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:22,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 46 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:22,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2022-04-28 03:42:22,400 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 23 [2022-04-28 03:42:22,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:22,400 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions. [2022-04-28 03:42:22,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:22,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 71 transitions. [2022-04-28 03:42:24,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 70 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:24,691 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2022-04-28 03:42:24,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 03:42:24,692 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:24,692 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:24,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 03:42:24,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:24,892 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:24,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:24,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1894791784, now seen corresponding path program 2 times [2022-04-28 03:42:24,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:24,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1498740565] [2022-04-28 03:42:25,078 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:42:25,080 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:42:25,082 INFO L85 PathProgramCache]: Analyzing trace with hash -737107497, now seen corresponding path program 1 times [2022-04-28 03:42:25,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:25,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283922447] [2022-04-28 03:42:25,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:25,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:25,089 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_12.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:25,106 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_12.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:25,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:25,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {4338#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4326#true} is VALID [2022-04-28 03:42:25,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {4326#true} assume true; {4326#true} is VALID [2022-04-28 03:42:25,248 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4326#true} {4326#true} #94#return; {4326#true} is VALID [2022-04-28 03:42:25,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {4326#true} call ULTIMATE.init(); {4338#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:25,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {4338#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4326#true} is VALID [2022-04-28 03:42:25,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {4326#true} assume true; {4326#true} is VALID [2022-04-28 03:42:25,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4326#true} {4326#true} #94#return; {4326#true} is VALID [2022-04-28 03:42:25,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {4326#true} call #t~ret17 := main(); {4326#true} is VALID [2022-04-28 03:42:25,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {4326#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4331#(= main_~y~0 0)} is VALID [2022-04-28 03:42:25,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {4331#(= main_~y~0 0)} [120] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_110 4294967296)) (.cse1 (= v_main_~y~0_112 v_main_~y~0_111)) (.cse2 (= |v_main_#t~post6_59| |v_main_#t~post6_58|)) (.cse3 (= |v_main_#t~post5_59| |v_main_#t~post5_58|))) (or (and (< v_main_~x~0_109 v_main_~x~0_110) (= v_main_~y~0_111 (+ v_main_~x~0_110 v_main_~y~0_112 (* v_main_~x~0_109 (- 1)))) (forall ((v_it_12 Int)) (or (not (<= (+ v_main_~x~0_109 v_it_12 1) v_main_~x~0_110)) (< 0 (mod (+ v_main_~x~0_110 (* 4294967295 v_it_12)) 4294967296)) (not (<= 1 v_it_12)))) (< 0 .cse0)) (and (= v_main_~x~0_110 v_main_~x~0_109) .cse1 .cse2 .cse3) (and (<= .cse0 0) .cse1 (= v_main_~x~0_109 v_main_~x~0_110) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_112, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_110, main_#t~post6=|v_main_#t~post6_59|} OutVars{main_~y~0=v_main_~y~0_111, main_#t~post5=|v_main_#t~post5_58|, main_~x~0=v_main_~x~0_109, main_#t~post6=|v_main_#t~post6_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4332#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) 4294967295)))} is VALID [2022-04-28 03:42:25,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {4332#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) 4294967295)))} [119] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4333#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ 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:42:25,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {4333#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ 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; {4334#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (<= (+ main_~y~0 (* (div (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296)) (+ main_~z~0 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))))} is VALID [2022-04-28 03:42:25,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {4334#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (<= (+ main_~y~0 (* (div (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296)) (+ main_~z~0 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4335#(<= (+ main_~y~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:42:25,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {4335#(<= (+ main_~y~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !(~z~0 % 4294967296 > 0); {4336#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:42:25,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {4336#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4337#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:25,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {4337#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4327#false} is VALID [2022-04-28 03:42:25,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {4327#false} assume !(~y~0 % 4294967296 > 0); {4327#false} is VALID [2022-04-28 03:42:25,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {4327#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4327#false} is VALID [2022-04-28 03:42:25,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {4327#false} assume !(~x~0 % 4294967296 > 0); {4327#false} is VALID [2022-04-28 03:42:25,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {4327#false} assume !(~z~0 % 4294967296 > 0); {4327#false} is VALID [2022-04-28 03:42:25,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {4327#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {4327#false} is VALID [2022-04-28 03:42:25,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {4327#false} assume !(~y~0 % 4294967296 > 0); {4327#false} is VALID [2022-04-28 03:42:25,264 INFO L272 TraceCheckUtils]: 19: Hoare triple {4327#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4327#false} is VALID [2022-04-28 03:42:25,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {4327#false} ~cond := #in~cond; {4327#false} is VALID [2022-04-28 03:42:25,264 INFO L290 TraceCheckUtils]: 21: Hoare triple {4327#false} assume 0 == ~cond; {4327#false} is VALID [2022-04-28 03:42:25,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {4327#false} assume !false; {4327#false} is VALID [2022-04-28 03:42:25,265 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:42:25,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:25,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283922447] [2022-04-28 03:42:25,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283922447] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:42:25,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407850330] [2022-04-28 03:42:25,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:25,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:25,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:42:25,266 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:42:25,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 03:42:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:25,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:42:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:25,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:42:25,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {4326#true} call ULTIMATE.init(); {4326#true} is VALID [2022-04-28 03:42:25,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {4326#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4326#true} is VALID [2022-04-28 03:42:25,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {4326#true} assume true; {4326#true} is VALID [2022-04-28 03:42:25,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4326#true} {4326#true} #94#return; {4326#true} is VALID [2022-04-28 03:42:25,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {4326#true} call #t~ret17 := main(); {4326#true} is VALID [2022-04-28 03:42:25,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {4326#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4326#true} is VALID [2022-04-28 03:42:25,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {4326#true} [120] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_110 4294967296)) (.cse1 (= v_main_~y~0_112 v_main_~y~0_111)) (.cse2 (= |v_main_#t~post6_59| |v_main_#t~post6_58|)) (.cse3 (= |v_main_#t~post5_59| |v_main_#t~post5_58|))) (or (and (< v_main_~x~0_109 v_main_~x~0_110) (= v_main_~y~0_111 (+ v_main_~x~0_110 v_main_~y~0_112 (* v_main_~x~0_109 (- 1)))) (forall ((v_it_12 Int)) (or (not (<= (+ v_main_~x~0_109 v_it_12 1) v_main_~x~0_110)) (< 0 (mod (+ v_main_~x~0_110 (* 4294967295 v_it_12)) 4294967296)) (not (<= 1 v_it_12)))) (< 0 .cse0)) (and (= v_main_~x~0_110 v_main_~x~0_109) .cse1 .cse2 .cse3) (and (<= .cse0 0) .cse1 (= v_main_~x~0_109 v_main_~x~0_110) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_112, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_110, main_#t~post6=|v_main_#t~post6_59|} OutVars{main_~y~0=v_main_~y~0_111, main_#t~post5=|v_main_#t~post5_58|, main_~x~0=v_main_~x~0_109, main_#t~post6=|v_main_#t~post6_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4326#true} is VALID [2022-04-28 03:42:25,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {4326#true} [119] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4326#true} is VALID [2022-04-28 03:42:25,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {4326#true} ~z~0 := ~y~0; {4366#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:42:25,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {4366#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4370#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:42:25,524 INFO L290 TraceCheckUtils]: 10: Hoare triple {4370#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {4336#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:42:25,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {4336#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4337#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:25,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {4337#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4380#(<= (+ main_~y~0 1) (* (div (+ main_~y~0 1) 4294967296) 4294967296))} is VALID [2022-04-28 03:42:25,526 INFO L290 TraceCheckUtils]: 13: Hoare triple {4380#(<= (+ main_~y~0 1) (* (div (+ main_~y~0 1) 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {4380#(<= (+ main_~y~0 1) (* (div (+ main_~y~0 1) 4294967296) 4294967296))} is VALID [2022-04-28 03:42:25,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {4380#(<= (+ main_~y~0 1) (* (div (+ main_~y~0 1) 4294967296) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4337#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:25,527 INFO L290 TraceCheckUtils]: 15: Hoare triple {4337#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {4337#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:25,527 INFO L290 TraceCheckUtils]: 16: Hoare triple {4337#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4337#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:25,528 INFO L290 TraceCheckUtils]: 17: Hoare triple {4337#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {4327#false} is VALID [2022-04-28 03:42:25,528 INFO L290 TraceCheckUtils]: 18: Hoare triple {4327#false} assume !(~y~0 % 4294967296 > 0); {4327#false} is VALID [2022-04-28 03:42:25,528 INFO L272 TraceCheckUtils]: 19: Hoare triple {4327#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4327#false} is VALID [2022-04-28 03:42:25,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {4327#false} ~cond := #in~cond; {4327#false} is VALID [2022-04-28 03:42:25,528 INFO L290 TraceCheckUtils]: 21: Hoare triple {4327#false} assume 0 == ~cond; {4327#false} is VALID [2022-04-28 03:42:25,528 INFO L290 TraceCheckUtils]: 22: Hoare triple {4327#false} assume !false; {4327#false} is VALID [2022-04-28 03:42:25,528 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:42:25,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:42:25,818 INFO L290 TraceCheckUtils]: 22: Hoare triple {4327#false} assume !false; {4327#false} is VALID [2022-04-28 03:42:25,818 INFO L290 TraceCheckUtils]: 21: Hoare triple {4327#false} assume 0 == ~cond; {4327#false} is VALID [2022-04-28 03:42:25,818 INFO L290 TraceCheckUtils]: 20: Hoare triple {4327#false} ~cond := #in~cond; {4327#false} is VALID [2022-04-28 03:42:25,818 INFO L272 TraceCheckUtils]: 19: Hoare triple {4327#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4327#false} is VALID [2022-04-28 03:42:25,818 INFO L290 TraceCheckUtils]: 18: Hoare triple {4327#false} assume !(~y~0 % 4294967296 > 0); {4327#false} is VALID [2022-04-28 03:42:25,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {4337#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {4327#false} is VALID [2022-04-28 03:42:25,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {4337#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4337#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:25,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {4337#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {4337#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:25,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {4380#(<= (+ main_~y~0 1) (* (div (+ main_~y~0 1) 4294967296) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4337#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:25,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {4380#(<= (+ main_~y~0 1) (* (div (+ main_~y~0 1) 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {4380#(<= (+ main_~y~0 1) (* (div (+ main_~y~0 1) 4294967296) 4294967296))} is VALID [2022-04-28 03:42:25,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {4337#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4380#(<= (+ main_~y~0 1) (* (div (+ main_~y~0 1) 4294967296) 4294967296))} is VALID [2022-04-28 03:42:25,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {4336#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4337#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:25,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {4447#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4336#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:42:25,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {4451#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4447#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:42:25,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {4326#true} ~z~0 := ~y~0; {4451#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:42:25,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {4326#true} [119] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4326#true} is VALID [2022-04-28 03:42:25,824 INFO L290 TraceCheckUtils]: 6: Hoare triple {4326#true} [120] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_110 4294967296)) (.cse1 (= v_main_~y~0_112 v_main_~y~0_111)) (.cse2 (= |v_main_#t~post6_59| |v_main_#t~post6_58|)) (.cse3 (= |v_main_#t~post5_59| |v_main_#t~post5_58|))) (or (and (< v_main_~x~0_109 v_main_~x~0_110) (= v_main_~y~0_111 (+ v_main_~x~0_110 v_main_~y~0_112 (* v_main_~x~0_109 (- 1)))) (forall ((v_it_12 Int)) (or (not (<= (+ v_main_~x~0_109 v_it_12 1) v_main_~x~0_110)) (< 0 (mod (+ v_main_~x~0_110 (* 4294967295 v_it_12)) 4294967296)) (not (<= 1 v_it_12)))) (< 0 .cse0)) (and (= v_main_~x~0_110 v_main_~x~0_109) .cse1 .cse2 .cse3) (and (<= .cse0 0) .cse1 (= v_main_~x~0_109 v_main_~x~0_110) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_112, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_110, main_#t~post6=|v_main_#t~post6_59|} OutVars{main_~y~0=v_main_~y~0_111, main_#t~post5=|v_main_#t~post5_58|, main_~x~0=v_main_~x~0_109, main_#t~post6=|v_main_#t~post6_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4326#true} is VALID [2022-04-28 03:42:25,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {4326#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4326#true} is VALID [2022-04-28 03:42:25,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {4326#true} call #t~ret17 := main(); {4326#true} is VALID [2022-04-28 03:42:25,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4326#true} {4326#true} #94#return; {4326#true} is VALID [2022-04-28 03:42:25,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {4326#true} assume true; {4326#true} is VALID [2022-04-28 03:42:25,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {4326#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4326#true} is VALID [2022-04-28 03:42:25,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {4326#true} call ULTIMATE.init(); {4326#true} is VALID [2022-04-28 03:42:25,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:42:25,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407850330] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:42:25,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:42:25,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 15 [2022-04-28 03:42:26,182 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:26,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1498740565] [2022-04-28 03:42:26,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1498740565] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:26,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:26,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:42:26,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079604116] [2022-04-28 03:42:26,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:26,182 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 03:42:26,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:26,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:26,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:26,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:42:26,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:26,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:42:26,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-04-28 03:42:26,248 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:40,612 WARN L232 SmtUtils]: Spent 5.93s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 03:42:41,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:41,190 INFO L93 Difference]: Finished difference Result 89 states and 129 transitions. [2022-04-28 03:42:41,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 03:42:41,190 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 03:42:41,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:41,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:41,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-28 03:42:41,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:41,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-28 03:42:41,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 70 transitions. [2022-04-28 03:42:41,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:41,612 INFO L225 Difference]: With dead ends: 89 [2022-04-28 03:42:41,613 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 03:42:41,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2022-04-28 03:42:41,613 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 54 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:41,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 55 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 115 Invalid, 0 Unknown, 75 Unchecked, 0.2s Time] [2022-04-28 03:42:41,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 03:42:41,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2022-04-28 03:42:41,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:41,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 56 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 51 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:41,812 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 56 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 51 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:41,812 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 56 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 51 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:41,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:41,813 INFO L93 Difference]: Finished difference Result 67 states and 93 transitions. [2022-04-28 03:42:41,813 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2022-04-28 03:42:41,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:41,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:41,814 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 51 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-28 03:42:41,814 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 51 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-28 03:42:41,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:41,815 INFO L93 Difference]: Finished difference Result 67 states and 93 transitions. [2022-04-28 03:42:41,815 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2022-04-28 03:42:41,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:41,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:41,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:41,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:41,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 51 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:41,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2022-04-28 03:42:41,816 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 23 [2022-04-28 03:42:41,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:41,816 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2022-04-28 03:42:41,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:41,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 77 transitions. [2022-04-28 03:42:46,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 75 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:46,701 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2022-04-28 03:42:46,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 03:42:46,701 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:46,701 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:46,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 03:42:46,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:46,903 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:46,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:46,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1015896408, now seen corresponding path program 1 times [2022-04-28 03:42:46,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:46,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [499571189] [2022-04-28 03:42:49,084 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:42:49,155 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:42:49,156 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:42:49,158 INFO L85 PathProgramCache]: Analyzing trace with hash -435835561, now seen corresponding path program 1 times [2022-04-28 03:42:49,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:49,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560961819] [2022-04-28 03:42:49,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:49,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:49,166 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_13.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:49,188 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_13.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:49,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:49,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:49,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {4937#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4928#true} is VALID [2022-04-28 03:42:49,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {4928#true} assume true; {4928#true} is VALID [2022-04-28 03:42:49,237 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4928#true} {4928#true} #94#return; {4928#true} is VALID [2022-04-28 03:42:49,238 INFO L272 TraceCheckUtils]: 0: Hoare triple {4928#true} call ULTIMATE.init(); {4937#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:49,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {4937#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4928#true} is VALID [2022-04-28 03:42:49,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {4928#true} assume true; {4928#true} is VALID [2022-04-28 03:42:49,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4928#true} {4928#true} #94#return; {4928#true} is VALID [2022-04-28 03:42:49,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {4928#true} call #t~ret17 := main(); {4928#true} is VALID [2022-04-28 03:42:49,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {4928#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4928#true} is VALID [2022-04-28 03:42:49,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {4928#true} [122] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_119 4294967296)) (.cse0 (= |v_main_#t~post5_64| |v_main_#t~post5_63|)) (.cse2 (= |v_main_#t~post6_64| |v_main_#t~post6_63|)) (.cse3 (= v_main_~y~0_127 v_main_~y~0_126)) (.cse4 (= v_main_~x~0_119 v_main_~x~0_118))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and (< 0 .cse1) (= v_main_~y~0_126 (+ v_main_~x~0_119 (* v_main_~x~0_118 (- 1)) v_main_~y~0_127)) (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_main_~x~0_118 v_it_13 1) v_main_~x~0_119)) (< 0 (mod (+ v_main_~x~0_119 (* 4294967295 v_it_13)) 4294967296)))) (< v_main_~x~0_118 v_main_~x~0_119)) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_127, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_119, main_#t~post6=|v_main_#t~post6_64|} OutVars{main_~y~0=v_main_~y~0_126, main_#t~post5=|v_main_#t~post5_63|, main_~x~0=v_main_~x~0_118, main_#t~post6=|v_main_#t~post6_63|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4928#true} is VALID [2022-04-28 03:42:49,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {4928#true} [121] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4928#true} is VALID [2022-04-28 03:42:49,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {4928#true} ~z~0 := ~y~0; {4933#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:42:49,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {4933#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4934#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:42:49,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {4934#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:42:49,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {4935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:42:49,241 INFO L290 TraceCheckUtils]: 12: Hoare triple {4935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:42:49,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {4935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4936#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:42:49,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {4936#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4929#false} is VALID [2022-04-28 03:42:49,243 INFO L290 TraceCheckUtils]: 15: Hoare triple {4929#false} assume !(~x~0 % 4294967296 > 0); {4929#false} is VALID [2022-04-28 03:42:49,243 INFO L290 TraceCheckUtils]: 16: Hoare triple {4929#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4929#false} is VALID [2022-04-28 03:42:49,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {4929#false} assume !(~z~0 % 4294967296 > 0); {4929#false} is VALID [2022-04-28 03:42:49,243 INFO L290 TraceCheckUtils]: 18: Hoare triple {4929#false} assume !(~y~0 % 4294967296 > 0); {4929#false} is VALID [2022-04-28 03:42:49,243 INFO L272 TraceCheckUtils]: 19: Hoare triple {4929#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4929#false} is VALID [2022-04-28 03:42:49,243 INFO L290 TraceCheckUtils]: 20: Hoare triple {4929#false} ~cond := #in~cond; {4929#false} is VALID [2022-04-28 03:42:49,243 INFO L290 TraceCheckUtils]: 21: Hoare triple {4929#false} assume 0 == ~cond; {4929#false} is VALID [2022-04-28 03:42:49,243 INFO L290 TraceCheckUtils]: 22: Hoare triple {4929#false} assume !false; {4929#false} is VALID [2022-04-28 03:42:49,243 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:42:49,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:49,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560961819] [2022-04-28 03:42:49,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560961819] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:42:49,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267851427] [2022-04-28 03:42:49,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:49,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:49,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:42:49,245 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:42:49,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 03:42:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:49,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:42:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:49,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:42:49,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {4928#true} call ULTIMATE.init(); {4928#true} is VALID [2022-04-28 03:42:49,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {4928#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4928#true} is VALID [2022-04-28 03:42:49,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {4928#true} assume true; {4928#true} is VALID [2022-04-28 03:42:49,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4928#true} {4928#true} #94#return; {4928#true} is VALID [2022-04-28 03:42:49,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {4928#true} call #t~ret17 := main(); {4928#true} is VALID [2022-04-28 03:42:49,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {4928#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4928#true} is VALID [2022-04-28 03:42:49,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {4928#true} [122] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_119 4294967296)) (.cse0 (= |v_main_#t~post5_64| |v_main_#t~post5_63|)) (.cse2 (= |v_main_#t~post6_64| |v_main_#t~post6_63|)) (.cse3 (= v_main_~y~0_127 v_main_~y~0_126)) (.cse4 (= v_main_~x~0_119 v_main_~x~0_118))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and (< 0 .cse1) (= v_main_~y~0_126 (+ v_main_~x~0_119 (* v_main_~x~0_118 (- 1)) v_main_~y~0_127)) (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_main_~x~0_118 v_it_13 1) v_main_~x~0_119)) (< 0 (mod (+ v_main_~x~0_119 (* 4294967295 v_it_13)) 4294967296)))) (< v_main_~x~0_118 v_main_~x~0_119)) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_127, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_119, main_#t~post6=|v_main_#t~post6_64|} OutVars{main_~y~0=v_main_~y~0_126, main_#t~post5=|v_main_#t~post5_63|, main_~x~0=v_main_~x~0_118, main_#t~post6=|v_main_#t~post6_63|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4928#true} is VALID [2022-04-28 03:42:49,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {4928#true} [121] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4928#true} is VALID [2022-04-28 03:42:49,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {4928#true} ~z~0 := ~y~0; {4933#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:42:49,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {4933#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4934#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:42:49,597 INFO L290 TraceCheckUtils]: 10: Hoare triple {4934#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:42:49,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {4935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:42:49,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {4935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:42:49,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {4935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4936#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:42:49,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {4936#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4929#false} is VALID [2022-04-28 03:42:49,599 INFO L290 TraceCheckUtils]: 15: Hoare triple {4929#false} assume !(~x~0 % 4294967296 > 0); {4929#false} is VALID [2022-04-28 03:42:49,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {4929#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4929#false} is VALID [2022-04-28 03:42:49,599 INFO L290 TraceCheckUtils]: 17: Hoare triple {4929#false} assume !(~z~0 % 4294967296 > 0); {4929#false} is VALID [2022-04-28 03:42:49,599 INFO L290 TraceCheckUtils]: 18: Hoare triple {4929#false} assume !(~y~0 % 4294967296 > 0); {4929#false} is VALID [2022-04-28 03:42:49,599 INFO L272 TraceCheckUtils]: 19: Hoare triple {4929#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4929#false} is VALID [2022-04-28 03:42:49,599 INFO L290 TraceCheckUtils]: 20: Hoare triple {4929#false} ~cond := #in~cond; {4929#false} is VALID [2022-04-28 03:42:49,599 INFO L290 TraceCheckUtils]: 21: Hoare triple {4929#false} assume 0 == ~cond; {4929#false} is VALID [2022-04-28 03:42:49,599 INFO L290 TraceCheckUtils]: 22: Hoare triple {4929#false} assume !false; {4929#false} is VALID [2022-04-28 03:42:49,599 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:42:49,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:42:49,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {4929#false} assume !false; {4929#false} is VALID [2022-04-28 03:42:49,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {4929#false} assume 0 == ~cond; {4929#false} is VALID [2022-04-28 03:42:49,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {4929#false} ~cond := #in~cond; {4929#false} is VALID [2022-04-28 03:42:49,815 INFO L272 TraceCheckUtils]: 19: Hoare triple {4929#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4929#false} is VALID [2022-04-28 03:42:49,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {4929#false} assume !(~y~0 % 4294967296 > 0); {4929#false} is VALID [2022-04-28 03:42:49,815 INFO L290 TraceCheckUtils]: 17: Hoare triple {4929#false} assume !(~z~0 % 4294967296 > 0); {4929#false} is VALID [2022-04-28 03:42:49,815 INFO L290 TraceCheckUtils]: 16: Hoare triple {4929#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4929#false} is VALID [2022-04-28 03:42:49,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {4929#false} assume !(~x~0 % 4294967296 > 0); {4929#false} is VALID [2022-04-28 03:42:49,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {4936#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4929#false} is VALID [2022-04-28 03:42:49,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {4935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4936#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:42:49,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {4935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:42:49,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {4935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:42:49,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {5043#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:42:49,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {5047#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5043#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:42:49,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {4928#true} ~z~0 := ~y~0; {5047#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:49,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {4928#true} [121] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4928#true} is VALID [2022-04-28 03:42:49,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {4928#true} [122] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_119 4294967296)) (.cse0 (= |v_main_#t~post5_64| |v_main_#t~post5_63|)) (.cse2 (= |v_main_#t~post6_64| |v_main_#t~post6_63|)) (.cse3 (= v_main_~y~0_127 v_main_~y~0_126)) (.cse4 (= v_main_~x~0_119 v_main_~x~0_118))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and (< 0 .cse1) (= v_main_~y~0_126 (+ v_main_~x~0_119 (* v_main_~x~0_118 (- 1)) v_main_~y~0_127)) (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_main_~x~0_118 v_it_13 1) v_main_~x~0_119)) (< 0 (mod (+ v_main_~x~0_119 (* 4294967295 v_it_13)) 4294967296)))) (< v_main_~x~0_118 v_main_~x~0_119)) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_127, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_119, main_#t~post6=|v_main_#t~post6_64|} OutVars{main_~y~0=v_main_~y~0_126, main_#t~post5=|v_main_#t~post5_63|, main_~x~0=v_main_~x~0_118, main_#t~post6=|v_main_#t~post6_63|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4928#true} is VALID [2022-04-28 03:42:49,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {4928#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4928#true} is VALID [2022-04-28 03:42:49,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {4928#true} call #t~ret17 := main(); {4928#true} is VALID [2022-04-28 03:42:49,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4928#true} {4928#true} #94#return; {4928#true} is VALID [2022-04-28 03:42:49,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {4928#true} assume true; {4928#true} is VALID [2022-04-28 03:42:49,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {4928#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4928#true} is VALID [2022-04-28 03:42:49,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {4928#true} call ULTIMATE.init(); {4928#true} is VALID [2022-04-28 03:42:49,832 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:42:49,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267851427] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:42:49,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:42:49,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-28 03:42:49,886 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:49,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [499571189] [2022-04-28 03:42:49,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [499571189] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:49,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:49,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:42:49,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832344798] [2022-04-28 03:42:49,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:49,887 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 03:42:49,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:49,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:49,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:49,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:42:49,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:49,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:42:49,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:42:49,907 INFO L87 Difference]: Start difference. First operand 56 states and 77 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:50,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:50,582 INFO L93 Difference]: Finished difference Result 77 states and 105 transitions. [2022-04-28 03:42:50,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 03:42:50,582 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 03:42:50,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:50,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:50,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-28 03:42:50,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:50,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-28 03:42:50,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2022-04-28 03:42:50,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:50,629 INFO L225 Difference]: With dead ends: 77 [2022-04-28 03:42:50,629 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 03:42:50,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-04-28 03:42:50,629 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 32 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:50,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 49 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:42:50,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 03:42:50,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2022-04-28 03:42:50,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:50,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 44 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:50,817 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 44 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:50,817 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 44 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:50,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:50,818 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-28 03:42:50,818 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2022-04-28 03:42:50,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:50,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:50,818 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-28 03:42:50,818 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-28 03:42:50,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:50,819 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-28 03:42:50,819 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2022-04-28 03:42:50,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:50,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:50,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:50,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:50,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:50,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2022-04-28 03:42:50,820 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 57 transitions. Word has length 23 [2022-04-28 03:42:50,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:50,820 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 57 transitions. [2022-04-28 03:42:50,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:50,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 57 transitions. [2022-04-28 03:42:55,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 55 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:55,213 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2022-04-28 03:42:55,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 03:42:55,213 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:55,214 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:55,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 03:42:55,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-28 03:42:55,421 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:55,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:55,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1809241787, now seen corresponding path program 1 times [2022-04-28 03:42:55,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:55,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [563864766] [2022-04-28 03:42:59,518 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:42:59,589 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:42:59,590 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:42:59,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1144182118, now seen corresponding path program 1 times [2022-04-28 03:42:59,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:59,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099927858] [2022-04-28 03:42:59,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:59,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:59,601 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_14.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:59,615 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_14.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:59,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:59,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {5453#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5442#true} is VALID [2022-04-28 03:42:59,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {5442#true} assume true; {5442#true} is VALID [2022-04-28 03:42:59,737 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5442#true} {5442#true} #94#return; {5442#true} is VALID [2022-04-28 03:42:59,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {5442#true} call ULTIMATE.init(); {5453#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:59,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {5453#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5442#true} is VALID [2022-04-28 03:42:59,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {5442#true} assume true; {5442#true} is VALID [2022-04-28 03:42:59,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5442#true} {5442#true} #94#return; {5442#true} is VALID [2022-04-28 03:42:59,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {5442#true} call #t~ret17 := main(); {5442#true} is VALID [2022-04-28 03:42:59,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {5442#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5447#(= main_~y~0 0)} is VALID [2022-04-28 03:42:59,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {5447#(= main_~y~0 0)} [124] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_69| |v_main_#t~post5_68|)) (.cse0 (mod v_main_~x~0_130 4294967296)) (.cse2 (= v_main_~y~0_136 v_main_~y~0_135)) (.cse3 (= |v_main_#t~post6_69| |v_main_#t~post6_68|))) (or (and (forall ((v_it_14 Int)) (or (not (<= (+ v_main_~x~0_129 v_it_14 1) v_main_~x~0_130)) (< 0 (mod (+ v_main_~x~0_130 (* 4294967295 v_it_14)) 4294967296)) (not (<= 1 v_it_14)))) (= v_main_~y~0_135 (+ v_main_~x~0_130 v_main_~y~0_136 (* v_main_~x~0_129 (- 1)))) (< 0 .cse0) (< v_main_~x~0_129 v_main_~x~0_130)) (and .cse1 (= v_main_~x~0_130 v_main_~x~0_129) .cse2 .cse3) (and (= v_main_~x~0_129 v_main_~x~0_130) .cse1 (<= .cse0 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_136, main_#t~post5=|v_main_#t~post5_69|, main_~x~0=v_main_~x~0_130, main_#t~post6=|v_main_#t~post6_69|} OutVars{main_~y~0=v_main_~y~0_135, main_#t~post5=|v_main_#t~post5_68|, main_~x~0=v_main_~x~0_129, main_#t~post6=|v_main_#t~post6_68|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5448#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ (* (div (+ main_~y~0 main_~x~0) 4294967296) 4294967296) 1) (+ main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:42:59,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {5448#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ (* (div (+ main_~y~0 main_~x~0) 4294967296) 4294967296) 1) (+ main_~y~0 main_~x~0)))} [123] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5449#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ (* (div (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 1) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-28 03:42:59,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {5449#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ (* (div (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 1) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))))} ~z~0 := ~y~0; {5450#(or (<= (+ (* (div (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 1) (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)))) (and (<= main_~z~0 0) (<= 0 main_~z~0)))} is VALID [2022-04-28 03:42:59,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {5450#(or (<= (+ (* (div (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 1) (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)))) (and (<= main_~z~0 0) (<= 0 main_~z~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5442#true} is VALID [2022-04-28 03:42:59,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {5442#true} assume !(~z~0 % 4294967296 > 0); {5451#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0)} is VALID [2022-04-28 03:42:59,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {5451#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5452#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:42:59,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {5452#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {5452#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:42:59,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {5452#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5452#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:42:59,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {5452#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {5452#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:42:59,755 INFO L290 TraceCheckUtils]: 15: Hoare triple {5452#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5451#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0)} is VALID [2022-04-28 03:42:59,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {5451#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5443#false} is VALID [2022-04-28 03:42:59,755 INFO L290 TraceCheckUtils]: 17: Hoare triple {5443#false} assume !(~z~0 % 4294967296 > 0); {5443#false} is VALID [2022-04-28 03:42:59,755 INFO L290 TraceCheckUtils]: 18: Hoare triple {5443#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {5443#false} is VALID [2022-04-28 03:42:59,755 INFO L290 TraceCheckUtils]: 19: Hoare triple {5443#false} assume !(~y~0 % 4294967296 > 0); {5443#false} is VALID [2022-04-28 03:42:59,755 INFO L272 TraceCheckUtils]: 20: Hoare triple {5443#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5443#false} is VALID [2022-04-28 03:42:59,756 INFO L290 TraceCheckUtils]: 21: Hoare triple {5443#false} ~cond := #in~cond; {5443#false} is VALID [2022-04-28 03:42:59,756 INFO L290 TraceCheckUtils]: 22: Hoare triple {5443#false} assume 0 == ~cond; {5443#false} is VALID [2022-04-28 03:42:59,756 INFO L290 TraceCheckUtils]: 23: Hoare triple {5443#false} assume !false; {5443#false} is VALID [2022-04-28 03:42:59,756 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:42:59,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:59,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099927858] [2022-04-28 03:42:59,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099927858] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:42:59,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138208089] [2022-04-28 03:42:59,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:59,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:59,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:42:59,758 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:42:59,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 03:42:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:59,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 03:42:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:59,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:42:59,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {5442#true} call ULTIMATE.init(); {5442#true} is VALID [2022-04-28 03:42:59,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {5442#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5442#true} is VALID [2022-04-28 03:42:59,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {5442#true} assume true; {5442#true} is VALID [2022-04-28 03:42:59,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5442#true} {5442#true} #94#return; {5442#true} is VALID [2022-04-28 03:42:59,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {5442#true} call #t~ret17 := main(); {5442#true} is VALID [2022-04-28 03:42:59,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {5442#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5442#true} is VALID [2022-04-28 03:42:59,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {5442#true} [124] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_69| |v_main_#t~post5_68|)) (.cse0 (mod v_main_~x~0_130 4294967296)) (.cse2 (= v_main_~y~0_136 v_main_~y~0_135)) (.cse3 (= |v_main_#t~post6_69| |v_main_#t~post6_68|))) (or (and (forall ((v_it_14 Int)) (or (not (<= (+ v_main_~x~0_129 v_it_14 1) v_main_~x~0_130)) (< 0 (mod (+ v_main_~x~0_130 (* 4294967295 v_it_14)) 4294967296)) (not (<= 1 v_it_14)))) (= v_main_~y~0_135 (+ v_main_~x~0_130 v_main_~y~0_136 (* v_main_~x~0_129 (- 1)))) (< 0 .cse0) (< v_main_~x~0_129 v_main_~x~0_130)) (and .cse1 (= v_main_~x~0_130 v_main_~x~0_129) .cse2 .cse3) (and (= v_main_~x~0_129 v_main_~x~0_130) .cse1 (<= .cse0 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_136, main_#t~post5=|v_main_#t~post5_69|, main_~x~0=v_main_~x~0_130, main_#t~post6=|v_main_#t~post6_69|} OutVars{main_~y~0=v_main_~y~0_135, main_#t~post5=|v_main_#t~post5_68|, main_~x~0=v_main_~x~0_129, main_#t~post6=|v_main_#t~post6_68|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5442#true} is VALID [2022-04-28 03:42:59,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {5442#true} [123] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5442#true} is VALID [2022-04-28 03:42:59,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {5442#true} ~z~0 := ~y~0; {5481#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:42:59,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {5481#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5485#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:42:59,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {5485#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {5485#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:42:59,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {5485#(= main_~y~0 (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5492#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-28 03:42:59,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {5492#(= main_~z~0 (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {5492#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-28 03:42:59,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {5492#(= main_~z~0 (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5481#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:42:59,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {5481#(= main_~z~0 main_~y~0)} assume !(~x~0 % 4294967296 > 0); {5481#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:42:59,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {5481#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5485#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:42:59,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {5485#(= main_~y~0 (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5508#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:42:59,927 INFO L290 TraceCheckUtils]: 17: Hoare triple {5508#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {5508#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:42:59,928 INFO L290 TraceCheckUtils]: 18: Hoare triple {5508#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {5515#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:42:59,928 INFO L290 TraceCheckUtils]: 19: Hoare triple {5515#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5443#false} is VALID [2022-04-28 03:42:59,928 INFO L272 TraceCheckUtils]: 20: Hoare triple {5443#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5443#false} is VALID [2022-04-28 03:42:59,928 INFO L290 TraceCheckUtils]: 21: Hoare triple {5443#false} ~cond := #in~cond; {5443#false} is VALID [2022-04-28 03:42:59,928 INFO L290 TraceCheckUtils]: 22: Hoare triple {5443#false} assume 0 == ~cond; {5443#false} is VALID [2022-04-28 03:42:59,928 INFO L290 TraceCheckUtils]: 23: Hoare triple {5443#false} assume !false; {5443#false} is VALID [2022-04-28 03:42:59,928 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:42:59,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:43:00,077 INFO L290 TraceCheckUtils]: 23: Hoare triple {5443#false} assume !false; {5443#false} is VALID [2022-04-28 03:43:00,077 INFO L290 TraceCheckUtils]: 22: Hoare triple {5443#false} assume 0 == ~cond; {5443#false} is VALID [2022-04-28 03:43:00,077 INFO L290 TraceCheckUtils]: 21: Hoare triple {5443#false} ~cond := #in~cond; {5443#false} is VALID [2022-04-28 03:43:00,077 INFO L272 TraceCheckUtils]: 20: Hoare triple {5443#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5443#false} is VALID [2022-04-28 03:43:00,077 INFO L290 TraceCheckUtils]: 19: Hoare triple {5515#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5443#false} is VALID [2022-04-28 03:43:00,079 INFO L290 TraceCheckUtils]: 18: Hoare triple {5508#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {5515#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:00,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {5508#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {5508#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:43:00,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {5552#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5508#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:43:00,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {5556#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5552#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:43:00,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {5556#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {5556#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:43:00,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {5563#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5556#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:43:00,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {5563#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {5563#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:00,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {5552#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5563#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:00,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {5552#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !(~z~0 % 4294967296 > 0); {5552#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:43:00,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {5556#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5552#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:43:00,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {5442#true} ~z~0 := ~y~0; {5556#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:43:00,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {5442#true} [123] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5442#true} is VALID [2022-04-28 03:43:00,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {5442#true} [124] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_69| |v_main_#t~post5_68|)) (.cse0 (mod v_main_~x~0_130 4294967296)) (.cse2 (= v_main_~y~0_136 v_main_~y~0_135)) (.cse3 (= |v_main_#t~post6_69| |v_main_#t~post6_68|))) (or (and (forall ((v_it_14 Int)) (or (not (<= (+ v_main_~x~0_129 v_it_14 1) v_main_~x~0_130)) (< 0 (mod (+ v_main_~x~0_130 (* 4294967295 v_it_14)) 4294967296)) (not (<= 1 v_it_14)))) (= v_main_~y~0_135 (+ v_main_~x~0_130 v_main_~y~0_136 (* v_main_~x~0_129 (- 1)))) (< 0 .cse0) (< v_main_~x~0_129 v_main_~x~0_130)) (and .cse1 (= v_main_~x~0_130 v_main_~x~0_129) .cse2 .cse3) (and (= v_main_~x~0_129 v_main_~x~0_130) .cse1 (<= .cse0 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_136, main_#t~post5=|v_main_#t~post5_69|, main_~x~0=v_main_~x~0_130, main_#t~post6=|v_main_#t~post6_69|} OutVars{main_~y~0=v_main_~y~0_135, main_#t~post5=|v_main_#t~post5_68|, main_~x~0=v_main_~x~0_129, main_#t~post6=|v_main_#t~post6_68|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5442#true} is VALID [2022-04-28 03:43:00,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {5442#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5442#true} is VALID [2022-04-28 03:43:00,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {5442#true} call #t~ret17 := main(); {5442#true} is VALID [2022-04-28 03:43:00,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5442#true} {5442#true} #94#return; {5442#true} is VALID [2022-04-28 03:43:00,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {5442#true} assume true; {5442#true} is VALID [2022-04-28 03:43:00,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {5442#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5442#true} is VALID [2022-04-28 03:43:00,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {5442#true} call ULTIMATE.init(); {5442#true} is VALID [2022-04-28 03:43:00,086 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:43:00,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138208089] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:43:00,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:43:00,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2022-04-28 03:43:00,339 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:00,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [563864766] [2022-04-28 03:43:00,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [563864766] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:00,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:00,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:43:00,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637092624] [2022-04-28 03:43:00,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:00,340 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 03:43:00,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:00,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:00,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:00,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:43:00,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:00,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:43:00,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-04-28 03:43:00,436 INFO L87 Difference]: Start difference. First operand 44 states and 57 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:01,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:01,249 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2022-04-28 03:43:01,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 03:43:01,249 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 03:43:01,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:01,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:01,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-04-28 03:43:01,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:01,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-04-28 03:43:01,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 58 transitions. [2022-04-28 03:43:03,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 57 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:03,362 INFO L225 Difference]: With dead ends: 72 [2022-04-28 03:43:03,362 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 03:43:03,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2022-04-28 03:43:03,363 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 36 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:03,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 44 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 75 Invalid, 0 Unknown, 24 Unchecked, 0.1s Time] [2022-04-28 03:43:03,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 03:43:03,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 35. [2022-04-28 03:43:03,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:03,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 35 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:03,522 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 35 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:03,522 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 35 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:03,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:03,523 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2022-04-28 03:43:03,523 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2022-04-28 03:43:03,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:03,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:03,523 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-28 03:43:03,523 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-28 03:43:03,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:03,524 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2022-04-28 03:43:03,524 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2022-04-28 03:43:03,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:03,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:03,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:03,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:03,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:03,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2022-04-28 03:43:03,525 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 24 [2022-04-28 03:43:03,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:03,525 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2022-04-28 03:43:03,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:03,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 46 transitions. [2022-04-28 03:43:09,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 43 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:09,823 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-28 03:43:09,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 03:43:09,824 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:09,824 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:09,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 03:43:10,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 03:43:10,033 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:10,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:10,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1625331179, now seen corresponding path program 2 times [2022-04-28 03:43:10,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:10,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1905164437] [2022-04-28 03:43:10,274 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:43:10,275 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:10,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1323332873, now seen corresponding path program 1 times [2022-04-28 03:43:10,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:10,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049867598] [2022-04-28 03:43:10,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:10,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:10,285 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_15.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:43:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:10,292 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_15.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:43:10,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:10,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {5957#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5948#true} is VALID [2022-04-28 03:43:10,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {5948#true} assume true; {5948#true} is VALID [2022-04-28 03:43:10,348 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5948#true} {5948#true} #94#return; {5948#true} is VALID [2022-04-28 03:43:10,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {5948#true} call ULTIMATE.init(); {5957#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:10,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {5957#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5948#true} is VALID [2022-04-28 03:43:10,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {5948#true} assume true; {5948#true} is VALID [2022-04-28 03:43:10,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5948#true} {5948#true} #94#return; {5948#true} is VALID [2022-04-28 03:43:10,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {5948#true} call #t~ret17 := main(); {5948#true} is VALID [2022-04-28 03:43:10,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {5948#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5948#true} is VALID [2022-04-28 03:43:10,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {5948#true} [126] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_142 4294967296)) (.cse1 (= v_main_~x~0_142 v_main_~x~0_141)) (.cse2 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse3 (= v_main_~y~0_149 v_main_~y~0_148)) (.cse4 (= |v_main_#t~post5_74| |v_main_#t~post5_73|))) (or (and (= v_main_~y~0_148 (+ v_main_~x~0_142 (* v_main_~x~0_141 (- 1)) v_main_~y~0_149)) (< 0 .cse0) (forall ((v_it_15 Int)) (or (< 0 (mod (+ v_main_~x~0_142 (* 4294967295 v_it_15)) 4294967296)) (not (<= (+ v_main_~x~0_141 v_it_15 1) v_main_~x~0_142)) (not (<= 1 v_it_15)))) (< v_main_~x~0_141 v_main_~x~0_142)) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_149, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_142, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_148, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_141, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5948#true} is VALID [2022-04-28 03:43:10,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {5948#true} [125] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5953#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:43:10,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {5953#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {5953#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:43:10,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {5953#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5954#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:43:10,352 INFO L290 TraceCheckUtils]: 10: Hoare triple {5954#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5955#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:10,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {5955#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5956#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:43:10,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {5956#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {5956#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:43:10,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {5956#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5956#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:43:10,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {5956#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5956#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:43:10,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {5956#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {5956#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:43:10,355 INFO L290 TraceCheckUtils]: 16: Hoare triple {5956#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {5949#false} is VALID [2022-04-28 03:43:10,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {5949#false} assume !(~z~0 % 4294967296 > 0); {5949#false} is VALID [2022-04-28 03:43:10,355 INFO L290 TraceCheckUtils]: 18: Hoare triple {5949#false} assume !(~y~0 % 4294967296 > 0); {5949#false} is VALID [2022-04-28 03:43:10,355 INFO L272 TraceCheckUtils]: 19: Hoare triple {5949#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5949#false} is VALID [2022-04-28 03:43:10,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {5949#false} ~cond := #in~cond; {5949#false} is VALID [2022-04-28 03:43:10,355 INFO L290 TraceCheckUtils]: 21: Hoare triple {5949#false} assume 0 == ~cond; {5949#false} is VALID [2022-04-28 03:43:10,355 INFO L290 TraceCheckUtils]: 22: Hoare triple {5949#false} assume !false; {5949#false} is VALID [2022-04-28 03:43:10,356 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:43:10,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:10,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049867598] [2022-04-28 03:43:10,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049867598] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:43:10,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55736331] [2022-04-28 03:43:10,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:10,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:10,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:10,357 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:43:10,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 03:43:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:10,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:43:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:10,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:43:10,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {5948#true} call ULTIMATE.init(); {5948#true} is VALID [2022-04-28 03:43:10,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {5948#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5948#true} is VALID [2022-04-28 03:43:10,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {5948#true} assume true; {5948#true} is VALID [2022-04-28 03:43:10,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5948#true} {5948#true} #94#return; {5948#true} is VALID [2022-04-28 03:43:10,494 INFO L272 TraceCheckUtils]: 4: Hoare triple {5948#true} call #t~ret17 := main(); {5948#true} is VALID [2022-04-28 03:43:10,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {5948#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5948#true} is VALID [2022-04-28 03:43:10,494 INFO L290 TraceCheckUtils]: 6: Hoare triple {5948#true} [126] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_142 4294967296)) (.cse1 (= v_main_~x~0_142 v_main_~x~0_141)) (.cse2 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse3 (= v_main_~y~0_149 v_main_~y~0_148)) (.cse4 (= |v_main_#t~post5_74| |v_main_#t~post5_73|))) (or (and (= v_main_~y~0_148 (+ v_main_~x~0_142 (* v_main_~x~0_141 (- 1)) v_main_~y~0_149)) (< 0 .cse0) (forall ((v_it_15 Int)) (or (< 0 (mod (+ v_main_~x~0_142 (* 4294967295 v_it_15)) 4294967296)) (not (<= (+ v_main_~x~0_141 v_it_15 1) v_main_~x~0_142)) (not (<= 1 v_it_15)))) (< v_main_~x~0_141 v_main_~x~0_142)) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_149, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_142, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_148, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_141, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5948#true} is VALID [2022-04-28 03:43:10,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {5948#true} [125] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5948#true} is VALID [2022-04-28 03:43:10,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {5948#true} ~z~0 := ~y~0; {5985#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:43:10,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {5985#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5989#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:43:10,500 INFO L290 TraceCheckUtils]: 10: Hoare triple {5989#(= main_~y~0 (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5993#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:43:10,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {5993#(= main_~y~0 (+ main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5997#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:43:10,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {5997#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {5997#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:43:10,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {5997#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6004#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:43:10,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {6004#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6008#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:10,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {6008#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5949#false} is VALID [2022-04-28 03:43:10,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {5949#false} assume !(~x~0 % 4294967296 > 0); {5949#false} is VALID [2022-04-28 03:43:10,503 INFO L290 TraceCheckUtils]: 17: Hoare triple {5949#false} assume !(~z~0 % 4294967296 > 0); {5949#false} is VALID [2022-04-28 03:43:10,503 INFO L290 TraceCheckUtils]: 18: Hoare triple {5949#false} assume !(~y~0 % 4294967296 > 0); {5949#false} is VALID [2022-04-28 03:43:10,503 INFO L272 TraceCheckUtils]: 19: Hoare triple {5949#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5949#false} is VALID [2022-04-28 03:43:10,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {5949#false} ~cond := #in~cond; {5949#false} is VALID [2022-04-28 03:43:10,503 INFO L290 TraceCheckUtils]: 21: Hoare triple {5949#false} assume 0 == ~cond; {5949#false} is VALID [2022-04-28 03:43:10,503 INFO L290 TraceCheckUtils]: 22: Hoare triple {5949#false} assume !false; {5949#false} is VALID [2022-04-28 03:43:10,503 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:43:10,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:43:10,633 INFO L290 TraceCheckUtils]: 22: Hoare triple {5949#false} assume !false; {5949#false} is VALID [2022-04-28 03:43:10,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {5949#false} assume 0 == ~cond; {5949#false} is VALID [2022-04-28 03:43:10,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {5949#false} ~cond := #in~cond; {5949#false} is VALID [2022-04-28 03:43:10,634 INFO L272 TraceCheckUtils]: 19: Hoare triple {5949#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5949#false} is VALID [2022-04-28 03:43:10,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {5949#false} assume !(~y~0 % 4294967296 > 0); {5949#false} is VALID [2022-04-28 03:43:10,634 INFO L290 TraceCheckUtils]: 17: Hoare triple {5949#false} assume !(~z~0 % 4294967296 > 0); {5949#false} is VALID [2022-04-28 03:43:10,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {5949#false} assume !(~x~0 % 4294967296 > 0); {5949#false} is VALID [2022-04-28 03:43:10,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {6008#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5949#false} is VALID [2022-04-28 03:43:10,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {6004#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6008#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:10,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {5997#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6004#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:43:10,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {5997#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {5997#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:43:10,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {6066#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5997#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:43:10,638 INFO L290 TraceCheckUtils]: 10: Hoare triple {6070#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6066#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:43:10,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {6074#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6070#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:43:10,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {5948#true} ~z~0 := ~y~0; {6074#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 03:43:10,640 INFO L290 TraceCheckUtils]: 7: Hoare triple {5948#true} [125] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5948#true} is VALID [2022-04-28 03:43:10,640 INFO L290 TraceCheckUtils]: 6: Hoare triple {5948#true} [126] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_142 4294967296)) (.cse1 (= v_main_~x~0_142 v_main_~x~0_141)) (.cse2 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse3 (= v_main_~y~0_149 v_main_~y~0_148)) (.cse4 (= |v_main_#t~post5_74| |v_main_#t~post5_73|))) (or (and (= v_main_~y~0_148 (+ v_main_~x~0_142 (* v_main_~x~0_141 (- 1)) v_main_~y~0_149)) (< 0 .cse0) (forall ((v_it_15 Int)) (or (< 0 (mod (+ v_main_~x~0_142 (* 4294967295 v_it_15)) 4294967296)) (not (<= (+ v_main_~x~0_141 v_it_15 1) v_main_~x~0_142)) (not (<= 1 v_it_15)))) (< v_main_~x~0_141 v_main_~x~0_142)) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_149, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_142, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_148, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_141, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5948#true} is VALID [2022-04-28 03:43:10,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {5948#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5948#true} is VALID [2022-04-28 03:43:10,640 INFO L272 TraceCheckUtils]: 4: Hoare triple {5948#true} call #t~ret17 := main(); {5948#true} is VALID [2022-04-28 03:43:10,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5948#true} {5948#true} #94#return; {5948#true} is VALID [2022-04-28 03:43:10,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {5948#true} assume true; {5948#true} is VALID [2022-04-28 03:43:10,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {5948#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5948#true} is VALID [2022-04-28 03:43:10,640 INFO L272 TraceCheckUtils]: 0: Hoare triple {5948#true} call ULTIMATE.init(); {5948#true} is VALID [2022-04-28 03:43:10,640 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:43:10,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55736331] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:43:10,641 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:43:10,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 16 [2022-04-28 03:43:10,736 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:10,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1905164437] [2022-04-28 03:43:10,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1905164437] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:10,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:10,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:43:10,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831457210] [2022-04-28 03:43:10,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:10,737 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 03:43:10,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:10,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:10,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:10,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:43:10,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:10,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:43:10,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-04-28 03:43:10,755 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:11,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:11,984 INFO L93 Difference]: Finished difference Result 107 states and 158 transitions. [2022-04-28 03:43:11,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 03:43:11,984 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 03:43:11,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:11,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:11,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 98 transitions. [2022-04-28 03:43:11,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:11,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 98 transitions. [2022-04-28 03:43:11,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 98 transitions. [2022-04-28 03:43:12,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:12,093 INFO L225 Difference]: With dead ends: 107 [2022-04-28 03:43:12,093 INFO L226 Difference]: Without dead ends: 95 [2022-04-28 03:43:12,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2022-04-28 03:43:12,093 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 92 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:12,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 60 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:43:12,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-28 03:43:12,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 44. [2022-04-28 03:43:12,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:12,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 44 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 39 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:12,289 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 44 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 39 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:12,289 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 44 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 39 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:12,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:12,290 INFO L93 Difference]: Finished difference Result 95 states and 137 transitions. [2022-04-28 03:43:12,290 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2022-04-28 03:43:12,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:12,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:12,291 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 39 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 95 states. [2022-04-28 03:43:12,291 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 39 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 95 states. [2022-04-28 03:43:12,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:12,292 INFO L93 Difference]: Finished difference Result 95 states and 137 transitions. [2022-04-28 03:43:12,292 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2022-04-28 03:43:12,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:12,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:12,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:12,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:12,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 39 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:12,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 59 transitions. [2022-04-28 03:43:12,293 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 59 transitions. Word has length 24 [2022-04-28 03:43:12,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:12,293 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 59 transitions. [2022-04-28 03:43:12,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:12,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 59 transitions. [2022-04-28 03:43:17,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 57 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:17,159 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2022-04-28 03:43:17,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 03:43:17,159 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:17,159 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:17,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 03:43:17,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 03:43:17,360 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:17,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:17,361 INFO L85 PathProgramCache]: Analyzing trace with hash -529458535, now seen corresponding path program 2 times [2022-04-28 03:43:17,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:17,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1154998595] [2022-04-28 03:43:17,515 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:43:17,520 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:17,522 INFO L85 PathProgramCache]: Analyzing trace with hash 955029047, now seen corresponding path program 1 times [2022-04-28 03:43:17,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:17,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269013942] [2022-04-28 03:43:17,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:17,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:17,530 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_16.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:43:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:17,542 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_16.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:43:17,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:17,582 INFO L290 TraceCheckUtils]: 0: Hoare triple {6623#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6614#true} is VALID [2022-04-28 03:43:17,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {6614#true} assume true; {6614#true} is VALID [2022-04-28 03:43:17,582 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6614#true} {6614#true} #94#return; {6614#true} is VALID [2022-04-28 03:43:17,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {6614#true} call ULTIMATE.init(); {6623#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:17,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {6623#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6614#true} is VALID [2022-04-28 03:43:17,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {6614#true} assume true; {6614#true} is VALID [2022-04-28 03:43:17,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6614#true} {6614#true} #94#return; {6614#true} is VALID [2022-04-28 03:43:17,583 INFO L272 TraceCheckUtils]: 4: Hoare triple {6614#true} call #t~ret17 := main(); {6614#true} is VALID [2022-04-28 03:43:17,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {6614#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6614#true} is VALID [2022-04-28 03:43:17,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {6614#true} [128] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_153 4294967296)) (.cse0 (= v_main_~x~0_153 v_main_~x~0_152)) (.cse1 (= |v_main_#t~post6_79| |v_main_#t~post6_78|)) (.cse2 (= v_main_~y~0_161 v_main_~y~0_160)) (.cse4 (= |v_main_#t~post5_79| |v_main_#t~post5_78|))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (< 0 .cse3) (= v_main_~y~0_160 (+ v_main_~x~0_153 (* v_main_~x~0_152 (- 1)) v_main_~y~0_161)) (< v_main_~x~0_152 v_main_~x~0_153) (forall ((v_it_16 Int)) (or (< 0 (mod (+ v_main_~x~0_153 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)) (not (<= (+ v_main_~x~0_152 v_it_16 1) v_main_~x~0_153))))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_161, main_#t~post5=|v_main_#t~post5_79|, main_~x~0=v_main_~x~0_153, main_#t~post6=|v_main_#t~post6_79|} OutVars{main_~y~0=v_main_~y~0_160, main_#t~post5=|v_main_#t~post5_78|, main_~x~0=v_main_~x~0_152, main_#t~post6=|v_main_#t~post6_78|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6614#true} is VALID [2022-04-28 03:43:17,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {6614#true} [127] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {6614#true} is VALID [2022-04-28 03:43:17,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {6614#true} ~z~0 := ~y~0; {6614#true} is VALID [2022-04-28 03:43:17,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {6614#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6619#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:17,585 INFO L290 TraceCheckUtils]: 10: Hoare triple {6619#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6620#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:43:17,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {6620#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} assume !(~z~0 % 4294967296 > 0); {6620#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:43:17,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {6620#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6621#(<= main_~z~0 (+ 4294967294 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:43:17,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {6621#(<= main_~z~0 (+ 4294967294 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6622#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:43:17,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {6622#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {6622#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:43:17,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {6622#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6622#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:43:17,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {6622#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6622#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:43:17,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {6622#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {6622#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:43:17,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {6622#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {6615#false} is VALID [2022-04-28 03:43:17,589 INFO L290 TraceCheckUtils]: 19: Hoare triple {6615#false} assume !(~y~0 % 4294967296 > 0); {6615#false} is VALID [2022-04-28 03:43:17,589 INFO L272 TraceCheckUtils]: 20: Hoare triple {6615#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6615#false} is VALID [2022-04-28 03:43:17,589 INFO L290 TraceCheckUtils]: 21: Hoare triple {6615#false} ~cond := #in~cond; {6615#false} is VALID [2022-04-28 03:43:17,589 INFO L290 TraceCheckUtils]: 22: Hoare triple {6615#false} assume 0 == ~cond; {6615#false} is VALID [2022-04-28 03:43:17,589 INFO L290 TraceCheckUtils]: 23: Hoare triple {6615#false} assume !false; {6615#false} is VALID [2022-04-28 03:43:17,589 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:43:17,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:17,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269013942] [2022-04-28 03:43:17,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269013942] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:43:17,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004715885] [2022-04-28 03:43:17,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:17,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:17,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:17,590 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:43:17,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 03:43:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:17,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 03:43:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:17,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:43:17,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {6614#true} call ULTIMATE.init(); {6614#true} is VALID [2022-04-28 03:43:17,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {6614#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6614#true} is VALID [2022-04-28 03:43:17,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {6614#true} assume true; {6614#true} is VALID [2022-04-28 03:43:17,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6614#true} {6614#true} #94#return; {6614#true} is VALID [2022-04-28 03:43:17,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {6614#true} call #t~ret17 := main(); {6614#true} is VALID [2022-04-28 03:43:17,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {6614#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6614#true} is VALID [2022-04-28 03:43:17,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {6614#true} [128] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_153 4294967296)) (.cse0 (= v_main_~x~0_153 v_main_~x~0_152)) (.cse1 (= |v_main_#t~post6_79| |v_main_#t~post6_78|)) (.cse2 (= v_main_~y~0_161 v_main_~y~0_160)) (.cse4 (= |v_main_#t~post5_79| |v_main_#t~post5_78|))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (< 0 .cse3) (= v_main_~y~0_160 (+ v_main_~x~0_153 (* v_main_~x~0_152 (- 1)) v_main_~y~0_161)) (< v_main_~x~0_152 v_main_~x~0_153) (forall ((v_it_16 Int)) (or (< 0 (mod (+ v_main_~x~0_153 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)) (not (<= (+ v_main_~x~0_152 v_it_16 1) v_main_~x~0_153))))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_161, main_#t~post5=|v_main_#t~post5_79|, main_~x~0=v_main_~x~0_153, main_#t~post6=|v_main_#t~post6_79|} OutVars{main_~y~0=v_main_~y~0_160, main_#t~post5=|v_main_#t~post5_78|, main_~x~0=v_main_~x~0_152, main_#t~post6=|v_main_#t~post6_78|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6614#true} is VALID [2022-04-28 03:43:17,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {6614#true} [127] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {6614#true} is VALID [2022-04-28 03:43:17,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {6614#true} ~z~0 := ~y~0; {6651#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:43:17,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {6651#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6655#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:17,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {6655#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6655#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:17,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {6655#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6655#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:17,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {6655#(< 0 (mod main_~y~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6665#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 03:43:17,727 INFO L290 TraceCheckUtils]: 13: Hoare triple {6665#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6669#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 03:43:17,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {6669#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !(~y~0 % 4294967296 > 0); {6669#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 03:43:17,728 INFO L290 TraceCheckUtils]: 15: Hoare triple {6669#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6665#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 03:43:17,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {6665#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6655#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:17,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {6655#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {6655#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:17,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {6655#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6655#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:17,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {6655#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {6615#false} is VALID [2022-04-28 03:43:17,729 INFO L272 TraceCheckUtils]: 20: Hoare triple {6615#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6615#false} is VALID [2022-04-28 03:43:17,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {6615#false} ~cond := #in~cond; {6615#false} is VALID [2022-04-28 03:43:17,729 INFO L290 TraceCheckUtils]: 22: Hoare triple {6615#false} assume 0 == ~cond; {6615#false} is VALID [2022-04-28 03:43:17,729 INFO L290 TraceCheckUtils]: 23: Hoare triple {6615#false} assume !false; {6615#false} is VALID [2022-04-28 03:43:17,729 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:43:17,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:43:17,809 INFO L290 TraceCheckUtils]: 23: Hoare triple {6615#false} assume !false; {6615#false} is VALID [2022-04-28 03:43:17,809 INFO L290 TraceCheckUtils]: 22: Hoare triple {6615#false} assume 0 == ~cond; {6615#false} is VALID [2022-04-28 03:43:17,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {6615#false} ~cond := #in~cond; {6615#false} is VALID [2022-04-28 03:43:17,809 INFO L272 TraceCheckUtils]: 20: Hoare triple {6615#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6615#false} is VALID [2022-04-28 03:43:17,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {6655#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {6615#false} is VALID [2022-04-28 03:43:17,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {6655#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6655#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:17,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {6655#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {6655#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:17,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {6665#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6655#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:17,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {6669#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6665#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 03:43:17,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {6669#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !(~y~0 % 4294967296 > 0); {6669#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 03:43:17,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {6665#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6669#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 03:43:17,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {6655#(< 0 (mod main_~y~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6665#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 03:43:17,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {6655#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6655#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:17,814 INFO L290 TraceCheckUtils]: 10: Hoare triple {6655#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6655#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:17,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {6742#(or (<= (mod main_~z~0 4294967296) 0) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6655#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:17,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {6614#true} ~z~0 := ~y~0; {6742#(or (<= (mod main_~z~0 4294967296) 0) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:17,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {6614#true} [127] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {6614#true} is VALID [2022-04-28 03:43:17,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {6614#true} [128] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_153 4294967296)) (.cse0 (= v_main_~x~0_153 v_main_~x~0_152)) (.cse1 (= |v_main_#t~post6_79| |v_main_#t~post6_78|)) (.cse2 (= v_main_~y~0_161 v_main_~y~0_160)) (.cse4 (= |v_main_#t~post5_79| |v_main_#t~post5_78|))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (< 0 .cse3) (= v_main_~y~0_160 (+ v_main_~x~0_153 (* v_main_~x~0_152 (- 1)) v_main_~y~0_161)) (< v_main_~x~0_152 v_main_~x~0_153) (forall ((v_it_16 Int)) (or (< 0 (mod (+ v_main_~x~0_153 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)) (not (<= (+ v_main_~x~0_152 v_it_16 1) v_main_~x~0_153))))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_161, main_#t~post5=|v_main_#t~post5_79|, main_~x~0=v_main_~x~0_153, main_#t~post6=|v_main_#t~post6_79|} OutVars{main_~y~0=v_main_~y~0_160, main_#t~post5=|v_main_#t~post5_78|, main_~x~0=v_main_~x~0_152, main_#t~post6=|v_main_#t~post6_78|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6614#true} is VALID [2022-04-28 03:43:17,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {6614#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6614#true} is VALID [2022-04-28 03:43:17,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {6614#true} call #t~ret17 := main(); {6614#true} is VALID [2022-04-28 03:43:17,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6614#true} {6614#true} #94#return; {6614#true} is VALID [2022-04-28 03:43:17,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {6614#true} assume true; {6614#true} is VALID [2022-04-28 03:43:17,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {6614#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6614#true} is VALID [2022-04-28 03:43:17,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {6614#true} call ULTIMATE.init(); {6614#true} is VALID [2022-04-28 03:43:17,815 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:43:17,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004715885] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:43:17,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:43:17,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-28 03:43:17,886 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:17,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1154998595] [2022-04-28 03:43:17,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1154998595] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:17,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:17,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:43:17,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098463131] [2022-04-28 03:43:17,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:17,886 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 03:43:17,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:17,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:17,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:17,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:43:17,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:17,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:43:17,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-04-28 03:43:17,911 INFO L87 Difference]: Start difference. First operand 44 states and 59 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:19,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:19,371 INFO L93 Difference]: Finished difference Result 103 states and 147 transitions. [2022-04-28 03:43:19,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 03:43:19,371 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 03:43:19,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:19,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:19,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 88 transitions. [2022-04-28 03:43:19,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:19,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 88 transitions. [2022-04-28 03:43:19,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 88 transitions. [2022-04-28 03:43:19,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:19,477 INFO L225 Difference]: With dead ends: 103 [2022-04-28 03:43:19,477 INFO L226 Difference]: Without dead ends: 95 [2022-04-28 03:43:19,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2022-04-28 03:43:19,478 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 56 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:19,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 52 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:43:19,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-28 03:43:19,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 60. [2022-04-28 03:43:19,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:19,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 60 states, 55 states have (on average 1.4) internal successors, (77), 55 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:19,792 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 60 states, 55 states have (on average 1.4) internal successors, (77), 55 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:19,792 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 60 states, 55 states have (on average 1.4) internal successors, (77), 55 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:19,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:19,794 INFO L93 Difference]: Finished difference Result 95 states and 133 transitions. [2022-04-28 03:43:19,794 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 133 transitions. [2022-04-28 03:43:19,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:19,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:19,794 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 55 states have (on average 1.4) internal successors, (77), 55 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 95 states. [2022-04-28 03:43:19,794 INFO L87 Difference]: Start difference. First operand has 60 states, 55 states have (on average 1.4) internal successors, (77), 55 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 95 states. [2022-04-28 03:43:19,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:19,795 INFO L93 Difference]: Finished difference Result 95 states and 133 transitions. [2022-04-28 03:43:19,795 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 133 transitions. [2022-04-28 03:43:19,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:19,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:19,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:19,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:19,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.4) internal successors, (77), 55 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:19,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 81 transitions. [2022-04-28 03:43:19,797 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 81 transitions. Word has length 25 [2022-04-28 03:43:19,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:19,797 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 81 transitions. [2022-04-28 03:43:19,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:19,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 81 transitions. [2022-04-28 03:43:25,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 79 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:25,461 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 81 transitions. [2022-04-28 03:43:25,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 03:43:25,462 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:25,462 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:25,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 03:43:25,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 03:43:25,667 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:25,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:25,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1702758372, now seen corresponding path program 3 times [2022-04-28 03:43:25,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:25,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [736408980] [2022-04-28 03:43:25,978 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:43:25,980 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:25,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1089112006, now seen corresponding path program 1 times [2022-04-28 03:43:25,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:25,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449109093] [2022-04-28 03:43:25,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:25,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:25,989 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_17.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:43:25,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:25,999 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_17.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:43:26,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:26,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {7326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7315#true} is VALID [2022-04-28 03:43:26,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-28 03:43:26,064 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7315#true} {7315#true} #94#return; {7315#true} is VALID [2022-04-28 03:43:26,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {7315#true} call ULTIMATE.init(); {7326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:26,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {7326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7315#true} is VALID [2022-04-28 03:43:26,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-28 03:43:26,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7315#true} {7315#true} #94#return; {7315#true} is VALID [2022-04-28 03:43:26,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {7315#true} call #t~ret17 := main(); {7315#true} is VALID [2022-04-28 03:43:26,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {7315#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7315#true} is VALID [2022-04-28 03:43:26,065 INFO L290 TraceCheckUtils]: 6: Hoare triple {7315#true} [130] L16-2-->L16-3_primed: Formula: (let ((.cse2 (mod v_main_~x~0_165 4294967296)) (.cse0 (= v_main_~x~0_165 v_main_~x~0_164)) (.cse1 (= |v_main_#t~post6_84| |v_main_#t~post6_83|)) (.cse3 (= v_main_~y~0_177 v_main_~y~0_176)) (.cse4 (= |v_main_#t~post5_84| |v_main_#t~post5_83|))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and (= v_main_~x~0_164 (+ v_main_~x~0_165 v_main_~y~0_177 (* (- 1) v_main_~y~0_176))) (forall ((v_it_17 Int)) (or (< 0 (mod (+ v_main_~x~0_165 (* 4294967295 v_it_17)) 4294967296)) (not (<= (+ v_main_~y~0_177 v_it_17 1) v_main_~y~0_176)) (not (<= 1 v_it_17)))) (< 0 .cse2) (< v_main_~y~0_177 v_main_~y~0_176)) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_177, main_#t~post5=|v_main_#t~post5_84|, main_~x~0=v_main_~x~0_165, main_#t~post6=|v_main_#t~post6_84|} OutVars{main_~y~0=v_main_~y~0_176, main_#t~post5=|v_main_#t~post5_83|, main_~x~0=v_main_~x~0_164, main_#t~post6=|v_main_#t~post6_83|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7315#true} is VALID [2022-04-28 03:43:26,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {7315#true} [129] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7315#true} is VALID [2022-04-28 03:43:26,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {7315#true} ~z~0 := ~y~0; {7320#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:43:26,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {7320#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7321#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:43:26,066 INFO L290 TraceCheckUtils]: 10: Hoare triple {7321#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7322#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:43:26,067 INFO L290 TraceCheckUtils]: 11: Hoare triple {7322#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {7323#(and (<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 2 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:43:26,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {7323#(and (<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 2 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7324#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:43:26,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {7324#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7325#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:43:26,073 INFO L290 TraceCheckUtils]: 14: Hoare triple {7325#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7316#false} is VALID [2022-04-28 03:43:26,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {7316#false} assume !(~y~0 % 4294967296 > 0); {7316#false} is VALID [2022-04-28 03:43:26,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {7316#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7316#false} is VALID [2022-04-28 03:43:26,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {7316#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7316#false} is VALID [2022-04-28 03:43:26,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {7316#false} assume !(~x~0 % 4294967296 > 0); {7316#false} is VALID [2022-04-28 03:43:26,073 INFO L290 TraceCheckUtils]: 19: Hoare triple {7316#false} assume !(~z~0 % 4294967296 > 0); {7316#false} is VALID [2022-04-28 03:43:26,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {7316#false} assume !(~y~0 % 4294967296 > 0); {7316#false} is VALID [2022-04-28 03:43:26,073 INFO L272 TraceCheckUtils]: 21: Hoare triple {7316#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7316#false} is VALID [2022-04-28 03:43:26,073 INFO L290 TraceCheckUtils]: 22: Hoare triple {7316#false} ~cond := #in~cond; {7316#false} is VALID [2022-04-28 03:43:26,073 INFO L290 TraceCheckUtils]: 23: Hoare triple {7316#false} assume 0 == ~cond; {7316#false} is VALID [2022-04-28 03:43:26,073 INFO L290 TraceCheckUtils]: 24: Hoare triple {7316#false} assume !false; {7316#false} is VALID [2022-04-28 03:43:26,074 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:43:26,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:26,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449109093] [2022-04-28 03:43:26,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449109093] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:43:26,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319824165] [2022-04-28 03:43:26,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:26,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:26,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:26,075 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:43:26,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 03:43:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:26,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:43:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:26,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:43:26,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {7315#true} call ULTIMATE.init(); {7315#true} is VALID [2022-04-28 03:43:26,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {7315#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7315#true} is VALID [2022-04-28 03:43:26,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-28 03:43:26,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7315#true} {7315#true} #94#return; {7315#true} is VALID [2022-04-28 03:43:26,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {7315#true} call #t~ret17 := main(); {7315#true} is VALID [2022-04-28 03:43:26,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {7315#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7315#true} is VALID [2022-04-28 03:43:26,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {7315#true} [130] L16-2-->L16-3_primed: Formula: (let ((.cse2 (mod v_main_~x~0_165 4294967296)) (.cse0 (= v_main_~x~0_165 v_main_~x~0_164)) (.cse1 (= |v_main_#t~post6_84| |v_main_#t~post6_83|)) (.cse3 (= v_main_~y~0_177 v_main_~y~0_176)) (.cse4 (= |v_main_#t~post5_84| |v_main_#t~post5_83|))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and (= v_main_~x~0_164 (+ v_main_~x~0_165 v_main_~y~0_177 (* (- 1) v_main_~y~0_176))) (forall ((v_it_17 Int)) (or (< 0 (mod (+ v_main_~x~0_165 (* 4294967295 v_it_17)) 4294967296)) (not (<= (+ v_main_~y~0_177 v_it_17 1) v_main_~y~0_176)) (not (<= 1 v_it_17)))) (< 0 .cse2) (< v_main_~y~0_177 v_main_~y~0_176)) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_177, main_#t~post5=|v_main_#t~post5_84|, main_~x~0=v_main_~x~0_165, main_#t~post6=|v_main_#t~post6_84|} OutVars{main_~y~0=v_main_~y~0_176, main_#t~post5=|v_main_#t~post5_83|, main_~x~0=v_main_~x~0_164, main_#t~post6=|v_main_#t~post6_83|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7315#true} is VALID [2022-04-28 03:43:26,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {7315#true} [129] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7315#true} is VALID [2022-04-28 03:43:26,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {7315#true} ~z~0 := ~y~0; {7320#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:43:26,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {7320#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7321#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:43:26,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {7321#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7322#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:43:26,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {7322#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {7363#(<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296))} is VALID [2022-04-28 03:43:26,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {7363#(<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7324#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:43:26,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {7324#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7325#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:43:26,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {7325#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7316#false} is VALID [2022-04-28 03:43:26,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {7316#false} assume !(~y~0 % 4294967296 > 0); {7316#false} is VALID [2022-04-28 03:43:26,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {7316#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7316#false} is VALID [2022-04-28 03:43:26,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {7316#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7316#false} is VALID [2022-04-28 03:43:26,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {7316#false} assume !(~x~0 % 4294967296 > 0); {7316#false} is VALID [2022-04-28 03:43:26,434 INFO L290 TraceCheckUtils]: 19: Hoare triple {7316#false} assume !(~z~0 % 4294967296 > 0); {7316#false} is VALID [2022-04-28 03:43:26,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {7316#false} assume !(~y~0 % 4294967296 > 0); {7316#false} is VALID [2022-04-28 03:43:26,434 INFO L272 TraceCheckUtils]: 21: Hoare triple {7316#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7316#false} is VALID [2022-04-28 03:43:26,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {7316#false} ~cond := #in~cond; {7316#false} is VALID [2022-04-28 03:43:26,434 INFO L290 TraceCheckUtils]: 23: Hoare triple {7316#false} assume 0 == ~cond; {7316#false} is VALID [2022-04-28 03:43:26,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {7316#false} assume !false; {7316#false} is VALID [2022-04-28 03:43:26,434 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:43:26,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:43:26,846 INFO L290 TraceCheckUtils]: 24: Hoare triple {7316#false} assume !false; {7316#false} is VALID [2022-04-28 03:43:26,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {7316#false} assume 0 == ~cond; {7316#false} is VALID [2022-04-28 03:43:26,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {7316#false} ~cond := #in~cond; {7316#false} is VALID [2022-04-28 03:43:26,847 INFO L272 TraceCheckUtils]: 21: Hoare triple {7316#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7316#false} is VALID [2022-04-28 03:43:26,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {7316#false} assume !(~y~0 % 4294967296 > 0); {7316#false} is VALID [2022-04-28 03:43:26,847 INFO L290 TraceCheckUtils]: 19: Hoare triple {7316#false} assume !(~z~0 % 4294967296 > 0); {7316#false} is VALID [2022-04-28 03:43:26,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {7316#false} assume !(~x~0 % 4294967296 > 0); {7316#false} is VALID [2022-04-28 03:43:26,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {7316#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7316#false} is VALID [2022-04-28 03:43:26,847 INFO L290 TraceCheckUtils]: 16: Hoare triple {7316#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7316#false} is VALID [2022-04-28 03:43:26,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {7316#false} assume !(~y~0 % 4294967296 > 0); {7316#false} is VALID [2022-04-28 03:43:26,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {7325#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7316#false} is VALID [2022-04-28 03:43:26,849 INFO L290 TraceCheckUtils]: 13: Hoare triple {7324#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7325#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:43:26,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {7363#(<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7324#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:43:26,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {7442#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {7363#(<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296))} is VALID [2022-04-28 03:43:26,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {7446#(or (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7442#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)))} is VALID [2022-04-28 03:43:26,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {7450#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7446#(or (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:43:26,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {7315#true} ~z~0 := ~y~0; {7450#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)))} is VALID [2022-04-28 03:43:26,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {7315#true} [129] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7315#true} is VALID [2022-04-28 03:43:26,853 INFO L290 TraceCheckUtils]: 6: Hoare triple {7315#true} [130] L16-2-->L16-3_primed: Formula: (let ((.cse2 (mod v_main_~x~0_165 4294967296)) (.cse0 (= v_main_~x~0_165 v_main_~x~0_164)) (.cse1 (= |v_main_#t~post6_84| |v_main_#t~post6_83|)) (.cse3 (= v_main_~y~0_177 v_main_~y~0_176)) (.cse4 (= |v_main_#t~post5_84| |v_main_#t~post5_83|))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and (= v_main_~x~0_164 (+ v_main_~x~0_165 v_main_~y~0_177 (* (- 1) v_main_~y~0_176))) (forall ((v_it_17 Int)) (or (< 0 (mod (+ v_main_~x~0_165 (* 4294967295 v_it_17)) 4294967296)) (not (<= (+ v_main_~y~0_177 v_it_17 1) v_main_~y~0_176)) (not (<= 1 v_it_17)))) (< 0 .cse2) (< v_main_~y~0_177 v_main_~y~0_176)) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_177, main_#t~post5=|v_main_#t~post5_84|, main_~x~0=v_main_~x~0_165, main_#t~post6=|v_main_#t~post6_84|} OutVars{main_~y~0=v_main_~y~0_176, main_#t~post5=|v_main_#t~post5_83|, main_~x~0=v_main_~x~0_164, main_#t~post6=|v_main_#t~post6_83|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7315#true} is VALID [2022-04-28 03:43:26,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {7315#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7315#true} is VALID [2022-04-28 03:43:26,853 INFO L272 TraceCheckUtils]: 4: Hoare triple {7315#true} call #t~ret17 := main(); {7315#true} is VALID [2022-04-28 03:43:26,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7315#true} {7315#true} #94#return; {7315#true} is VALID [2022-04-28 03:43:26,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-28 03:43:26,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {7315#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7315#true} is VALID [2022-04-28 03:43:26,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {7315#true} call ULTIMATE.init(); {7315#true} is VALID [2022-04-28 03:43:26,854 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:43:26,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319824165] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:43:26,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:43:26,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2022-04-28 03:43:26,904 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:26,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [736408980] [2022-04-28 03:43:26,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [736408980] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:26,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:26,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:43:26,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89526194] [2022-04-28 03:43:26,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:26,905 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 03:43:26,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:26,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:26,924 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:43:26,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 03:43:26,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:26,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 03:43:26,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-28 03:43:26,925 INFO L87 Difference]: Start difference. First operand 60 states and 81 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:28,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:28,157 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2022-04-28 03:43:28,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 03:43:28,157 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 03:43:28,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:28,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:28,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 77 transitions. [2022-04-28 03:43:28,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:28,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 77 transitions. [2022-04-28 03:43:28,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 77 transitions. [2022-04-28 03:43:28,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:28,236 INFO L225 Difference]: With dead ends: 81 [2022-04-28 03:43:28,236 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 03:43:28,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 55 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2022-04-28 03:43:28,237 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 52 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:28,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 53 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:43:28,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 03:43:28,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 56. [2022-04-28 03:43:28,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:28,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 56 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:28,525 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 56 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:28,526 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 56 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:28,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:28,527 INFO L93 Difference]: Finished difference Result 70 states and 97 transitions. [2022-04-28 03:43:28,527 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 97 transitions. [2022-04-28 03:43:28,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:28,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:28,528 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 70 states. [2022-04-28 03:43:28,528 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 70 states. [2022-04-28 03:43:28,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:28,531 INFO L93 Difference]: Finished difference Result 70 states and 97 transitions. [2022-04-28 03:43:28,531 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 97 transitions. [2022-04-28 03:43:28,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:28,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:28,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:28,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:28,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:28,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 75 transitions. [2022-04-28 03:43:28,533 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 75 transitions. Word has length 26 [2022-04-28 03:43:28,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:28,533 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 75 transitions. [2022-04-28 03:43:28,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:28,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 75 transitions. [2022-04-28 03:43:33,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 73 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:33,561 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 75 transitions. [2022-04-28 03:43:33,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 03:43:33,562 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:33,562 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:33,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-28 03:43:33,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:33,762 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:33,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:33,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1041168377, now seen corresponding path program 3 times [2022-04-28 03:43:33,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:33,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [433273281] [2022-04-28 03:43:34,696 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:43:34,776 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:43:34,777 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:34,779 INFO L85 PathProgramCache]: Analyzing trace with hash 986375319, now seen corresponding path program 1 times [2022-04-28 03:43:34,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:34,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209225048] [2022-04-28 03:43:34,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:34,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:34,787 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_18.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:43:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:34,800 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_18.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:43:34,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:34,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {7932#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7924#true} is VALID [2022-04-28 03:43:34,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {7924#true} assume true; {7924#true} is VALID [2022-04-28 03:43:34,845 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7924#true} {7924#true} #94#return; {7924#true} is VALID [2022-04-28 03:43:34,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {7924#true} call ULTIMATE.init(); {7932#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:34,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {7932#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7924#true} is VALID [2022-04-28 03:43:34,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {7924#true} assume true; {7924#true} is VALID [2022-04-28 03:43:34,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7924#true} {7924#true} #94#return; {7924#true} is VALID [2022-04-28 03:43:34,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {7924#true} call #t~ret17 := main(); {7924#true} is VALID [2022-04-28 03:43:34,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {7924#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7924#true} is VALID [2022-04-28 03:43:34,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {7924#true} [132] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_193 v_main_~y~0_192)) (.cse1 (= v_main_~x~0_177 v_main_~x~0_176)) (.cse2 (= |v_main_#t~post5_89| |v_main_#t~post5_88|)) (.cse3 (= |v_main_#t~post6_89| |v_main_#t~post6_88|)) (.cse4 (mod v_main_~x~0_177 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and (forall ((v_it_18 Int)) (or (< 0 (mod (+ v_main_~x~0_177 (* 4294967295 v_it_18)) 4294967296)) (not (<= (+ v_main_~x~0_176 v_it_18 1) v_main_~x~0_177)) (not (<= 1 v_it_18)))) (= v_main_~y~0_192 (+ v_main_~x~0_177 v_main_~y~0_193 (* v_main_~x~0_176 (- 1)))) (< v_main_~x~0_176 v_main_~x~0_177) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_193, main_#t~post5=|v_main_#t~post5_89|, main_~x~0=v_main_~x~0_177, main_#t~post6=|v_main_#t~post6_89|} OutVars{main_~y~0=v_main_~y~0_192, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_176, main_#t~post6=|v_main_#t~post6_88|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7924#true} is VALID [2022-04-28 03:43:34,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {7924#true} [131] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7924#true} is VALID [2022-04-28 03:43:34,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {7924#true} ~z~0 := ~y~0; {7924#true} is VALID [2022-04-28 03:43:34,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {7924#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7924#true} is VALID [2022-04-28 03:43:34,846 INFO L290 TraceCheckUtils]: 10: Hoare triple {7924#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7924#true} is VALID [2022-04-28 03:43:34,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {7924#true} assume !(~z~0 % 4294967296 > 0); {7924#true} is VALID [2022-04-28 03:43:34,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {7924#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7924#true} is VALID [2022-04-28 03:43:34,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {7924#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7924#true} is VALID [2022-04-28 03:43:34,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {7924#true} assume !(~y~0 % 4294967296 > 0); {7929#(<= (* (div (+ main_~y~0 4294967295) 4294967296) 4294967296) main_~y~0)} is VALID [2022-04-28 03:43:34,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {7929#(<= (* (div (+ main_~y~0 4294967295) 4294967296) 4294967296) main_~y~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7930#(<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:43:34,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {7930#(<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7931#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 2) main_~y~0)} is VALID [2022-04-28 03:43:34,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {7931#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 2) main_~y~0)} assume !(~x~0 % 4294967296 > 0); {7931#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 2) main_~y~0)} is VALID [2022-04-28 03:43:34,849 INFO L290 TraceCheckUtils]: 18: Hoare triple {7931#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 2) main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7931#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 2) main_~y~0)} is VALID [2022-04-28 03:43:34,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {7931#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 2) main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7931#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 2) main_~y~0)} is VALID [2022-04-28 03:43:34,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {7931#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 2) main_~y~0)} assume !(~z~0 % 4294967296 > 0); {7931#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 2) main_~y~0)} is VALID [2022-04-28 03:43:34,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {7931#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 2) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {7925#false} is VALID [2022-04-28 03:43:34,851 INFO L272 TraceCheckUtils]: 22: Hoare triple {7925#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7925#false} is VALID [2022-04-28 03:43:34,851 INFO L290 TraceCheckUtils]: 23: Hoare triple {7925#false} ~cond := #in~cond; {7925#false} is VALID [2022-04-28 03:43:34,851 INFO L290 TraceCheckUtils]: 24: Hoare triple {7925#false} assume 0 == ~cond; {7925#false} is VALID [2022-04-28 03:43:34,851 INFO L290 TraceCheckUtils]: 25: Hoare triple {7925#false} assume !false; {7925#false} is VALID [2022-04-28 03:43:34,851 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 03:43:34,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:34,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209225048] [2022-04-28 03:43:34,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209225048] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:43:34,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781943507] [2022-04-28 03:43:34,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:34,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:34,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:34,852 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:43:34,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 03:43:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:34,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:43:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:34,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:43:35,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {7924#true} call ULTIMATE.init(); {7924#true} is VALID [2022-04-28 03:43:35,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {7924#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7924#true} is VALID [2022-04-28 03:43:35,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {7924#true} assume true; {7924#true} is VALID [2022-04-28 03:43:35,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7924#true} {7924#true} #94#return; {7924#true} is VALID [2022-04-28 03:43:35,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {7924#true} call #t~ret17 := main(); {7924#true} is VALID [2022-04-28 03:43:35,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {7924#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7924#true} is VALID [2022-04-28 03:43:35,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {7924#true} [132] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_193 v_main_~y~0_192)) (.cse1 (= v_main_~x~0_177 v_main_~x~0_176)) (.cse2 (= |v_main_#t~post5_89| |v_main_#t~post5_88|)) (.cse3 (= |v_main_#t~post6_89| |v_main_#t~post6_88|)) (.cse4 (mod v_main_~x~0_177 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and (forall ((v_it_18 Int)) (or (< 0 (mod (+ v_main_~x~0_177 (* 4294967295 v_it_18)) 4294967296)) (not (<= (+ v_main_~x~0_176 v_it_18 1) v_main_~x~0_177)) (not (<= 1 v_it_18)))) (= v_main_~y~0_192 (+ v_main_~x~0_177 v_main_~y~0_193 (* v_main_~x~0_176 (- 1)))) (< v_main_~x~0_176 v_main_~x~0_177) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_193, main_#t~post5=|v_main_#t~post5_89|, main_~x~0=v_main_~x~0_177, main_#t~post6=|v_main_#t~post6_89|} OutVars{main_~y~0=v_main_~y~0_192, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_176, main_#t~post6=|v_main_#t~post6_88|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7924#true} is VALID [2022-04-28 03:43:35,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {7924#true} [131] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7924#true} is VALID [2022-04-28 03:43:35,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {7924#true} ~z~0 := ~y~0; {7960#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:43:35,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {7960#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7964#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 03:43:35,058 INFO L290 TraceCheckUtils]: 10: Hoare triple {7964#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7968#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:35,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {7968#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {7968#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:35,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {7968#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7975#(and (= main_~z~0 main_~y~0) (< 0 (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-28 03:43:35,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {7975#(and (= main_~z~0 main_~y~0) (< 0 (mod (+ main_~y~0 1) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7979#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 03:43:35,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {7979#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !(~y~0 % 4294967296 > 0); {7979#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 03:43:35,061 INFO L290 TraceCheckUtils]: 15: Hoare triple {7979#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7986#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 03:43:35,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {7986#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7990#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:35,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {7990#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {7990#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:35,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {7990#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7990#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:35,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {7990#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7990#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:35,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {7990#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {7990#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:35,063 INFO L290 TraceCheckUtils]: 21: Hoare triple {7990#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {7925#false} is VALID [2022-04-28 03:43:35,063 INFO L272 TraceCheckUtils]: 22: Hoare triple {7925#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7925#false} is VALID [2022-04-28 03:43:35,063 INFO L290 TraceCheckUtils]: 23: Hoare triple {7925#false} ~cond := #in~cond; {7925#false} is VALID [2022-04-28 03:43:35,064 INFO L290 TraceCheckUtils]: 24: Hoare triple {7925#false} assume 0 == ~cond; {7925#false} is VALID [2022-04-28 03:43:35,064 INFO L290 TraceCheckUtils]: 25: Hoare triple {7925#false} assume !false; {7925#false} is VALID [2022-04-28 03:43:35,064 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:43:35,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:43:35,166 INFO L290 TraceCheckUtils]: 25: Hoare triple {7925#false} assume !false; {7925#false} is VALID [2022-04-28 03:43:35,166 INFO L290 TraceCheckUtils]: 24: Hoare triple {7925#false} assume 0 == ~cond; {7925#false} is VALID [2022-04-28 03:43:35,166 INFO L290 TraceCheckUtils]: 23: Hoare triple {7925#false} ~cond := #in~cond; {7925#false} is VALID [2022-04-28 03:43:35,166 INFO L272 TraceCheckUtils]: 22: Hoare triple {7925#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7925#false} is VALID [2022-04-28 03:43:35,166 INFO L290 TraceCheckUtils]: 21: Hoare triple {7990#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {7925#false} is VALID [2022-04-28 03:43:35,166 INFO L290 TraceCheckUtils]: 20: Hoare triple {7990#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {7990#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:35,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {7990#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7990#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:35,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {7990#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7990#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:35,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {7990#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {7990#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:35,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {7986#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7990#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:35,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {7979#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7986#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 03:43:35,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {7979#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !(~y~0 % 4294967296 > 0); {7979#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 03:43:35,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {7986#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7979#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 03:43:35,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {7990#(< 0 (mod main_~y~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7986#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 03:43:35,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {7990#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {7990#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:35,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {7990#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7990#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:35,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {8066#(or (<= (mod main_~z~0 4294967296) 0) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7990#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:35,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {7924#true} ~z~0 := ~y~0; {8066#(or (<= (mod main_~z~0 4294967296) 0) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:35,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {7924#true} [131] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7924#true} is VALID [2022-04-28 03:43:35,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {7924#true} [132] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_193 v_main_~y~0_192)) (.cse1 (= v_main_~x~0_177 v_main_~x~0_176)) (.cse2 (= |v_main_#t~post5_89| |v_main_#t~post5_88|)) (.cse3 (= |v_main_#t~post6_89| |v_main_#t~post6_88|)) (.cse4 (mod v_main_~x~0_177 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and (forall ((v_it_18 Int)) (or (< 0 (mod (+ v_main_~x~0_177 (* 4294967295 v_it_18)) 4294967296)) (not (<= (+ v_main_~x~0_176 v_it_18 1) v_main_~x~0_177)) (not (<= 1 v_it_18)))) (= v_main_~y~0_192 (+ v_main_~x~0_177 v_main_~y~0_193 (* v_main_~x~0_176 (- 1)))) (< v_main_~x~0_176 v_main_~x~0_177) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_193, main_#t~post5=|v_main_#t~post5_89|, main_~x~0=v_main_~x~0_177, main_#t~post6=|v_main_#t~post6_89|} OutVars{main_~y~0=v_main_~y~0_192, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_176, main_#t~post6=|v_main_#t~post6_88|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7924#true} is VALID [2022-04-28 03:43:35,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {7924#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7924#true} is VALID [2022-04-28 03:43:35,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {7924#true} call #t~ret17 := main(); {7924#true} is VALID [2022-04-28 03:43:35,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7924#true} {7924#true} #94#return; {7924#true} is VALID [2022-04-28 03:43:35,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {7924#true} assume true; {7924#true} is VALID [2022-04-28 03:43:35,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {7924#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7924#true} is VALID [2022-04-28 03:43:35,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {7924#true} call ULTIMATE.init(); {7924#true} is VALID [2022-04-28 03:43:35,172 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 03:43:35,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781943507] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:43:35,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:43:35,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 14 [2022-04-28 03:43:35,258 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:35,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [433273281] [2022-04-28 03:43:35,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [433273281] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:35,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:35,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:43:35,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496159523] [2022-04-28 03:43:35,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:35,259 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 03:43:35,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:35,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:35,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:35,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:43:35,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:35,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:43:35,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-04-28 03:43:35,280 INFO L87 Difference]: Start difference. First operand 56 states and 75 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:36,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:36,530 INFO L93 Difference]: Finished difference Result 97 states and 137 transitions. [2022-04-28 03:43:36,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 03:43:36,530 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 03:43:36,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:36,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:36,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 85 transitions. [2022-04-28 03:43:36,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:36,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 85 transitions. [2022-04-28 03:43:36,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 85 transitions. [2022-04-28 03:43:36,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:36,621 INFO L225 Difference]: With dead ends: 97 [2022-04-28 03:43:36,621 INFO L226 Difference]: Without dead ends: 92 [2022-04-28 03:43:36,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2022-04-28 03:43:36,621 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 73 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:36,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 39 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:43:36,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-28 03:43:36,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 62. [2022-04-28 03:43:36,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:36,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 62 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:36,991 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 62 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:36,991 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 62 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:36,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:36,992 INFO L93 Difference]: Finished difference Result 92 states and 130 transitions. [2022-04-28 03:43:36,992 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 130 transitions. [2022-04-28 03:43:37,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:37,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:37,003 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 92 states. [2022-04-28 03:43:37,004 INFO L87 Difference]: Start difference. First operand has 62 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 92 states. [2022-04-28 03:43:37,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:37,005 INFO L93 Difference]: Finished difference Result 92 states and 130 transitions. [2022-04-28 03:43:37,005 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 130 transitions. [2022-04-28 03:43:37,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:37,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:37,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:37,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:37,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:37,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 84 transitions. [2022-04-28 03:43:37,006 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 84 transitions. Word has length 27 [2022-04-28 03:43:37,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:37,006 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 84 transitions. [2022-04-28 03:43:37,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:37,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 84 transitions. [2022-04-28 03:43:43,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 81 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:43,571 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 84 transitions. [2022-04-28 03:43:43,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 03:43:43,572 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:43,572 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:43,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 03:43:43,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-04-28 03:43:43,772 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:43,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:43,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1238601096, now seen corresponding path program 3 times [2022-04-28 03:43:43,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:43,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [650656362] [2022-04-28 03:43:43,952 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:43:43,958 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:43,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1322784154, now seen corresponding path program 1 times [2022-04-28 03:43:43,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:43,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291164560] [2022-04-28 03:43:43,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:43,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:43,967 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_19.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:43:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:43,977 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_19.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:43:44,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:44,042 INFO L290 TraceCheckUtils]: 0: Hoare triple {8638#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8628#true} is VALID [2022-04-28 03:43:44,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {8628#true} assume true; {8628#true} is VALID [2022-04-28 03:43:44,043 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8628#true} {8628#true} #94#return; {8628#true} is VALID [2022-04-28 03:43:44,043 INFO L272 TraceCheckUtils]: 0: Hoare triple {8628#true} call ULTIMATE.init(); {8638#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:44,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {8638#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8628#true} is VALID [2022-04-28 03:43:44,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {8628#true} assume true; {8628#true} is VALID [2022-04-28 03:43:44,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8628#true} {8628#true} #94#return; {8628#true} is VALID [2022-04-28 03:43:44,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {8628#true} call #t~ret17 := main(); {8628#true} is VALID [2022-04-28 03:43:44,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {8628#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8628#true} is VALID [2022-04-28 03:43:44,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {8628#true} [134] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_209 v_main_~y~0_208)) (.cse1 (= |v_main_#t~post5_94| |v_main_#t~post5_93|)) (.cse3 (= v_main_~x~0_191 v_main_~x~0_190)) (.cse4 (= |v_main_#t~post6_94| |v_main_#t~post6_93|)) (.cse2 (mod v_main_~x~0_191 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (< v_main_~x~0_190 v_main_~x~0_191) (= v_main_~y~0_208 (+ v_main_~x~0_191 v_main_~y~0_209 (* v_main_~x~0_190 (- 1)))) (forall ((v_it_19 Int)) (or (not (<= (+ v_main_~x~0_190 v_it_19 1) v_main_~x~0_191)) (< 0 (mod (+ v_main_~x~0_191 (* 4294967295 v_it_19)) 4294967296)) (not (<= 1 v_it_19)))) (< 0 .cse2)))) InVars {main_~y~0=v_main_~y~0_209, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_191, main_#t~post6=|v_main_#t~post6_94|} OutVars{main_~y~0=v_main_~y~0_208, main_#t~post5=|v_main_#t~post5_93|, main_~x~0=v_main_~x~0_190, main_#t~post6=|v_main_#t~post6_93|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8628#true} is VALID [2022-04-28 03:43:44,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {8628#true} [133] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {8633#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:43:44,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {8633#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {8633#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:43:44,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {8633#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8634#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:43:44,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {8634#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8635#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:44,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {8635#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8636#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:44,047 INFO L290 TraceCheckUtils]: 12: Hoare triple {8636#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8636#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:44,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {8636#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8636#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:44,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {8636#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8636#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:44,048 INFO L290 TraceCheckUtils]: 15: Hoare triple {8636#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8636#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:44,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {8636#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {8636#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:44,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {8636#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8637#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:43:44,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {8637#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {8629#false} is VALID [2022-04-28 03:43:44,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {8629#false} assume !(~z~0 % 4294967296 > 0); {8629#false} is VALID [2022-04-28 03:43:44,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {8629#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {8629#false} is VALID [2022-04-28 03:43:44,050 INFO L290 TraceCheckUtils]: 21: Hoare triple {8629#false} assume !(~y~0 % 4294967296 > 0); {8629#false} is VALID [2022-04-28 03:43:44,050 INFO L272 TraceCheckUtils]: 22: Hoare triple {8629#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8629#false} is VALID [2022-04-28 03:43:44,050 INFO L290 TraceCheckUtils]: 23: Hoare triple {8629#false} ~cond := #in~cond; {8629#false} is VALID [2022-04-28 03:43:44,050 INFO L290 TraceCheckUtils]: 24: Hoare triple {8629#false} assume 0 == ~cond; {8629#false} is VALID [2022-04-28 03:43:44,051 INFO L290 TraceCheckUtils]: 25: Hoare triple {8629#false} assume !false; {8629#false} is VALID [2022-04-28 03:43:44,051 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-28 03:43:44,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:44,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291164560] [2022-04-28 03:43:44,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291164560] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:43:44,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183714931] [2022-04-28 03:43:44,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:44,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:44,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:44,052 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:43:44,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 03:43:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:44,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:43:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:44,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:43:44,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {8628#true} call ULTIMATE.init(); {8628#true} is VALID [2022-04-28 03:43:44,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {8628#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8628#true} is VALID [2022-04-28 03:43:44,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {8628#true} assume true; {8628#true} is VALID [2022-04-28 03:43:44,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8628#true} {8628#true} #94#return; {8628#true} is VALID [2022-04-28 03:43:44,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {8628#true} call #t~ret17 := main(); {8628#true} is VALID [2022-04-28 03:43:44,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {8628#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8628#true} is VALID [2022-04-28 03:43:44,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {8628#true} [134] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_209 v_main_~y~0_208)) (.cse1 (= |v_main_#t~post5_94| |v_main_#t~post5_93|)) (.cse3 (= v_main_~x~0_191 v_main_~x~0_190)) (.cse4 (= |v_main_#t~post6_94| |v_main_#t~post6_93|)) (.cse2 (mod v_main_~x~0_191 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (< v_main_~x~0_190 v_main_~x~0_191) (= v_main_~y~0_208 (+ v_main_~x~0_191 v_main_~y~0_209 (* v_main_~x~0_190 (- 1)))) (forall ((v_it_19 Int)) (or (not (<= (+ v_main_~x~0_190 v_it_19 1) v_main_~x~0_191)) (< 0 (mod (+ v_main_~x~0_191 (* 4294967295 v_it_19)) 4294967296)) (not (<= 1 v_it_19)))) (< 0 .cse2)))) InVars {main_~y~0=v_main_~y~0_209, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_191, main_#t~post6=|v_main_#t~post6_94|} OutVars{main_~y~0=v_main_~y~0_208, main_#t~post5=|v_main_#t~post5_93|, main_~x~0=v_main_~x~0_190, main_#t~post6=|v_main_#t~post6_93|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8628#true} is VALID [2022-04-28 03:43:44,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {8628#true} [133] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {8628#true} is VALID [2022-04-28 03:43:44,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {8628#true} ~z~0 := ~y~0; {8666#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:43:44,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {8666#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8670#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 03:43:44,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {8670#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8674#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= main_~y~0 (+ main_~z~0 2)))} is VALID [2022-04-28 03:43:44,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {8674#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= main_~y~0 (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8678#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:44,259 INFO L290 TraceCheckUtils]: 12: Hoare triple {8678#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8678#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:44,259 INFO L290 TraceCheckUtils]: 13: Hoare triple {8678#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8685#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= main_~z~0 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 03:43:44,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {8685#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= main_~z~0 (+ (- 1) main_~y~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8689#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:43:44,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {8689#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8693#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:43:44,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {8693#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {8693#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:43:44,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {8693#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8693#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:43:44,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {8693#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {8693#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:43:44,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {8693#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {8629#false} is VALID [2022-04-28 03:43:44,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {8629#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {8629#false} is VALID [2022-04-28 03:43:44,262 INFO L290 TraceCheckUtils]: 21: Hoare triple {8629#false} assume !(~y~0 % 4294967296 > 0); {8629#false} is VALID [2022-04-28 03:43:44,262 INFO L272 TraceCheckUtils]: 22: Hoare triple {8629#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8629#false} is VALID [2022-04-28 03:43:44,262 INFO L290 TraceCheckUtils]: 23: Hoare triple {8629#false} ~cond := #in~cond; {8629#false} is VALID [2022-04-28 03:43:44,262 INFO L290 TraceCheckUtils]: 24: Hoare triple {8629#false} assume 0 == ~cond; {8629#false} is VALID [2022-04-28 03:43:44,262 INFO L290 TraceCheckUtils]: 25: Hoare triple {8629#false} assume !false; {8629#false} is VALID [2022-04-28 03:43:44,262 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:43:44,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:43:44,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {8629#false} assume !false; {8629#false} is VALID [2022-04-28 03:43:44,372 INFO L290 TraceCheckUtils]: 24: Hoare triple {8629#false} assume 0 == ~cond; {8629#false} is VALID [2022-04-28 03:43:44,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {8629#false} ~cond := #in~cond; {8629#false} is VALID [2022-04-28 03:43:44,373 INFO L272 TraceCheckUtils]: 22: Hoare triple {8629#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8629#false} is VALID [2022-04-28 03:43:44,373 INFO L290 TraceCheckUtils]: 21: Hoare triple {8629#false} assume !(~y~0 % 4294967296 > 0); {8629#false} is VALID [2022-04-28 03:43:44,373 INFO L290 TraceCheckUtils]: 20: Hoare triple {8629#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {8629#false} is VALID [2022-04-28 03:43:44,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {8693#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {8629#false} is VALID [2022-04-28 03:43:44,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {8693#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {8693#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:43:44,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {8693#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8693#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:43:44,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {8693#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {8693#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:43:44,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {8689#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8693#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:43:44,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {8757#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8689#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:43:44,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {8761#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8757#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:43:44,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {8761#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !(~z~0 % 4294967296 > 0); {8761#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 03:43:44,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {8757#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8761#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 03:43:44,378 INFO L290 TraceCheckUtils]: 10: Hoare triple {8689#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8757#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:43:44,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {8628#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8689#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:43:44,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {8628#true} ~z~0 := ~y~0; {8628#true} is VALID [2022-04-28 03:43:44,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {8628#true} [133] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {8628#true} is VALID [2022-04-28 03:43:44,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {8628#true} [134] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_209 v_main_~y~0_208)) (.cse1 (= |v_main_#t~post5_94| |v_main_#t~post5_93|)) (.cse3 (= v_main_~x~0_191 v_main_~x~0_190)) (.cse4 (= |v_main_#t~post6_94| |v_main_#t~post6_93|)) (.cse2 (mod v_main_~x~0_191 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (< v_main_~x~0_190 v_main_~x~0_191) (= v_main_~y~0_208 (+ v_main_~x~0_191 v_main_~y~0_209 (* v_main_~x~0_190 (- 1)))) (forall ((v_it_19 Int)) (or (not (<= (+ v_main_~x~0_190 v_it_19 1) v_main_~x~0_191)) (< 0 (mod (+ v_main_~x~0_191 (* 4294967295 v_it_19)) 4294967296)) (not (<= 1 v_it_19)))) (< 0 .cse2)))) InVars {main_~y~0=v_main_~y~0_209, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_191, main_#t~post6=|v_main_#t~post6_94|} OutVars{main_~y~0=v_main_~y~0_208, main_#t~post5=|v_main_#t~post5_93|, main_~x~0=v_main_~x~0_190, main_#t~post6=|v_main_#t~post6_93|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8628#true} is VALID [2022-04-28 03:43:44,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {8628#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8628#true} is VALID [2022-04-28 03:43:44,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {8628#true} call #t~ret17 := main(); {8628#true} is VALID [2022-04-28 03:43:44,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8628#true} {8628#true} #94#return; {8628#true} is VALID [2022-04-28 03:43:44,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {8628#true} assume true; {8628#true} is VALID [2022-04-28 03:43:44,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {8628#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8628#true} is VALID [2022-04-28 03:43:44,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {8628#true} call ULTIMATE.init(); {8628#true} is VALID [2022-04-28 03:43:44,380 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:43:44,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183714931] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:43:44,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:43:44,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 6] total 17 [2022-04-28 03:43:44,435 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:44,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [650656362] [2022-04-28 03:43:44,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [650656362] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:44,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:44,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:43:44,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539966224] [2022-04-28 03:43:44,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:44,436 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 03:43:44,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:44,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:44,454 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:43:44,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:43:44,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:44,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:43:44,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-04-28 03:43:44,455 INFO L87 Difference]: Start difference. First operand 62 states and 84 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:46,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:46,295 INFO L93 Difference]: Finished difference Result 175 states and 255 transitions. [2022-04-28 03:43:46,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 03:43:46,295 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 03:43:46,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:46,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:46,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 107 transitions. [2022-04-28 03:43:46,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:46,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 107 transitions. [2022-04-28 03:43:46,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 107 transitions. [2022-04-28 03:43:46,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:46,401 INFO L225 Difference]: With dead ends: 175 [2022-04-28 03:43:46,401 INFO L226 Difference]: Without dead ends: 152 [2022-04-28 03:43:46,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2022-04-28 03:43:46,401 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 121 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:46,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 65 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:43:46,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-04-28 03:43:46,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 75. [2022-04-28 03:43:46,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:46,831 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand has 75 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 70 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:46,831 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand has 75 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 70 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:46,831 INFO L87 Difference]: Start difference. First operand 152 states. Second operand has 75 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 70 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:46,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:46,833 INFO L93 Difference]: Finished difference Result 152 states and 218 transitions. [2022-04-28 03:43:46,833 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 218 transitions. [2022-04-28 03:43:46,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:46,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:46,833 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 70 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 152 states. [2022-04-28 03:43:46,834 INFO L87 Difference]: Start difference. First operand has 75 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 70 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 152 states. [2022-04-28 03:43:46,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:46,835 INFO L93 Difference]: Finished difference Result 152 states and 218 transitions. [2022-04-28 03:43:46,835 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 218 transitions. [2022-04-28 03:43:46,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:46,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:46,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:46,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:46,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 70 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:46,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 100 transitions. [2022-04-28 03:43:46,837 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 100 transitions. Word has length 27 [2022-04-28 03:43:46,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:46,837 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 100 transitions. [2022-04-28 03:43:46,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:46,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 100 transitions. [2022-04-28 03:43:51,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 98 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:51,833 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 100 transitions. [2022-04-28 03:43:51,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 03:43:51,833 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:51,833 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:51,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 03:43:52,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:52,034 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:52,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:52,034 INFO L85 PathProgramCache]: Analyzing trace with hash -2049023563, now seen corresponding path program 2 times [2022-04-28 03:43:52,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:52,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [775930426] [2022-04-28 03:43:52,240 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:43:52,242 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:52,243 INFO L85 PathProgramCache]: Analyzing trace with hash -242534313, now seen corresponding path program 1 times [2022-04-28 03:43:52,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:52,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107050535] [2022-04-28 03:43:52,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:52,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:52,251 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_20.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:43:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:52,263 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_20.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:43:52,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:52,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {9635#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9627#true} is VALID [2022-04-28 03:43:52,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {9627#true} assume true; {9627#true} is VALID [2022-04-28 03:43:52,311 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9627#true} {9627#true} #94#return; {9627#true} is VALID [2022-04-28 03:43:52,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {9627#true} call ULTIMATE.init(); {9635#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:52,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {9635#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9627#true} is VALID [2022-04-28 03:43:52,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {9627#true} assume true; {9627#true} is VALID [2022-04-28 03:43:52,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9627#true} {9627#true} #94#return; {9627#true} is VALID [2022-04-28 03:43:52,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {9627#true} call #t~ret17 := main(); {9627#true} is VALID [2022-04-28 03:43:52,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {9627#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9627#true} is VALID [2022-04-28 03:43:52,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {9627#true} [136] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_203 v_main_~x~0_202)) (.cse1 (= |v_main_#t~post5_99| |v_main_#t~post5_98|)) (.cse2 (= |v_main_#t~post6_99| |v_main_#t~post6_98|)) (.cse3 (= v_main_~y~0_224 v_main_~y~0_223)) (.cse4 (mod v_main_~x~0_203 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_20 Int)) (or (< 0 (mod (+ v_main_~x~0_203 (* 4294967295 v_it_20)) 4294967296)) (not (<= 1 v_it_20)) (not (<= (+ v_main_~x~0_202 v_it_20 1) v_main_~x~0_203)))) (< v_main_~x~0_202 v_main_~x~0_203) (= v_main_~y~0_223 (+ v_main_~x~0_203 v_main_~y~0_224 (* v_main_~x~0_202 (- 1)))) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_224, main_#t~post5=|v_main_#t~post5_99|, main_~x~0=v_main_~x~0_203, main_#t~post6=|v_main_#t~post6_99|} OutVars{main_~y~0=v_main_~y~0_223, main_#t~post5=|v_main_#t~post5_98|, main_~x~0=v_main_~x~0_202, main_#t~post6=|v_main_#t~post6_98|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9627#true} is VALID [2022-04-28 03:43:52,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {9627#true} [135] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {9627#true} is VALID [2022-04-28 03:43:52,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {9627#true} ~z~0 := ~y~0; {9627#true} is VALID [2022-04-28 03:43:52,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {9627#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9627#true} is VALID [2022-04-28 03:43:52,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {9627#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9627#true} is VALID [2022-04-28 03:43:52,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {9627#true} assume !(~z~0 % 4294967296 > 0); {9627#true} is VALID [2022-04-28 03:43:52,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {9627#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9627#true} is VALID [2022-04-28 03:43:52,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {9627#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9632#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-28 03:43:52,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {9632#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !(~y~0 % 4294967296 > 0); {9632#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-28 03:43:52,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {9632#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9633#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:43:52,316 INFO L290 TraceCheckUtils]: 16: Hoare triple {9633#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:43:52,317 INFO L290 TraceCheckUtils]: 17: Hoare triple {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:43:52,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:43:52,317 INFO L290 TraceCheckUtils]: 19: Hoare triple {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:43:52,318 INFO L290 TraceCheckUtils]: 20: Hoare triple {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:43:52,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {9633#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:43:52,319 INFO L290 TraceCheckUtils]: 22: Hoare triple {9633#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {9628#false} is VALID [2022-04-28 03:43:52,320 INFO L272 TraceCheckUtils]: 23: Hoare triple {9628#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9628#false} is VALID [2022-04-28 03:43:52,320 INFO L290 TraceCheckUtils]: 24: Hoare triple {9628#false} ~cond := #in~cond; {9628#false} is VALID [2022-04-28 03:43:52,320 INFO L290 TraceCheckUtils]: 25: Hoare triple {9628#false} assume 0 == ~cond; {9628#false} is VALID [2022-04-28 03:43:52,320 INFO L290 TraceCheckUtils]: 26: Hoare triple {9628#false} assume !false; {9628#false} is VALID [2022-04-28 03:43:52,320 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-28 03:43:52,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:52,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107050535] [2022-04-28 03:43:52,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107050535] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:43:52,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218841718] [2022-04-28 03:43:52,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:52,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:52,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:52,321 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:43:52,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 03:43:52,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:52,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 03:43:52,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:52,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:43:52,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {9627#true} call ULTIMATE.init(); {9627#true} is VALID [2022-04-28 03:43:52,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {9627#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9627#true} is VALID [2022-04-28 03:43:52,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {9627#true} assume true; {9627#true} is VALID [2022-04-28 03:43:52,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9627#true} {9627#true} #94#return; {9627#true} is VALID [2022-04-28 03:43:52,573 INFO L272 TraceCheckUtils]: 4: Hoare triple {9627#true} call #t~ret17 := main(); {9627#true} is VALID [2022-04-28 03:43:52,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {9627#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9627#true} is VALID [2022-04-28 03:43:52,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {9627#true} [136] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_203 v_main_~x~0_202)) (.cse1 (= |v_main_#t~post5_99| |v_main_#t~post5_98|)) (.cse2 (= |v_main_#t~post6_99| |v_main_#t~post6_98|)) (.cse3 (= v_main_~y~0_224 v_main_~y~0_223)) (.cse4 (mod v_main_~x~0_203 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_20 Int)) (or (< 0 (mod (+ v_main_~x~0_203 (* 4294967295 v_it_20)) 4294967296)) (not (<= 1 v_it_20)) (not (<= (+ v_main_~x~0_202 v_it_20 1) v_main_~x~0_203)))) (< v_main_~x~0_202 v_main_~x~0_203) (= v_main_~y~0_223 (+ v_main_~x~0_203 v_main_~y~0_224 (* v_main_~x~0_202 (- 1)))) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_224, main_#t~post5=|v_main_#t~post5_99|, main_~x~0=v_main_~x~0_203, main_#t~post6=|v_main_#t~post6_99|} OutVars{main_~y~0=v_main_~y~0_223, main_#t~post5=|v_main_#t~post5_98|, main_~x~0=v_main_~x~0_202, main_#t~post6=|v_main_#t~post6_98|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9627#true} is VALID [2022-04-28 03:43:52,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {9627#true} [135] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {9627#true} is VALID [2022-04-28 03:43:52,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {9627#true} ~z~0 := ~y~0; {9663#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:43:52,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {9663#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9667#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:43:52,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {9667#(= main_~y~0 (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9671#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:43:52,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {9671#(= main_~y~0 (+ main_~z~0 2))} assume !(~z~0 % 4294967296 > 0); {9671#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:43:52,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {9671#(= main_~y~0 (+ main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9663#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:43:52,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {9663#(= main_~z~0 main_~y~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9681#(= (+ (- 1) main_~z~0) (+ main_~y~0 1))} is VALID [2022-04-28 03:43:52,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {9681#(= (+ (- 1) main_~z~0) (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {9681#(= (+ (- 1) main_~z~0) (+ main_~y~0 1))} is VALID [2022-04-28 03:43:52,577 INFO L290 TraceCheckUtils]: 15: Hoare triple {9681#(= (+ (- 1) main_~z~0) (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9688#(= main_~y~0 (+ (- 1) main_~z~0))} is VALID [2022-04-28 03:43:52,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {9688#(= main_~y~0 (+ (- 1) main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9663#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:43:52,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {9663#(= main_~z~0 main_~y~0)} assume !(~x~0 % 4294967296 > 0); {9663#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:43:52,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {9663#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9667#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:43:52,579 INFO L290 TraceCheckUtils]: 19: Hoare triple {9667#(= main_~y~0 (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:43:52,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:43:52,580 INFO L290 TraceCheckUtils]: 21: Hoare triple {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {9633#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:43:52,580 INFO L290 TraceCheckUtils]: 22: Hoare triple {9633#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {9628#false} is VALID [2022-04-28 03:43:52,581 INFO L272 TraceCheckUtils]: 23: Hoare triple {9628#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9628#false} is VALID [2022-04-28 03:43:52,581 INFO L290 TraceCheckUtils]: 24: Hoare triple {9628#false} ~cond := #in~cond; {9628#false} is VALID [2022-04-28 03:43:52,581 INFO L290 TraceCheckUtils]: 25: Hoare triple {9628#false} assume 0 == ~cond; {9628#false} is VALID [2022-04-28 03:43:52,581 INFO L290 TraceCheckUtils]: 26: Hoare triple {9628#false} assume !false; {9628#false} is VALID [2022-04-28 03:43:52,581 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:43:52,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:43:52,980 INFO L290 TraceCheckUtils]: 26: Hoare triple {9628#false} assume !false; {9628#false} is VALID [2022-04-28 03:43:52,980 INFO L290 TraceCheckUtils]: 25: Hoare triple {9628#false} assume 0 == ~cond; {9628#false} is VALID [2022-04-28 03:43:52,980 INFO L290 TraceCheckUtils]: 24: Hoare triple {9628#false} ~cond := #in~cond; {9628#false} is VALID [2022-04-28 03:43:52,980 INFO L272 TraceCheckUtils]: 23: Hoare triple {9628#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9628#false} is VALID [2022-04-28 03:43:52,981 INFO L290 TraceCheckUtils]: 22: Hoare triple {9633#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {9628#false} is VALID [2022-04-28 03:43:52,982 INFO L290 TraceCheckUtils]: 21: Hoare triple {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {9633#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:43:52,982 INFO L290 TraceCheckUtils]: 20: Hoare triple {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:43:52,983 INFO L290 TraceCheckUtils]: 19: Hoare triple {9743#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:43:52,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {9747#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9743#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:43:52,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {9747#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {9747#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:52,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {9754#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9747#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:52,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {9758#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9754#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)))))} is VALID [2022-04-28 03:43:52,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {9758#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294)))} assume !(~y~0 % 4294967296 > 0); {9758#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294)))} is VALID [2022-04-28 03:43:52,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {9765#(or (<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9758#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294)))} is VALID [2022-04-28 03:43:52,991 INFO L290 TraceCheckUtils]: 12: Hoare triple {9769#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (not (< 0 (mod (+ main_~z~0 1) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9765#(or (<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:43:52,991 INFO L290 TraceCheckUtils]: 11: Hoare triple {9769#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (not (< 0 (mod (+ main_~z~0 1) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {9769#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (not (< 0 (mod (+ main_~z~0 1) 4294967296))))} is VALID [2022-04-28 03:43:52,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {9743#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9769#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (not (< 0 (mod (+ main_~z~0 1) 4294967296))))} is VALID [2022-04-28 03:43:52,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {9747#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9743#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:43:52,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {9627#true} ~z~0 := ~y~0; {9747#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:52,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {9627#true} [135] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {9627#true} is VALID [2022-04-28 03:43:52,994 INFO L290 TraceCheckUtils]: 6: Hoare triple {9627#true} [136] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_203 v_main_~x~0_202)) (.cse1 (= |v_main_#t~post5_99| |v_main_#t~post5_98|)) (.cse2 (= |v_main_#t~post6_99| |v_main_#t~post6_98|)) (.cse3 (= v_main_~y~0_224 v_main_~y~0_223)) (.cse4 (mod v_main_~x~0_203 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_20 Int)) (or (< 0 (mod (+ v_main_~x~0_203 (* 4294967295 v_it_20)) 4294967296)) (not (<= 1 v_it_20)) (not (<= (+ v_main_~x~0_202 v_it_20 1) v_main_~x~0_203)))) (< v_main_~x~0_202 v_main_~x~0_203) (= v_main_~y~0_223 (+ v_main_~x~0_203 v_main_~y~0_224 (* v_main_~x~0_202 (- 1)))) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_224, main_#t~post5=|v_main_#t~post5_99|, main_~x~0=v_main_~x~0_203, main_#t~post6=|v_main_#t~post6_99|} OutVars{main_~y~0=v_main_~y~0_223, main_#t~post5=|v_main_#t~post5_98|, main_~x~0=v_main_~x~0_202, main_#t~post6=|v_main_#t~post6_98|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9627#true} is VALID [2022-04-28 03:43:52,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {9627#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9627#true} is VALID [2022-04-28 03:43:52,994 INFO L272 TraceCheckUtils]: 4: Hoare triple {9627#true} call #t~ret17 := main(); {9627#true} is VALID [2022-04-28 03:43:52,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9627#true} {9627#true} #94#return; {9627#true} is VALID [2022-04-28 03:43:52,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {9627#true} assume true; {9627#true} is VALID [2022-04-28 03:43:52,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {9627#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9627#true} is VALID [2022-04-28 03:43:52,994 INFO L272 TraceCheckUtils]: 0: Hoare triple {9627#true} call ULTIMATE.init(); {9627#true} is VALID [2022-04-28 03:43:52,994 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:43:52,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218841718] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:43:52,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:43:52,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 10] total 17 [2022-04-28 03:43:53,047 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:53,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [775930426] [2022-04-28 03:43:53,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [775930426] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:53,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:53,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:43:53,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552858826] [2022-04-28 03:43:53,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:53,048 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 03:43:53,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:53,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:53,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:53,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:43:53,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:53,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:43:53,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2022-04-28 03:43:53,069 INFO L87 Difference]: Start difference. First operand 75 states and 100 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:54,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:54,703 INFO L93 Difference]: Finished difference Result 125 states and 172 transitions. [2022-04-28 03:43:54,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 03:43:54,703 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 03:43:54,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:54,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:54,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 96 transitions. [2022-04-28 03:43:54,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:54,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 96 transitions. [2022-04-28 03:43:54,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 96 transitions. [2022-04-28 03:43:54,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:54,813 INFO L225 Difference]: With dead ends: 125 [2022-04-28 03:43:54,813 INFO L226 Difference]: Without dead ends: 120 [2022-04-28 03:43:54,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=1028, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 03:43:54,814 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 69 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:54,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 39 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:43:54,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-28 03:43:55,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 76. [2022-04-28 03:43:55,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:55,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 76 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 71 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:55,261 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 76 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 71 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:55,261 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 76 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 71 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:55,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:55,262 INFO L93 Difference]: Finished difference Result 120 states and 165 transitions. [2022-04-28 03:43:55,262 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 165 transitions. [2022-04-28 03:43:55,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:55,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:55,263 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 71 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 120 states. [2022-04-28 03:43:55,263 INFO L87 Difference]: Start difference. First operand has 76 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 71 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 120 states. [2022-04-28 03:43:55,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:55,264 INFO L93 Difference]: Finished difference Result 120 states and 165 transitions. [2022-04-28 03:43:55,264 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 165 transitions. [2022-04-28 03:43:55,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:55,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:55,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:55,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:55,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 71 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:55,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 101 transitions. [2022-04-28 03:43:55,265 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 101 transitions. Word has length 28 [2022-04-28 03:43:55,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:55,265 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 101 transitions. [2022-04-28 03:43:55,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:55,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 101 transitions. [2022-04-28 03:44:00,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 99 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:00,712 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 101 transitions. [2022-04-28 03:44:00,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 03:44:00,713 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:44:00,713 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:44:00,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-28 03:44:00,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:00,913 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:44:00,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:44:00,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1753627142, now seen corresponding path program 4 times [2022-04-28 03:44:00,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:00,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [472279886] [2022-04-28 03:44:01,075 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:44:01,076 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:44:01,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1129797528, now seen corresponding path program 1 times [2022-04-28 03:44:01,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:44:01,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711600407] [2022-04-28 03:44:01,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:01,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:44:01,087 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_21.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:44:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:01,114 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_21.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:44:01,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:44:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:01,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {10506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10494#true} is VALID [2022-04-28 03:44:01,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {10494#true} assume true; {10494#true} is VALID [2022-04-28 03:44:01,217 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10494#true} {10494#true} #94#return; {10494#true} is VALID [2022-04-28 03:44:01,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {10494#true} call ULTIMATE.init(); {10506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:44:01,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {10506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10494#true} is VALID [2022-04-28 03:44:01,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {10494#true} assume true; {10494#true} is VALID [2022-04-28 03:44:01,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10494#true} {10494#true} #94#return; {10494#true} is VALID [2022-04-28 03:44:01,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {10494#true} call #t~ret17 := main(); {10494#true} is VALID [2022-04-28 03:44:01,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {10494#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10494#true} is VALID [2022-04-28 03:44:01,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {10494#true} [138] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_217 v_main_~x~0_216)) (.cse1 (= v_main_~y~0_242 v_main_~y~0_241)) (.cse2 (= |v_main_#t~post5_104| |v_main_#t~post5_103|)) (.cse3 (= |v_main_#t~post6_104| |v_main_#t~post6_103|)) (.cse4 (mod v_main_~x~0_217 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3) (and (forall ((v_it_21 Int)) (or (not (<= 1 v_it_21)) (< 0 (mod (+ v_main_~x~0_217 (* 4294967295 v_it_21)) 4294967296)) (not (<= (+ v_main_~y~0_242 v_it_21 1) v_main_~y~0_241)))) (< 0 .cse4) (= v_main_~x~0_216 (+ v_main_~x~0_217 v_main_~y~0_242 (* (- 1) v_main_~y~0_241))) (< v_main_~y~0_242 v_main_~y~0_241)))) InVars {main_~y~0=v_main_~y~0_242, main_#t~post5=|v_main_#t~post5_104|, main_~x~0=v_main_~x~0_217, main_#t~post6=|v_main_#t~post6_104|} OutVars{main_~y~0=v_main_~y~0_241, main_#t~post5=|v_main_#t~post5_103|, main_~x~0=v_main_~x~0_216, main_#t~post6=|v_main_#t~post6_103|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10494#true} is VALID [2022-04-28 03:44:01,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {10494#true} [137] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {10494#true} is VALID [2022-04-28 03:44:01,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {10494#true} ~z~0 := ~y~0; {10499#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:44:01,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {10499#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10500#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:44:01,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {10500#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10501#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967296)) (or (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296)) (<= (+ main_~z~0 2) main_~y~0)))} is VALID [2022-04-28 03:44:01,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {10501#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967296)) (or (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296)) (<= (+ main_~z~0 2) main_~y~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10502#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (* (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 (* (- 1) main_~y~0) 4294967298) 4294967296) 4294967296) main_~z~0))} is VALID [2022-04-28 03:44:01,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {10502#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (* (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 (* (- 1) main_~y~0) 4294967298) 4294967296) 4294967296) main_~z~0))} assume !(~z~0 % 4294967296 > 0); {10502#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (* (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 (* (- 1) main_~y~0) 4294967298) 4294967296) 4294967296) main_~z~0))} is VALID [2022-04-28 03:44:01,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {10502#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (* (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 (* (- 1) main_~y~0) 4294967298) 4294967296) 4294967296) main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10503#(<= (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:44:01,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {10503#(<= (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) 1) main_~z~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10504#(<= (+ 2 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:44:01,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {10504#(<= (+ 2 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) main_~z~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10505#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:44:01,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {10505#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {10505#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:44:01,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {10505#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10505#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:44:01,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {10505#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10505#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:44:01,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {10505#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10505#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:44:01,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {10505#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {10505#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:44:01,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {10505#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {10495#false} is VALID [2022-04-28 03:44:01,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {10495#false} assume !(~y~0 % 4294967296 > 0); {10495#false} is VALID [2022-04-28 03:44:01,227 INFO L272 TraceCheckUtils]: 23: Hoare triple {10495#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10495#false} is VALID [2022-04-28 03:44:01,227 INFO L290 TraceCheckUtils]: 24: Hoare triple {10495#false} ~cond := #in~cond; {10495#false} is VALID [2022-04-28 03:44:01,227 INFO L290 TraceCheckUtils]: 25: Hoare triple {10495#false} assume 0 == ~cond; {10495#false} is VALID [2022-04-28 03:44:01,227 INFO L290 TraceCheckUtils]: 26: Hoare triple {10495#false} assume !false; {10495#false} is VALID [2022-04-28 03:44:01,227 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:44:01,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:44:01,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711600407] [2022-04-28 03:44:01,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711600407] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:44:01,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62884298] [2022-04-28 03:44:01,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:01,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:01,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:44:01,228 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:44:01,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 03:44:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:01,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 03:44:01,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:01,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:44:01,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {10494#true} call ULTIMATE.init(); {10494#true} is VALID [2022-04-28 03:44:01,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {10494#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10494#true} is VALID [2022-04-28 03:44:01,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {10494#true} assume true; {10494#true} is VALID [2022-04-28 03:44:01,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10494#true} {10494#true} #94#return; {10494#true} is VALID [2022-04-28 03:44:01,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {10494#true} call #t~ret17 := main(); {10494#true} is VALID [2022-04-28 03:44:01,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {10494#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10494#true} is VALID [2022-04-28 03:44:01,389 INFO L290 TraceCheckUtils]: 6: Hoare triple {10494#true} [138] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_217 v_main_~x~0_216)) (.cse1 (= v_main_~y~0_242 v_main_~y~0_241)) (.cse2 (= |v_main_#t~post5_104| |v_main_#t~post5_103|)) (.cse3 (= |v_main_#t~post6_104| |v_main_#t~post6_103|)) (.cse4 (mod v_main_~x~0_217 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3) (and (forall ((v_it_21 Int)) (or (not (<= 1 v_it_21)) (< 0 (mod (+ v_main_~x~0_217 (* 4294967295 v_it_21)) 4294967296)) (not (<= (+ v_main_~y~0_242 v_it_21 1) v_main_~y~0_241)))) (< 0 .cse4) (= v_main_~x~0_216 (+ v_main_~x~0_217 v_main_~y~0_242 (* (- 1) v_main_~y~0_241))) (< v_main_~y~0_242 v_main_~y~0_241)))) InVars {main_~y~0=v_main_~y~0_242, main_#t~post5=|v_main_#t~post5_104|, main_~x~0=v_main_~x~0_217, main_#t~post6=|v_main_#t~post6_104|} OutVars{main_~y~0=v_main_~y~0_241, main_#t~post5=|v_main_#t~post5_103|, main_~x~0=v_main_~x~0_216, main_#t~post6=|v_main_#t~post6_103|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10494#true} is VALID [2022-04-28 03:44:01,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {10494#true} [137] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {10494#true} is VALID [2022-04-28 03:44:01,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {10494#true} ~z~0 := ~y~0; {10499#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:44:01,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {10499#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10500#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:44:01,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {10500#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10540#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:44:01,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {10540#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10544#(= (+ main_~z~0 2) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:44:01,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {10544#(= (+ main_~z~0 2) (+ (- 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {10544#(= (+ main_~z~0 2) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:44:01,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {10544#(= (+ main_~z~0 2) (+ (- 1) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10551#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:44:01,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {10551#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10555#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:44:01,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {10555#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10559#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:44:01,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {10559#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {10559#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:44:01,394 INFO L290 TraceCheckUtils]: 17: Hoare triple {10559#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10559#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:44:01,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {10559#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10559#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:44:01,394 INFO L290 TraceCheckUtils]: 19: Hoare triple {10559#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10559#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:44:01,395 INFO L290 TraceCheckUtils]: 20: Hoare triple {10559#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {10559#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:44:01,395 INFO L290 TraceCheckUtils]: 21: Hoare triple {10559#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {10495#false} is VALID [2022-04-28 03:44:01,395 INFO L290 TraceCheckUtils]: 22: Hoare triple {10495#false} assume !(~y~0 % 4294967296 > 0); {10495#false} is VALID [2022-04-28 03:44:01,395 INFO L272 TraceCheckUtils]: 23: Hoare triple {10495#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10495#false} is VALID [2022-04-28 03:44:01,395 INFO L290 TraceCheckUtils]: 24: Hoare triple {10495#false} ~cond := #in~cond; {10495#false} is VALID [2022-04-28 03:44:01,395 INFO L290 TraceCheckUtils]: 25: Hoare triple {10495#false} assume 0 == ~cond; {10495#false} is VALID [2022-04-28 03:44:01,395 INFO L290 TraceCheckUtils]: 26: Hoare triple {10495#false} assume !false; {10495#false} is VALID [2022-04-28 03:44:01,395 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:44:01,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:44:01,564 INFO L290 TraceCheckUtils]: 26: Hoare triple {10495#false} assume !false; {10495#false} is VALID [2022-04-28 03:44:01,565 INFO L290 TraceCheckUtils]: 25: Hoare triple {10495#false} assume 0 == ~cond; {10495#false} is VALID [2022-04-28 03:44:01,565 INFO L290 TraceCheckUtils]: 24: Hoare triple {10495#false} ~cond := #in~cond; {10495#false} is VALID [2022-04-28 03:44:01,565 INFO L272 TraceCheckUtils]: 23: Hoare triple {10495#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10495#false} is VALID [2022-04-28 03:44:01,565 INFO L290 TraceCheckUtils]: 22: Hoare triple {10495#false} assume !(~y~0 % 4294967296 > 0); {10495#false} is VALID [2022-04-28 03:44:01,565 INFO L290 TraceCheckUtils]: 21: Hoare triple {10559#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {10495#false} is VALID [2022-04-28 03:44:01,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {10559#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {10559#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:44:01,566 INFO L290 TraceCheckUtils]: 19: Hoare triple {10559#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10559#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:44:01,566 INFO L290 TraceCheckUtils]: 18: Hoare triple {10559#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10559#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:44:01,566 INFO L290 TraceCheckUtils]: 17: Hoare triple {10559#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10559#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:44:01,566 INFO L290 TraceCheckUtils]: 16: Hoare triple {10559#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {10559#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:44:01,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {10555#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10559#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:44:01,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {10551#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10555#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:44:01,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {10632#(or (<= (mod main_~y~0 4294967296) 0) (< 0 (mod (+ main_~z~0 3) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10551#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:44:01,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {10632#(or (<= (mod main_~y~0 4294967296) 0) (< 0 (mod (+ main_~z~0 3) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10632#(or (<= (mod main_~y~0 4294967296) 0) (< 0 (mod (+ main_~z~0 3) 4294967296)))} is VALID [2022-04-28 03:44:01,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {10639#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (mod main_~y~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10632#(or (<= (mod main_~y~0 4294967296) 0) (< 0 (mod (+ main_~z~0 3) 4294967296)))} is VALID [2022-04-28 03:44:01,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {10643#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (mod main_~y~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10639#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-28 03:44:01,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {10647#(or (< 0 (mod main_~z~0 4294967296)) (<= (mod main_~y~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10643#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-28 03:44:01,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {10494#true} ~z~0 := ~y~0; {10647#(or (< 0 (mod main_~z~0 4294967296)) (<= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-28 03:44:01,571 INFO L290 TraceCheckUtils]: 7: Hoare triple {10494#true} [137] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {10494#true} is VALID [2022-04-28 03:44:01,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {10494#true} [138] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_217 v_main_~x~0_216)) (.cse1 (= v_main_~y~0_242 v_main_~y~0_241)) (.cse2 (= |v_main_#t~post5_104| |v_main_#t~post5_103|)) (.cse3 (= |v_main_#t~post6_104| |v_main_#t~post6_103|)) (.cse4 (mod v_main_~x~0_217 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3) (and (forall ((v_it_21 Int)) (or (not (<= 1 v_it_21)) (< 0 (mod (+ v_main_~x~0_217 (* 4294967295 v_it_21)) 4294967296)) (not (<= (+ v_main_~y~0_242 v_it_21 1) v_main_~y~0_241)))) (< 0 .cse4) (= v_main_~x~0_216 (+ v_main_~x~0_217 v_main_~y~0_242 (* (- 1) v_main_~y~0_241))) (< v_main_~y~0_242 v_main_~y~0_241)))) InVars {main_~y~0=v_main_~y~0_242, main_#t~post5=|v_main_#t~post5_104|, main_~x~0=v_main_~x~0_217, main_#t~post6=|v_main_#t~post6_104|} OutVars{main_~y~0=v_main_~y~0_241, main_#t~post5=|v_main_#t~post5_103|, main_~x~0=v_main_~x~0_216, main_#t~post6=|v_main_#t~post6_103|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10494#true} is VALID [2022-04-28 03:44:01,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {10494#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10494#true} is VALID [2022-04-28 03:44:01,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {10494#true} call #t~ret17 := main(); {10494#true} is VALID [2022-04-28 03:44:01,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10494#true} {10494#true} #94#return; {10494#true} is VALID [2022-04-28 03:44:01,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {10494#true} assume true; {10494#true} is VALID [2022-04-28 03:44:01,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {10494#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10494#true} is VALID [2022-04-28 03:44:01,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {10494#true} call ULTIMATE.init(); {10494#true} is VALID [2022-04-28 03:44:01,572 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:44:01,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62884298] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:44:01,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:44:01,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-28 03:44:01,627 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:44:01,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [472279886] [2022-04-28 03:44:01,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [472279886] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:44:01,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:44:01,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 03:44:01,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620500847] [2022-04-28 03:44:01,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:44:01,628 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 03:44:01,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:44:01,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:01,653 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:44:01,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 03:44:01,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:01,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 03:44:01,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2022-04-28 03:44:01,654 INFO L87 Difference]: Start difference. First operand 76 states and 101 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:04,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:04,191 INFO L93 Difference]: Finished difference Result 135 states and 189 transitions. [2022-04-28 03:44:04,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 03:44:04,191 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 03:44:04,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:44:04,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:04,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 93 transitions. [2022-04-28 03:44:04,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:04,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 93 transitions. [2022-04-28 03:44:04,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 93 transitions. [2022-04-28 03:44:04,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:04,496 INFO L225 Difference]: With dead ends: 135 [2022-04-28 03:44:04,496 INFO L226 Difference]: Without dead ends: 125 [2022-04-28 03:44:04,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=339, Invalid=1641, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 03:44:04,497 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 37 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:44:04,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 70 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 03:44:04,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-28 03:44:05,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 92. [2022-04-28 03:44:05,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:44:05,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 92 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 87 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:05,096 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 92 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 87 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:05,097 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 92 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 87 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:05,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:05,098 INFO L93 Difference]: Finished difference Result 125 states and 167 transitions. [2022-04-28 03:44:05,098 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 167 transitions. [2022-04-28 03:44:05,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:05,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:05,099 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 87 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 125 states. [2022-04-28 03:44:05,099 INFO L87 Difference]: Start difference. First operand has 92 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 87 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 125 states. [2022-04-28 03:44:05,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:05,100 INFO L93 Difference]: Finished difference Result 125 states and 167 transitions. [2022-04-28 03:44:05,100 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 167 transitions. [2022-04-28 03:44:05,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:05,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:05,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:44:05,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:44:05,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 87 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:05,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 124 transitions. [2022-04-28 03:44:05,102 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 124 transitions. Word has length 28 [2022-04-28 03:44:05,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:44:05,102 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 124 transitions. [2022-04-28 03:44:05,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:05,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 124 transitions. [2022-04-28 03:44:12,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 122 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:12,121 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 124 transitions. [2022-04-28 03:44:12,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 03:44:12,122 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:44:12,122 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:44:12,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 03:44:12,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-28 03:44:12,322 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:44:12,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:44:12,323 INFO L85 PathProgramCache]: Analyzing trace with hash 939274105, now seen corresponding path program 3 times [2022-04-28 03:44:12,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:12,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1117551277] [2022-04-28 03:44:14,518 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:44:14,519 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:44:14,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1905988201, now seen corresponding path program 1 times [2022-04-28 03:44:14,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:44:14,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693739125] [2022-04-28 03:44:14,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:14,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:44:14,529 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_22.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:44:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:14,554 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_22.4))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:44:14,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:44:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:14,879 INFO L290 TraceCheckUtils]: 0: Hoare triple {11449#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11433#true} is VALID [2022-04-28 03:44:14,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {11433#true} assume true; {11433#true} is VALID [2022-04-28 03:44:14,879 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11433#true} {11433#true} #94#return; {11433#true} is VALID [2022-04-28 03:44:14,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {11433#true} call ULTIMATE.init(); {11449#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:44:14,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {11449#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11433#true} is VALID [2022-04-28 03:44:14,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {11433#true} assume true; {11433#true} is VALID [2022-04-28 03:44:14,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11433#true} {11433#true} #94#return; {11433#true} is VALID [2022-04-28 03:44:14,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {11433#true} call #t~ret17 := main(); {11433#true} is VALID [2022-04-28 03:44:14,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {11433#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11438#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:44:14,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {11438#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [140] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_231 4294967296)) (.cse1 (= v_main_~x~0_231 v_main_~x~0_230)) (.cse2 (= v_main_~y~0_257 v_main_~y~0_256)) (.cse3 (= |v_main_#t~post6_109| |v_main_#t~post6_108|)) (.cse4 (= |v_main_#t~post5_109| |v_main_#t~post5_108|))) (or (and (forall ((v_it_22 Int)) (or (not (<= (+ v_main_~y~0_257 v_it_22 1) v_main_~y~0_256)) (< 0 (mod (+ v_main_~x~0_231 (* 4294967295 v_it_22)) 4294967296)) (not (<= 1 v_it_22)))) (< 0 .cse0) (= v_main_~x~0_230 (+ v_main_~x~0_231 (* (- 1) v_main_~y~0_256) v_main_~y~0_257)) (< v_main_~y~0_257 v_main_~y~0_256)) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_257, main_#t~post5=|v_main_#t~post5_109|, main_~x~0=v_main_~x~0_231, main_#t~post6=|v_main_#t~post6_109|} OutVars{main_~y~0=v_main_~y~0_256, main_#t~post5=|v_main_#t~post5_108|, main_~x~0=v_main_~x~0_230, main_#t~post6=|v_main_#t~post6_108|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11439#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)) (<= (+ (* (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))) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} is VALID [2022-04-28 03:44:14,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {11439#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)) (<= (+ (* (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))) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} [139] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {11440#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ (* (div (+ main_~y~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 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))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-28 03:44:14,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {11440#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ (* (div (+ main_~y~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 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))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} ~z~0 := ~y~0; {11441#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (and (<= (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-28 03:44:14,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {11441#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (and (<= (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11442#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:44:14,890 INFO L290 TraceCheckUtils]: 10: Hoare triple {11442#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11443#(and (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) main_~z~0 2) main_~n~0) (<= (* (div (+ main_~z~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~z~0))} is VALID [2022-04-28 03:44:14,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {11443#(and (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) main_~z~0 2) main_~n~0) (<= (* (div (+ main_~z~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~z~0))} assume !(~z~0 % 4294967296 > 0); {11443#(and (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) main_~z~0 2) main_~n~0) (<= (* (div (+ main_~z~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~z~0))} is VALID [2022-04-28 03:44:14,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {11443#(and (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) main_~z~0 2) main_~n~0) (<= (* (div (+ main_~z~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11444#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (+ (* 4294967296 (div (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296)) 1) main_~z~0))} is VALID [2022-04-28 03:44:14,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {11444#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (+ (* 4294967296 (div (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296)) 1) main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11445#(and (<= (+ 2 (* (div (+ main_~z~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~z~0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0))} is VALID [2022-04-28 03:44:14,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {11445#(and (<= (+ 2 (* (div (+ main_~z~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~z~0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0))} assume !(~y~0 % 4294967296 > 0); {11445#(and (<= (+ 2 (* (div (+ main_~z~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~z~0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0))} is VALID [2022-04-28 03:44:14,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {11445#(and (<= (+ 2 (* (div (+ main_~z~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~z~0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {11445#(and (<= (+ 2 (* (div (+ main_~z~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~z~0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0))} is VALID [2022-04-28 03:44:14,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {11445#(and (<= (+ 2 (* (div (+ main_~z~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~z~0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {11445#(and (<= (+ 2 (* (div (+ main_~z~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~z~0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0))} is VALID [2022-04-28 03:44:14,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {11445#(and (<= (+ 2 (* (div (+ main_~z~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~z~0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {11445#(and (<= (+ 2 (* (div (+ main_~z~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~z~0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0))} is VALID [2022-04-28 03:44:14,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {11445#(and (<= (+ 2 (* (div (+ main_~z~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~z~0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11444#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (+ (* 4294967296 (div (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296)) 1) main_~z~0))} is VALID [2022-04-28 03:44:14,905 INFO L290 TraceCheckUtils]: 19: Hoare triple {11444#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (+ (* 4294967296 (div (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296)) 1) main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11443#(and (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) main_~z~0 2) main_~n~0) (<= (* (div (+ main_~z~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~z~0))} is VALID [2022-04-28 03:44:14,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {11443#(and (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) main_~z~0 2) main_~n~0) (<= (* (div (+ main_~z~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~z~0))} assume !(~z~0 % 4294967296 > 0); {11443#(and (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) main_~z~0 2) main_~n~0) (<= (* (div (+ main_~z~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~z~0))} is VALID [2022-04-28 03:44:14,907 INFO L290 TraceCheckUtils]: 21: Hoare triple {11443#(and (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) main_~z~0 2) main_~n~0) (<= (* (div (+ main_~z~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {11444#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (+ (* 4294967296 (div (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296)) 1) main_~z~0))} is VALID [2022-04-28 03:44:14,909 INFO L290 TraceCheckUtils]: 22: Hoare triple {11444#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (+ (* 4294967296 (div (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296)) 1) main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {11446#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:44:14,909 INFO L290 TraceCheckUtils]: 23: Hoare triple {11446#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {11446#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:44:14,910 INFO L272 TraceCheckUtils]: 24: Hoare triple {11446#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11447#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:44:14,911 INFO L290 TraceCheckUtils]: 25: Hoare triple {11447#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {11448#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:44:14,911 INFO L290 TraceCheckUtils]: 26: Hoare triple {11448#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {11434#false} is VALID [2022-04-28 03:44:14,911 INFO L290 TraceCheckUtils]: 27: Hoare triple {11434#false} assume !false; {11434#false} is VALID [2022-04-28 03:44:14,911 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:44:14,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:44:14,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693739125] [2022-04-28 03:44:14,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693739125] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:44:14,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910741112] [2022-04-28 03:44:14,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:14,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:14,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:44:14,913 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:44:14,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 03:44:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:15,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 03:44:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:15,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:45:05,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {11433#true} call ULTIMATE.init(); {11433#true} is VALID [2022-04-28 03:45:05,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {11433#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11433#true} is VALID [2022-04-28 03:45:05,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {11433#true} assume true; {11433#true} is VALID [2022-04-28 03:45:05,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11433#true} {11433#true} #94#return; {11433#true} is VALID [2022-04-28 03:45:05,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {11433#true} call #t~ret17 := main(); {11433#true} is VALID [2022-04-28 03:45:05,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {11433#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11438#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:45:05,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {11438#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [140] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_231 4294967296)) (.cse1 (= v_main_~x~0_231 v_main_~x~0_230)) (.cse2 (= v_main_~y~0_257 v_main_~y~0_256)) (.cse3 (= |v_main_#t~post6_109| |v_main_#t~post6_108|)) (.cse4 (= |v_main_#t~post5_109| |v_main_#t~post5_108|))) (or (and (forall ((v_it_22 Int)) (or (not (<= (+ v_main_~y~0_257 v_it_22 1) v_main_~y~0_256)) (< 0 (mod (+ v_main_~x~0_231 (* 4294967295 v_it_22)) 4294967296)) (not (<= 1 v_it_22)))) (< 0 .cse0) (= v_main_~x~0_230 (+ v_main_~x~0_231 (* (- 1) v_main_~y~0_256) v_main_~y~0_257)) (< v_main_~y~0_257 v_main_~y~0_256)) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_257, main_#t~post5=|v_main_#t~post5_109|, main_~x~0=v_main_~x~0_231, main_#t~post6=|v_main_#t~post6_109|} OutVars{main_~y~0=v_main_~y~0_256, main_#t~post5=|v_main_#t~post5_108|, main_~x~0=v_main_~x~0_230, main_#t~post6=|v_main_#t~post6_108|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11471#(or (and (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= (+ v_it_22 1) main_~y~0)) (not (<= 1 v_it_22)))) (= main_~x~0 (+ main_~n~0 (* (- 1) main_~y~0))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} is VALID [2022-04-28 03:45:05,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {11471#(or (and (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= (+ v_it_22 1) main_~y~0)) (not (<= 1 v_it_22)))) (= main_~x~0 (+ main_~n~0 (* (- 1) main_~y~0))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} [139] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {11475#(or (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0)) (and (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= (+ v_it_22 1) main_~y~0)) (not (<= 1 v_it_22)))) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)))} is VALID [2022-04-28 03:45:05,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {11475#(or (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0)) (and (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= (+ v_it_22 1) main_~y~0)) (not (<= 1 v_it_22)))) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)))} ~z~0 := ~y~0; {11479#(or (and (< 0 main_~z~0) (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= 1 v_it_22)) (not (<= (+ v_it_22 1) main_~z~0)))) (< 0 (mod main_~n~0 4294967296)) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296))) (and (= main_~z~0 0) (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296))))} is VALID [2022-04-28 03:45:05,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {11479#(or (and (< 0 main_~z~0) (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= 1 v_it_22)) (not (<= (+ v_it_22 1) main_~z~0)))) (< 0 (mod main_~n~0 4294967296)) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296))) (and (= main_~z~0 0) (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11483#(and (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= v_it_22 main_~z~0)) (not (<= 1 v_it_22)))) (< 0 (mod (+ main_~z~0 1) 4294967296)) (< 0 (+ main_~z~0 1)) (<= (div (+ main_~z~0 (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} is VALID [2022-04-28 03:45:05,256 INFO L290 TraceCheckUtils]: 10: Hoare triple {11483#(and (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= v_it_22 main_~z~0)) (not (<= 1 v_it_22)))) (< 0 (mod (+ main_~z~0 1) 4294967296)) (< 0 (+ main_~z~0 1)) (<= (div (+ main_~z~0 (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11487#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= v_it_22 (+ main_~z~0 1))) (not (<= 1 v_it_22)))) (< 0 (+ main_~z~0 2)) (<= (div (+ main_~z~0 2 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} is VALID [2022-04-28 03:45:05,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {11487#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= v_it_22 (+ main_~z~0 1))) (not (<= 1 v_it_22)))) (< 0 (+ main_~z~0 2)) (<= (div (+ main_~z~0 2 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {11491#(and (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= v_it_22 (+ main_~z~0 1))) (not (<= 1 v_it_22)))) (< 0 (+ main_~z~0 2)) (<= (div (+ main_~z~0 2 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296)) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-28 03:45:05,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {11491#(and (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= v_it_22 (+ main_~z~0 1))) (not (<= 1 v_it_22)))) (< 0 (+ main_~z~0 2)) (<= (div (+ main_~z~0 2 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296)) (<= (mod main_~z~0 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11495#(and (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= v_it_22 main_~z~0)) (not (<= 1 v_it_22)))) (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (< 0 (+ main_~z~0 1)) (<= (div (+ main_~z~0 (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} is VALID [2022-04-28 03:45:05,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {11495#(and (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= v_it_22 main_~z~0)) (not (<= 1 v_it_22)))) (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (< 0 (+ main_~z~0 1)) (<= (div (+ main_~z~0 (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11499#(and (< 0 main_~z~0) (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= 1 v_it_22)) (not (<= (+ v_it_22 1) main_~z~0)))) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} is VALID [2022-04-28 03:45:05,331 INFO L290 TraceCheckUtils]: 14: Hoare triple {11499#(and (< 0 main_~z~0) (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= 1 v_it_22)) (not (<= (+ v_it_22 1) main_~z~0)))) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {11499#(and (< 0 main_~z~0) (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= 1 v_it_22)) (not (<= (+ v_it_22 1) main_~z~0)))) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} is VALID [2022-04-28 03:45:05,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {11499#(and (< 0 main_~z~0) (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= 1 v_it_22)) (not (<= (+ v_it_22 1) main_~z~0)))) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {11499#(and (< 0 main_~z~0) (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= 1 v_it_22)) (not (<= (+ v_it_22 1) main_~z~0)))) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} is VALID [2022-04-28 03:45:05,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {11499#(and (< 0 main_~z~0) (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= 1 v_it_22)) (not (<= (+ v_it_22 1) main_~z~0)))) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {11499#(and (< 0 main_~z~0) (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= 1 v_it_22)) (not (<= (+ v_it_22 1) main_~z~0)))) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} is VALID [2022-04-28 03:45:05,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {11499#(and (< 0 main_~z~0) (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= 1 v_it_22)) (not (<= (+ v_it_22 1) main_~z~0)))) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {11499#(and (< 0 main_~z~0) (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= 1 v_it_22)) (not (<= (+ v_it_22 1) main_~z~0)))) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} is VALID [2022-04-28 03:45:05,339 INFO L290 TraceCheckUtils]: 18: Hoare triple {11499#(and (< 0 main_~z~0) (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= 1 v_it_22)) (not (<= (+ v_it_22 1) main_~z~0)))) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11495#(and (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= v_it_22 main_~z~0)) (not (<= 1 v_it_22)))) (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (< 0 (+ main_~z~0 1)) (<= (div (+ main_~z~0 (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} is VALID [2022-04-28 03:45:05,533 INFO L290 TraceCheckUtils]: 19: Hoare triple {11495#(and (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= v_it_22 main_~z~0)) (not (<= 1 v_it_22)))) (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (< 0 (+ main_~z~0 1)) (<= (div (+ main_~z~0 (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11491#(and (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= v_it_22 (+ main_~z~0 1))) (not (<= 1 v_it_22)))) (< 0 (+ main_~z~0 2)) (<= (div (+ main_~z~0 2 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296)) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-28 03:45:05,534 INFO L290 TraceCheckUtils]: 20: Hoare triple {11491#(and (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= v_it_22 (+ main_~z~0 1))) (not (<= 1 v_it_22)))) (< 0 (+ main_~z~0 2)) (<= (div (+ main_~z~0 2 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296)) (<= (mod main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {11491#(and (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= v_it_22 (+ main_~z~0 1))) (not (<= 1 v_it_22)))) (< 0 (+ main_~z~0 2)) (<= (div (+ main_~z~0 2 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296)) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-28 03:45:05,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {11491#(and (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= v_it_22 (+ main_~z~0 1))) (not (<= 1 v_it_22)))) (< 0 (+ main_~z~0 2)) (<= (div (+ main_~z~0 2 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296)) (<= (mod main_~z~0 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {11495#(and (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= v_it_22 main_~z~0)) (not (<= 1 v_it_22)))) (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (< 0 (+ main_~z~0 1)) (<= (div (+ main_~z~0 (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} is VALID [2022-04-28 03:45:05,751 INFO L290 TraceCheckUtils]: 22: Hoare triple {11495#(and (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= v_it_22 main_~z~0)) (not (<= 1 v_it_22)))) (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (< 0 (+ main_~z~0 1)) (<= (div (+ main_~z~0 (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {11499#(and (< 0 main_~z~0) (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= 1 v_it_22)) (not (<= (+ v_it_22 1) main_~z~0)))) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} is VALID [2022-04-28 03:45:05,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {11499#(and (< 0 main_~z~0) (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= 1 v_it_22)) (not (<= (+ v_it_22 1) main_~z~0)))) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {11499#(and (< 0 main_~z~0) (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= 1 v_it_22)) (not (<= (+ v_it_22 1) main_~z~0)))) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} is VALID [2022-04-28 03:45:05,789 INFO L272 TraceCheckUtils]: 24: Hoare triple {11499#(and (< 0 main_~z~0) (forall ((v_it_22 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_22)) 4294967296)) (not (<= 1 v_it_22)) (not (<= (+ v_it_22 1) main_~z~0)))) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11533#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:45:05,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {11533#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11537#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:45:05,790 INFO L290 TraceCheckUtils]: 26: Hoare triple {11537#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11434#false} is VALID [2022-04-28 03:45:05,790 INFO L290 TraceCheckUtils]: 27: Hoare triple {11434#false} assume !false; {11434#false} is VALID [2022-04-28 03:45:05,790 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 1 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:45:05,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:45:52,116 INFO L290 TraceCheckUtils]: 27: Hoare triple {11434#false} assume !false; {11434#false} is VALID [2022-04-28 03:45:52,117 INFO L290 TraceCheckUtils]: 26: Hoare triple {11537#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11434#false} is VALID [2022-04-28 03:45:52,117 INFO L290 TraceCheckUtils]: 25: Hoare triple {11533#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11537#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:45:52,118 INFO L272 TraceCheckUtils]: 24: Hoare triple {11446#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11533#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:45:52,118 INFO L290 TraceCheckUtils]: 23: Hoare triple {11446#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {11446#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:45:52,119 INFO L290 TraceCheckUtils]: 22: Hoare triple {11559#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {11446#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:45:52,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {11563#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {11559#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:45:52,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {11567#(or (< 0 (mod main_~z~0 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0))))} assume !(~z~0 % 4294967296 > 0); {11563#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 03:45:52,124 INFO L290 TraceCheckUtils]: 19: Hoare triple {11571#(or (and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11567#(or (< 0 (mod main_~z~0 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-28 03:45:52,126 INFO L290 TraceCheckUtils]: 18: Hoare triple {11575#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11571#(or (and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:45:52,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {11575#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {11575#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:45:52,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {11575#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {11575#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:45:52,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {11575#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {11575#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:45:52,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {11575#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {11575#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:45:52,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {11571#(or (and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11575#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:45:52,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {11567#(or (< 0 (mod main_~z~0 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11571#(or (and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:45:52,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {11567#(or (< 0 (mod main_~z~0 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0))))} assume !(~z~0 % 4294967296 > 0); {11567#(or (< 0 (mod main_~z~0 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-28 03:45:52,138 INFO L290 TraceCheckUtils]: 10: Hoare triple {11571#(or (and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11567#(or (< 0 (mod main_~z~0 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-28 03:45:52,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {11575#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11571#(or (and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:45:52,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {11606#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} ~z~0 := ~y~0; {11575#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:45:52,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {11610#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} [139] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {11606#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-28 03:45:54,389 WARN L290 TraceCheckUtils]: 6: Hoare triple {11614#(and (forall ((aux_mod_aux_mod_v_main_~y~0_268_47_104 Int) (aux_div_v_main_~y~0_268_47 Int) (aux_div_aux_mod_v_main_~y~0_268_47_104 Int)) (or (< (* 4294967296 aux_div_v_main_~y~0_268_47) (+ 4294967294 (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104)) (< main_~n~0 (+ (* (div main_~n~0 4294967296) 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104 1)) (< aux_mod_aux_mod_v_main_~y~0_268_47_104 0) (< (+ 4294967294 (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104) (* 4294967296 aux_div_v_main_~y~0_268_47)) (and (or (not (= (+ main_~y~0 4294967294) (+ 4294967294 (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104))) (< 0 (mod main_~x~0 4294967296))) (or (forall ((aux_div_v_main_~x~0_242_32 Int)) (or (< (+ (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104 (* 4294967296 aux_div_v_main_~x~0_242_32)) (+ main_~y~0 main_~x~0)) (< (+ main_~y~0 main_~x~0) (+ (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104 (* 4294967296 aux_div_v_main_~x~0_242_32))))) (not (< 0 (mod main_~x~0 4294967296))) (not (< main_~y~0 (+ (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104))) (exists ((v_it_22 Int)) (and (<= (+ main_~y~0 v_it_22 1) (+ (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104)) (not (< 0 (mod (+ main_~x~0 (* 4294967295 v_it_22)) 4294967296))) (<= 1 v_it_22))))))) (forall ((aux_mod_aux_mod_v_main_~y~0_268_47_104 Int) (aux_div_v_main_~y~0_268_47 Int) (aux_div_aux_mod_v_main_~y~0_268_47_104 Int)) (or (< (* 4294967296 aux_div_v_main_~y~0_268_47) (+ 4294967294 (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104)) (<= (+ (* (div main_~n~0 4294967296) 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104) main_~n~0) (< (+ 4294967294 (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104) (* 4294967296 aux_div_v_main_~y~0_268_47)) (<= 4294967296 aux_mod_aux_mod_v_main_~y~0_268_47_104) (and (or (not (= (+ main_~y~0 4294967294) (+ 4294967294 (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104))) (< 0 (mod main_~x~0 4294967296))) (or (forall ((aux_div_v_main_~x~0_242_32 Int)) (or (< (+ (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104 (* 4294967296 aux_div_v_main_~x~0_242_32)) (+ main_~y~0 main_~x~0)) (< (+ main_~y~0 main_~x~0) (+ (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104 (* 4294967296 aux_div_v_main_~x~0_242_32))))) (not (< 0 (mod main_~x~0 4294967296))) (not (< main_~y~0 (+ (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104))) (exists ((v_it_22 Int)) (and (<= (+ main_~y~0 v_it_22 1) (+ (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104)) (not (< 0 (mod (+ main_~x~0 (* 4294967295 v_it_22)) 4294967296))) (<= 1 v_it_22))))))))} [140] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_231 4294967296)) (.cse1 (= v_main_~x~0_231 v_main_~x~0_230)) (.cse2 (= v_main_~y~0_257 v_main_~y~0_256)) (.cse3 (= |v_main_#t~post6_109| |v_main_#t~post6_108|)) (.cse4 (= |v_main_#t~post5_109| |v_main_#t~post5_108|))) (or (and (forall ((v_it_22 Int)) (or (not (<= (+ v_main_~y~0_257 v_it_22 1) v_main_~y~0_256)) (< 0 (mod (+ v_main_~x~0_231 (* 4294967295 v_it_22)) 4294967296)) (not (<= 1 v_it_22)))) (< 0 .cse0) (= v_main_~x~0_230 (+ v_main_~x~0_231 (* (- 1) v_main_~y~0_256) v_main_~y~0_257)) (< v_main_~y~0_257 v_main_~y~0_256)) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_257, main_#t~post5=|v_main_#t~post5_109|, main_~x~0=v_main_~x~0_231, main_#t~post6=|v_main_#t~post6_109|} OutVars{main_~y~0=v_main_~y~0_256, main_#t~post5=|v_main_#t~post5_108|, main_~x~0=v_main_~x~0_230, main_#t~post6=|v_main_#t~post6_108|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11610#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is UNKNOWN [2022-04-28 03:45:54,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {11433#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11614#(and (forall ((aux_mod_aux_mod_v_main_~y~0_268_47_104 Int) (aux_div_v_main_~y~0_268_47 Int) (aux_div_aux_mod_v_main_~y~0_268_47_104 Int)) (or (< (* 4294967296 aux_div_v_main_~y~0_268_47) (+ 4294967294 (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104)) (< main_~n~0 (+ (* (div main_~n~0 4294967296) 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104 1)) (< aux_mod_aux_mod_v_main_~y~0_268_47_104 0) (< (+ 4294967294 (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104) (* 4294967296 aux_div_v_main_~y~0_268_47)) (and (or (not (= (+ main_~y~0 4294967294) (+ 4294967294 (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104))) (< 0 (mod main_~x~0 4294967296))) (or (forall ((aux_div_v_main_~x~0_242_32 Int)) (or (< (+ (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104 (* 4294967296 aux_div_v_main_~x~0_242_32)) (+ main_~y~0 main_~x~0)) (< (+ main_~y~0 main_~x~0) (+ (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104 (* 4294967296 aux_div_v_main_~x~0_242_32))))) (not (< 0 (mod main_~x~0 4294967296))) (not (< main_~y~0 (+ (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104))) (exists ((v_it_22 Int)) (and (<= (+ main_~y~0 v_it_22 1) (+ (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104)) (not (< 0 (mod (+ main_~x~0 (* 4294967295 v_it_22)) 4294967296))) (<= 1 v_it_22))))))) (forall ((aux_mod_aux_mod_v_main_~y~0_268_47_104 Int) (aux_div_v_main_~y~0_268_47 Int) (aux_div_aux_mod_v_main_~y~0_268_47_104 Int)) (or (< (* 4294967296 aux_div_v_main_~y~0_268_47) (+ 4294967294 (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104)) (<= (+ (* (div main_~n~0 4294967296) 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104) main_~n~0) (< (+ 4294967294 (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104) (* 4294967296 aux_div_v_main_~y~0_268_47)) (<= 4294967296 aux_mod_aux_mod_v_main_~y~0_268_47_104) (and (or (not (= (+ main_~y~0 4294967294) (+ 4294967294 (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104))) (< 0 (mod main_~x~0 4294967296))) (or (forall ((aux_div_v_main_~x~0_242_32 Int)) (or (< (+ (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104 (* 4294967296 aux_div_v_main_~x~0_242_32)) (+ main_~y~0 main_~x~0)) (< (+ main_~y~0 main_~x~0) (+ (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104 (* 4294967296 aux_div_v_main_~x~0_242_32))))) (not (< 0 (mod main_~x~0 4294967296))) (not (< main_~y~0 (+ (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104))) (exists ((v_it_22 Int)) (and (<= (+ main_~y~0 v_it_22 1) (+ (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104)) (not (< 0 (mod (+ main_~x~0 (* 4294967295 v_it_22)) 4294967296))) (<= 1 v_it_22))))))))} is VALID [2022-04-28 03:45:54,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {11433#true} call #t~ret17 := main(); {11433#true} is VALID [2022-04-28 03:45:54,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11433#true} {11433#true} #94#return; {11433#true} is VALID [2022-04-28 03:45:54,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {11433#true} assume true; {11433#true} is VALID [2022-04-28 03:45:54,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {11433#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11433#true} is VALID [2022-04-28 03:45:54,439 INFO L272 TraceCheckUtils]: 0: Hoare triple {11433#true} call ULTIMATE.init(); {11433#true} is VALID [2022-04-28 03:45:54,439 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:45:54,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910741112] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:45:54,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:45:54,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 32 [2022-04-28 03:46:00,187 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:46:00,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1117551277] [2022-04-28 03:46:00,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1117551277] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:46:00,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:46:00,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 03:46:00,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108630988] [2022-04-28 03:46:00,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:46:00,188 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 03:46:00,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:46:00,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.6) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:00,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:46:00,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 03:46:00,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:46:00,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 03:46:00,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=956, Unknown=26, NotChecked=0, Total=1122 [2022-04-28 03:46:00,279 INFO L87 Difference]: Start difference. First operand 92 states and 124 transitions. Second operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:04,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:04,149 INFO L93 Difference]: Finished difference Result 103 states and 136 transitions. [2022-04-28 03:46:04,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 03:46:04,149 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 03:46:04,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:46:04,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:04,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 46 transitions. [2022-04-28 03:46:04,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:04,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 46 transitions. [2022-04-28 03:46:04,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 46 transitions. [2022-04-28 03:46:06,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 45 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:46:06,289 INFO L225 Difference]: With dead ends: 103 [2022-04-28 03:46:06,289 INFO L226 Difference]: Without dead ends: 98 [2022-04-28 03:46:06,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 90.9s TimeCoverageRelationStatistics Valid=196, Invalid=1500, Unknown=26, NotChecked=0, Total=1722 [2022-04-28 03:46:06,289 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 27 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:46:06,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 70 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 188 Invalid, 0 Unknown, 58 Unchecked, 0.7s Time] [2022-04-28 03:46:06,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-28 03:46:06,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2022-04-28 03:46:06,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:46:06,930 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 96 states, 91 states have (on average 1.3736263736263736) internal successors, (125), 91 states have internal predecessors, (125), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:06,930 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 96 states, 91 states have (on average 1.3736263736263736) internal successors, (125), 91 states have internal predecessors, (125), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:06,930 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 96 states, 91 states have (on average 1.3736263736263736) internal successors, (125), 91 states have internal predecessors, (125), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:06,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:06,932 INFO L93 Difference]: Finished difference Result 98 states and 131 transitions. [2022-04-28 03:46:06,932 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 131 transitions. [2022-04-28 03:46:06,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:46:06,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:46:06,932 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 91 states have (on average 1.3736263736263736) internal successors, (125), 91 states have internal predecessors, (125), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 98 states. [2022-04-28 03:46:06,932 INFO L87 Difference]: Start difference. First operand has 96 states, 91 states have (on average 1.3736263736263736) internal successors, (125), 91 states have internal predecessors, (125), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 98 states. [2022-04-28 03:46:06,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:06,933 INFO L93 Difference]: Finished difference Result 98 states and 131 transitions. [2022-04-28 03:46:06,933 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 131 transitions. [2022-04-28 03:46:06,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:46:06,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:46:06,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:46:06,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:46:06,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 91 states have (on average 1.3736263736263736) internal successors, (125), 91 states have internal predecessors, (125), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:06,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 129 transitions. [2022-04-28 03:46:06,934 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 129 transitions. Word has length 29 [2022-04-28 03:46:06,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:46:06,934 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 129 transitions. [2022-04-28 03:46:06,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:06,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 129 transitions. [2022-04-28 03:46:14,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 127 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:46:14,256 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 129 transitions. [2022-04-28 03:46:14,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 03:46:14,256 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:46:14,256 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:46:14,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-04-28 03:46:14,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:46:14,457 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:46:14,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:46:14,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1563256359, now seen corresponding path program 4 times [2022-04-28 03:46:14,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:46:14,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [779984301] [2022-04-28 03:46:14,720 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:46:14,721 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:46:14,723 INFO L85 PathProgramCache]: Analyzing trace with hash 528005175, now seen corresponding path program 1 times [2022-04-28 03:46:14,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:46:14,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007889311] [2022-04-28 03:46:14,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:46:14,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:46:14,733 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_23.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:46:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:14,747 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_23.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:46:14,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:46:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:14,898 INFO L290 TraceCheckUtils]: 0: Hoare triple {12256#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12247#true} is VALID [2022-04-28 03:46:14,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {12247#true} assume true; {12247#true} is VALID [2022-04-28 03:46:14,898 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12247#true} {12247#true} #94#return; {12247#true} is VALID [2022-04-28 03:46:14,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {12247#true} call ULTIMATE.init(); {12256#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:46:14,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {12256#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12247#true} is VALID [2022-04-28 03:46:14,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {12247#true} assume true; {12247#true} is VALID [2022-04-28 03:46:14,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12247#true} {12247#true} #94#return; {12247#true} is VALID [2022-04-28 03:46:14,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {12247#true} call #t~ret17 := main(); {12247#true} is VALID [2022-04-28 03:46:14,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {12247#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12247#true} is VALID [2022-04-28 03:46:14,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {12247#true} [142] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_248 4294967296)) (.cse0 (= |v_main_#t~post5_116| |v_main_#t~post5_115|)) (.cse1 (= v_main_~y~0_274 v_main_~y~0_273)) (.cse2 (= |v_main_#t~post6_116| |v_main_#t~post6_115|))) (or (and .cse0 (= v_main_~x~0_247 v_main_~x~0_248) .cse1 .cse2 (<= .cse3 0)) (and (forall ((v_it_23 Int)) (or (not (<= (+ v_main_~x~0_247 v_it_23 1) v_main_~x~0_248)) (not (<= 1 v_it_23)) (< 0 (mod (+ v_main_~x~0_248 (* 4294967295 v_it_23)) 4294967296)))) (< 0 .cse3) (= (+ v_main_~x~0_248 v_main_~y~0_274 (* v_main_~x~0_247 (- 1))) v_main_~y~0_273) (< v_main_~x~0_247 v_main_~x~0_248)) (and .cse0 (= v_main_~x~0_248 v_main_~x~0_247) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_274, main_#t~post5=|v_main_#t~post5_116|, main_~x~0=v_main_~x~0_248, main_#t~post6=|v_main_#t~post6_116|} OutVars{main_~y~0=v_main_~y~0_273, main_#t~post5=|v_main_#t~post5_115|, main_~x~0=v_main_~x~0_247, main_#t~post6=|v_main_#t~post6_115|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12247#true} is VALID [2022-04-28 03:46:14,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {12247#true} [141] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {12247#true} is VALID [2022-04-28 03:46:14,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {12247#true} ~z~0 := ~y~0; {12247#true} is VALID [2022-04-28 03:46:14,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {12247#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12247#true} is VALID [2022-04-28 03:46:14,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {12247#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12247#true} is VALID [2022-04-28 03:46:14,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {12247#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12247#true} is VALID [2022-04-28 03:46:14,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {12247#true} assume !(~z~0 % 4294967296 > 0); {12247#true} is VALID [2022-04-28 03:46:14,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {12247#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12247#true} is VALID [2022-04-28 03:46:14,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {12247#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12247#true} is VALID [2022-04-28 03:46:14,912 INFO L290 TraceCheckUtils]: 15: Hoare triple {12247#true} assume !(~y~0 % 4294967296 > 0); {12252#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:46:14,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {12252#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12253#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:46:14,914 INFO L290 TraceCheckUtils]: 17: Hoare triple {12253#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12254#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:14,915 INFO L290 TraceCheckUtils]: 18: Hoare triple {12254#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12255#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 3) main_~y~0)} is VALID [2022-04-28 03:46:14,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {12255#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 3) main_~y~0)} assume !(~x~0 % 4294967296 > 0); {12255#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 3) main_~y~0)} is VALID [2022-04-28 03:46:14,916 INFO L290 TraceCheckUtils]: 20: Hoare triple {12255#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 3) main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12255#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 3) main_~y~0)} is VALID [2022-04-28 03:46:14,916 INFO L290 TraceCheckUtils]: 21: Hoare triple {12255#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 3) main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12255#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 3) main_~y~0)} is VALID [2022-04-28 03:46:14,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {12255#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 3) main_~y~0)} assume !(~z~0 % 4294967296 > 0); {12255#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 3) main_~y~0)} is VALID [2022-04-28 03:46:14,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {12255#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 3) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {12248#false} is VALID [2022-04-28 03:46:14,917 INFO L272 TraceCheckUtils]: 24: Hoare triple {12248#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12248#false} is VALID [2022-04-28 03:46:14,917 INFO L290 TraceCheckUtils]: 25: Hoare triple {12248#false} ~cond := #in~cond; {12248#false} is VALID [2022-04-28 03:46:14,917 INFO L290 TraceCheckUtils]: 26: Hoare triple {12248#false} assume 0 == ~cond; {12248#false} is VALID [2022-04-28 03:46:14,917 INFO L290 TraceCheckUtils]: 27: Hoare triple {12248#false} assume !false; {12248#false} is VALID [2022-04-28 03:46:14,918 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 03:46:14,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:46:14,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007889311] [2022-04-28 03:46:14,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007889311] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:46:14,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605429704] [2022-04-28 03:46:14,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:46:14,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:46:14,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:46:14,919 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:46:14,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 03:46:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:14,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:46:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:14,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:46:15,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {12247#true} call ULTIMATE.init(); {12247#true} is VALID [2022-04-28 03:46:15,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {12247#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12247#true} is VALID [2022-04-28 03:46:15,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {12247#true} assume true; {12247#true} is VALID [2022-04-28 03:46:15,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12247#true} {12247#true} #94#return; {12247#true} is VALID [2022-04-28 03:46:15,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {12247#true} call #t~ret17 := main(); {12247#true} is VALID [2022-04-28 03:46:15,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {12247#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12247#true} is VALID [2022-04-28 03:46:15,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {12247#true} [142] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_248 4294967296)) (.cse0 (= |v_main_#t~post5_116| |v_main_#t~post5_115|)) (.cse1 (= v_main_~y~0_274 v_main_~y~0_273)) (.cse2 (= |v_main_#t~post6_116| |v_main_#t~post6_115|))) (or (and .cse0 (= v_main_~x~0_247 v_main_~x~0_248) .cse1 .cse2 (<= .cse3 0)) (and (forall ((v_it_23 Int)) (or (not (<= (+ v_main_~x~0_247 v_it_23 1) v_main_~x~0_248)) (not (<= 1 v_it_23)) (< 0 (mod (+ v_main_~x~0_248 (* 4294967295 v_it_23)) 4294967296)))) (< 0 .cse3) (= (+ v_main_~x~0_248 v_main_~y~0_274 (* v_main_~x~0_247 (- 1))) v_main_~y~0_273) (< v_main_~x~0_247 v_main_~x~0_248)) (and .cse0 (= v_main_~x~0_248 v_main_~x~0_247) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_274, main_#t~post5=|v_main_#t~post5_116|, main_~x~0=v_main_~x~0_248, main_#t~post6=|v_main_#t~post6_116|} OutVars{main_~y~0=v_main_~y~0_273, main_#t~post5=|v_main_#t~post5_115|, main_~x~0=v_main_~x~0_247, main_#t~post6=|v_main_#t~post6_115|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12247#true} is VALID [2022-04-28 03:46:15,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {12247#true} [141] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {12247#true} is VALID [2022-04-28 03:46:15,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {12247#true} ~z~0 := ~y~0; {12284#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:46:15,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {12284#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12288#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:46:15,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {12288#(= main_~y~0 (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12292#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:46:15,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {12292#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12296#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:46:15,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {12296#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {12296#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:46:15,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {12296#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12303#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:46:15,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {12303#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12307#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:46:15,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {12307#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {12248#false} is VALID [2022-04-28 03:46:15,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {12248#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12248#false} is VALID [2022-04-28 03:46:15,286 INFO L290 TraceCheckUtils]: 17: Hoare triple {12248#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12248#false} is VALID [2022-04-28 03:46:15,286 INFO L290 TraceCheckUtils]: 18: Hoare triple {12248#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12248#false} is VALID [2022-04-28 03:46:15,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {12248#false} assume !(~x~0 % 4294967296 > 0); {12248#false} is VALID [2022-04-28 03:46:15,287 INFO L290 TraceCheckUtils]: 20: Hoare triple {12248#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12248#false} is VALID [2022-04-28 03:46:15,287 INFO L290 TraceCheckUtils]: 21: Hoare triple {12248#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12248#false} is VALID [2022-04-28 03:46:15,287 INFO L290 TraceCheckUtils]: 22: Hoare triple {12248#false} assume !(~z~0 % 4294967296 > 0); {12248#false} is VALID [2022-04-28 03:46:15,287 INFO L290 TraceCheckUtils]: 23: Hoare triple {12248#false} assume !(~y~0 % 4294967296 > 0); {12248#false} is VALID [2022-04-28 03:46:15,287 INFO L272 TraceCheckUtils]: 24: Hoare triple {12248#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12248#false} is VALID [2022-04-28 03:46:15,287 INFO L290 TraceCheckUtils]: 25: Hoare triple {12248#false} ~cond := #in~cond; {12248#false} is VALID [2022-04-28 03:46:15,287 INFO L290 TraceCheckUtils]: 26: Hoare triple {12248#false} assume 0 == ~cond; {12248#false} is VALID [2022-04-28 03:46:15,287 INFO L290 TraceCheckUtils]: 27: Hoare triple {12248#false} assume !false; {12248#false} is VALID [2022-04-28 03:46:15,287 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 03:46:15,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:46:15,583 INFO L290 TraceCheckUtils]: 27: Hoare triple {12248#false} assume !false; {12248#false} is VALID [2022-04-28 03:46:15,583 INFO L290 TraceCheckUtils]: 26: Hoare triple {12248#false} assume 0 == ~cond; {12248#false} is VALID [2022-04-28 03:46:15,583 INFO L290 TraceCheckUtils]: 25: Hoare triple {12248#false} ~cond := #in~cond; {12248#false} is VALID [2022-04-28 03:46:15,584 INFO L272 TraceCheckUtils]: 24: Hoare triple {12248#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12248#false} is VALID [2022-04-28 03:46:15,584 INFO L290 TraceCheckUtils]: 23: Hoare triple {12248#false} assume !(~y~0 % 4294967296 > 0); {12248#false} is VALID [2022-04-28 03:46:15,584 INFO L290 TraceCheckUtils]: 22: Hoare triple {12248#false} assume !(~z~0 % 4294967296 > 0); {12248#false} is VALID [2022-04-28 03:46:15,584 INFO L290 TraceCheckUtils]: 21: Hoare triple {12248#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12248#false} is VALID [2022-04-28 03:46:15,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {12248#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12248#false} is VALID [2022-04-28 03:46:15,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {12248#false} assume !(~x~0 % 4294967296 > 0); {12248#false} is VALID [2022-04-28 03:46:15,584 INFO L290 TraceCheckUtils]: 18: Hoare triple {12248#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12248#false} is VALID [2022-04-28 03:46:15,584 INFO L290 TraceCheckUtils]: 17: Hoare triple {12248#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12248#false} is VALID [2022-04-28 03:46:15,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {12248#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12248#false} is VALID [2022-04-28 03:46:15,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {12307#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {12248#false} is VALID [2022-04-28 03:46:15,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {12303#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12307#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:46:15,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {12296#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12303#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:46:15,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {12296#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {12296#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:46:15,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {12395#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12296#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:46:15,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {12399#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12395#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:46:15,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {12403#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12399#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:46:15,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {12247#true} ~z~0 := ~y~0; {12403#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 03:46:15,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {12247#true} [141] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {12247#true} is VALID [2022-04-28 03:46:15,590 INFO L290 TraceCheckUtils]: 6: Hoare triple {12247#true} [142] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_248 4294967296)) (.cse0 (= |v_main_#t~post5_116| |v_main_#t~post5_115|)) (.cse1 (= v_main_~y~0_274 v_main_~y~0_273)) (.cse2 (= |v_main_#t~post6_116| |v_main_#t~post6_115|))) (or (and .cse0 (= v_main_~x~0_247 v_main_~x~0_248) .cse1 .cse2 (<= .cse3 0)) (and (forall ((v_it_23 Int)) (or (not (<= (+ v_main_~x~0_247 v_it_23 1) v_main_~x~0_248)) (not (<= 1 v_it_23)) (< 0 (mod (+ v_main_~x~0_248 (* 4294967295 v_it_23)) 4294967296)))) (< 0 .cse3) (= (+ v_main_~x~0_248 v_main_~y~0_274 (* v_main_~x~0_247 (- 1))) v_main_~y~0_273) (< v_main_~x~0_247 v_main_~x~0_248)) (and .cse0 (= v_main_~x~0_248 v_main_~x~0_247) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_274, main_#t~post5=|v_main_#t~post5_116|, main_~x~0=v_main_~x~0_248, main_#t~post6=|v_main_#t~post6_116|} OutVars{main_~y~0=v_main_~y~0_273, main_#t~post5=|v_main_#t~post5_115|, main_~x~0=v_main_~x~0_247, main_#t~post6=|v_main_#t~post6_115|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12247#true} is VALID [2022-04-28 03:46:15,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {12247#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12247#true} is VALID [2022-04-28 03:46:15,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {12247#true} call #t~ret17 := main(); {12247#true} is VALID [2022-04-28 03:46:15,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12247#true} {12247#true} #94#return; {12247#true} is VALID [2022-04-28 03:46:15,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {12247#true} assume true; {12247#true} is VALID [2022-04-28 03:46:15,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {12247#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12247#true} is VALID [2022-04-28 03:46:15,591 INFO L272 TraceCheckUtils]: 0: Hoare triple {12247#true} call ULTIMATE.init(); {12247#true} is VALID [2022-04-28 03:46:15,591 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 03:46:15,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605429704] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:46:15,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:46:15,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 16 [2022-04-28 03:46:15,730 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:46:15,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [779984301] [2022-04-28 03:46:15,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [779984301] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:46:15,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:46:15,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:46:15,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714829688] [2022-04-28 03:46:15,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:46:15,730 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 03:46:15,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:46:15,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:15,760 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:46:15,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:46:15,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:46:15,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:46:15,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-04-28 03:46:15,763 INFO L87 Difference]: Start difference. First operand 96 states and 129 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:19,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:19,655 INFO L93 Difference]: Finished difference Result 229 states and 319 transitions. [2022-04-28 03:46:19,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 03:46:19,655 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 03:46:19,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:46:19,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:19,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 118 transitions. [2022-04-28 03:46:19,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:19,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 118 transitions. [2022-04-28 03:46:19,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 118 transitions. [2022-04-28 03:46:19,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:46:19,819 INFO L225 Difference]: With dead ends: 229 [2022-04-28 03:46:19,819 INFO L226 Difference]: Without dead ends: 176 [2022-04-28 03:46:19,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=206, Invalid=786, Unknown=0, NotChecked=0, Total=992 [2022-04-28 03:46:19,819 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 98 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:46:19,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 49 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 03:46:19,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-04-28 03:46:20,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 118. [2022-04-28 03:46:20,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:46:20,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 176 states. Second operand has 118 states, 113 states have (on average 1.3893805309734513) internal successors, (157), 113 states have internal predecessors, (157), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:20,671 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand has 118 states, 113 states have (on average 1.3893805309734513) internal successors, (157), 113 states have internal predecessors, (157), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:20,671 INFO L87 Difference]: Start difference. First operand 176 states. Second operand has 118 states, 113 states have (on average 1.3893805309734513) internal successors, (157), 113 states have internal predecessors, (157), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:20,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:20,673 INFO L93 Difference]: Finished difference Result 176 states and 238 transitions. [2022-04-28 03:46:20,673 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 238 transitions. [2022-04-28 03:46:20,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:46:20,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:46:20,674 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 113 states have (on average 1.3893805309734513) internal successors, (157), 113 states have internal predecessors, (157), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 176 states. [2022-04-28 03:46:20,674 INFO L87 Difference]: Start difference. First operand has 118 states, 113 states have (on average 1.3893805309734513) internal successors, (157), 113 states have internal predecessors, (157), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 176 states. [2022-04-28 03:46:20,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:20,676 INFO L93 Difference]: Finished difference Result 176 states and 238 transitions. [2022-04-28 03:46:20,676 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 238 transitions. [2022-04-28 03:46:20,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:46:20,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:46:20,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:46:20,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:46:20,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.3893805309734513) internal successors, (157), 113 states have internal predecessors, (157), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:20,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 161 transitions. [2022-04-28 03:46:20,678 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 161 transitions. Word has length 29 [2022-04-28 03:46:20,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:46:20,678 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 161 transitions. [2022-04-28 03:46:20,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:20,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 161 transitions. [2022-04-28 03:46:33,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 157 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 03:46:33,657 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 161 transitions. [2022-04-28 03:46:33,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 03:46:33,657 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:46:33,657 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:46:33,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-28 03:46:33,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:46:33,858 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:46:33,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:46:33,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1709448743, now seen corresponding path program 4 times [2022-04-28 03:46:33,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:46:33,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2146317830] [2022-04-28 03:46:34,154 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:46:34,155 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:46:34,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1023369335, now seen corresponding path program 1 times [2022-04-28 03:46:34,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:46:34,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96845133] [2022-04-28 03:46:34,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:46:34,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:46:34,165 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_24.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:46:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:34,189 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_24.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:46:34,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:46:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:34,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {13530#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13519#true} is VALID [2022-04-28 03:46:34,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {13519#true} assume true; {13519#true} is VALID [2022-04-28 03:46:34,418 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13519#true} {13519#true} #94#return; {13519#true} is VALID [2022-04-28 03:46:34,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {13519#true} call ULTIMATE.init(); {13530#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:46:34,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {13530#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13519#true} is VALID [2022-04-28 03:46:34,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {13519#true} assume true; {13519#true} is VALID [2022-04-28 03:46:34,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13519#true} {13519#true} #94#return; {13519#true} is VALID [2022-04-28 03:46:34,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {13519#true} call #t~ret17 := main(); {13519#true} is VALID [2022-04-28 03:46:34,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {13519#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13519#true} is VALID [2022-04-28 03:46:34,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {13519#true} [144] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_264 4294967296)) (.cse1 (= v_main_~x~0_264 v_main_~x~0_263)) (.cse2 (= v_main_~y~0_289 v_main_~y~0_288)) (.cse3 (= |v_main_#t~post5_121| |v_main_#t~post5_120|)) (.cse4 (= |v_main_#t~post6_121| |v_main_#t~post6_120|))) (or (and (< 0 .cse0) (< v_main_~y~0_289 v_main_~y~0_288) (forall ((v_it_24 Int)) (or (not (<= (+ v_main_~y~0_289 v_it_24 1) v_main_~y~0_288)) (< 0 (mod (+ v_main_~x~0_264 (* 4294967295 v_it_24)) 4294967296)) (not (<= 1 v_it_24)))) (= v_main_~x~0_263 (+ v_main_~x~0_264 v_main_~y~0_289 (* (- 1) v_main_~y~0_288)))) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_289, main_#t~post5=|v_main_#t~post5_121|, main_~x~0=v_main_~x~0_264, main_#t~post6=|v_main_#t~post6_121|} OutVars{main_~y~0=v_main_~y~0_288, main_#t~post5=|v_main_#t~post5_120|, main_~x~0=v_main_~x~0_263, main_#t~post6=|v_main_#t~post6_120|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13519#true} is VALID [2022-04-28 03:46:34,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {13519#true} [143] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {13524#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:46:34,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {13524#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {13524#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:46:34,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {13524#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13525#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:46:34,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {13525#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13526#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:34,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {13526#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13527#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:34,424 INFO L290 TraceCheckUtils]: 12: Hoare triple {13527#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13528#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:34,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {13528#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {13528#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:34,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {13528#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13528#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:34,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {13528#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13528#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:34,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {13528#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {13528#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:34,427 INFO L290 TraceCheckUtils]: 17: Hoare triple {13528#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13529#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:46:34,427 INFO L290 TraceCheckUtils]: 18: Hoare triple {13529#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {13520#false} is VALID [2022-04-28 03:46:34,427 INFO L290 TraceCheckUtils]: 19: Hoare triple {13520#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13520#false} is VALID [2022-04-28 03:46:34,428 INFO L290 TraceCheckUtils]: 20: Hoare triple {13520#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13520#false} is VALID [2022-04-28 03:46:34,428 INFO L290 TraceCheckUtils]: 21: Hoare triple {13520#false} assume !(~z~0 % 4294967296 > 0); {13520#false} is VALID [2022-04-28 03:46:34,428 INFO L290 TraceCheckUtils]: 22: Hoare triple {13520#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {13520#false} is VALID [2022-04-28 03:46:34,428 INFO L290 TraceCheckUtils]: 23: Hoare triple {13520#false} assume !(~y~0 % 4294967296 > 0); {13520#false} is VALID [2022-04-28 03:46:34,428 INFO L272 TraceCheckUtils]: 24: Hoare triple {13520#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13520#false} is VALID [2022-04-28 03:46:34,428 INFO L290 TraceCheckUtils]: 25: Hoare triple {13520#false} ~cond := #in~cond; {13520#false} is VALID [2022-04-28 03:46:34,428 INFO L290 TraceCheckUtils]: 26: Hoare triple {13520#false} assume 0 == ~cond; {13520#false} is VALID [2022-04-28 03:46:34,428 INFO L290 TraceCheckUtils]: 27: Hoare triple {13520#false} assume !false; {13520#false} is VALID [2022-04-28 03:46:34,428 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-28 03:46:34,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:46:34,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96845133] [2022-04-28 03:46:34,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96845133] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:46:34,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672643229] [2022-04-28 03:46:34,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:46:34,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:46:34,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:46:34,431 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:46:34,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 03:46:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:34,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:46:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:34,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:46:34,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {13519#true} call ULTIMATE.init(); {13519#true} is VALID [2022-04-28 03:46:34,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {13519#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13519#true} is VALID [2022-04-28 03:46:34,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {13519#true} assume true; {13519#true} is VALID [2022-04-28 03:46:34,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13519#true} {13519#true} #94#return; {13519#true} is VALID [2022-04-28 03:46:34,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {13519#true} call #t~ret17 := main(); {13519#true} is VALID [2022-04-28 03:46:34,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {13519#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13519#true} is VALID [2022-04-28 03:46:34,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {13519#true} [144] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_264 4294967296)) (.cse1 (= v_main_~x~0_264 v_main_~x~0_263)) (.cse2 (= v_main_~y~0_289 v_main_~y~0_288)) (.cse3 (= |v_main_#t~post5_121| |v_main_#t~post5_120|)) (.cse4 (= |v_main_#t~post6_121| |v_main_#t~post6_120|))) (or (and (< 0 .cse0) (< v_main_~y~0_289 v_main_~y~0_288) (forall ((v_it_24 Int)) (or (not (<= (+ v_main_~y~0_289 v_it_24 1) v_main_~y~0_288)) (< 0 (mod (+ v_main_~x~0_264 (* 4294967295 v_it_24)) 4294967296)) (not (<= 1 v_it_24)))) (= v_main_~x~0_263 (+ v_main_~x~0_264 v_main_~y~0_289 (* (- 1) v_main_~y~0_288)))) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_289, main_#t~post5=|v_main_#t~post5_121|, main_~x~0=v_main_~x~0_264, main_#t~post6=|v_main_#t~post6_121|} OutVars{main_~y~0=v_main_~y~0_288, main_#t~post5=|v_main_#t~post5_120|, main_~x~0=v_main_~x~0_263, main_#t~post6=|v_main_#t~post6_120|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13519#true} is VALID [2022-04-28 03:46:34,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {13519#true} [143] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {13519#true} is VALID [2022-04-28 03:46:34,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {13519#true} ~z~0 := ~y~0; {13558#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:46:34,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {13558#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13562#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:46:34,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {13562#(= main_~y~0 (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13566#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:46:34,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {13566#(= main_~y~0 (+ main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13570#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-28 03:46:34,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {13570#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13574#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} is VALID [2022-04-28 03:46:34,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {13574#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} assume !(~z~0 % 4294967296 > 0); {13574#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} is VALID [2022-04-28 03:46:34,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {13574#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13566#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:46:34,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {13566#(= main_~y~0 (+ main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13558#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:46:34,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {13558#(= main_~z~0 main_~y~0)} assume !(~y~0 % 4294967296 > 0); {13587#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:46:34,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {13587#(not (< 0 (mod main_~z~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13587#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:46:34,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {13587#(not (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {13587#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:46:34,947 INFO L290 TraceCheckUtils]: 19: Hoare triple {13587#(not (< 0 (mod main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13520#false} is VALID [2022-04-28 03:46:34,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {13520#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13520#false} is VALID [2022-04-28 03:46:34,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {13520#false} assume !(~z~0 % 4294967296 > 0); {13520#false} is VALID [2022-04-28 03:46:34,947 INFO L290 TraceCheckUtils]: 22: Hoare triple {13520#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {13520#false} is VALID [2022-04-28 03:46:34,947 INFO L290 TraceCheckUtils]: 23: Hoare triple {13520#false} assume !(~y~0 % 4294967296 > 0); {13520#false} is VALID [2022-04-28 03:46:34,947 INFO L272 TraceCheckUtils]: 24: Hoare triple {13520#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13520#false} is VALID [2022-04-28 03:46:34,947 INFO L290 TraceCheckUtils]: 25: Hoare triple {13520#false} ~cond := #in~cond; {13520#false} is VALID [2022-04-28 03:46:34,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {13520#false} assume 0 == ~cond; {13520#false} is VALID [2022-04-28 03:46:34,947 INFO L290 TraceCheckUtils]: 27: Hoare triple {13520#false} assume !false; {13520#false} is VALID [2022-04-28 03:46:34,948 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:46:34,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:46:35,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {13520#false} assume !false; {13520#false} is VALID [2022-04-28 03:46:35,676 INFO L290 TraceCheckUtils]: 26: Hoare triple {13520#false} assume 0 == ~cond; {13520#false} is VALID [2022-04-28 03:46:35,676 INFO L290 TraceCheckUtils]: 25: Hoare triple {13520#false} ~cond := #in~cond; {13520#false} is VALID [2022-04-28 03:46:35,676 INFO L272 TraceCheckUtils]: 24: Hoare triple {13520#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13520#false} is VALID [2022-04-28 03:46:35,676 INFO L290 TraceCheckUtils]: 23: Hoare triple {13520#false} assume !(~y~0 % 4294967296 > 0); {13520#false} is VALID [2022-04-28 03:46:35,676 INFO L290 TraceCheckUtils]: 22: Hoare triple {13520#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {13520#false} is VALID [2022-04-28 03:46:35,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {13520#false} assume !(~z~0 % 4294967296 > 0); {13520#false} is VALID [2022-04-28 03:46:35,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {13520#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13520#false} is VALID [2022-04-28 03:46:35,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {13587#(not (< 0 (mod main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13520#false} is VALID [2022-04-28 03:46:35,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {13587#(not (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {13587#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:46:35,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {13587#(not (< 0 (mod main_~z~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13587#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:46:35,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {13654#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {13587#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:46:35,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {13658#(or (not (< 0 (mod (+ main_~z~0 1) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13654#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:46:35,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {13662#(or (not (< 0 (mod (+ main_~z~0 2) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13658#(or (not (< 0 (mod (+ main_~z~0 1) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:46:35,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {13662#(or (not (< 0 (mod (+ main_~z~0 2) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {13662#(or (not (< 0 (mod (+ main_~z~0 2) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:46:35,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {13669#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 1) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13662#(or (not (< 0 (mod (+ main_~z~0 2) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:46:35,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {13673#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13669#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 1) 4294967296))))} is VALID [2022-04-28 03:46:35,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {13677#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13673#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:46:35,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {13681#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13677#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:46:35,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {13519#true} ~z~0 := ~y~0; {13681#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 03:46:35,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {13519#true} [143] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {13519#true} is VALID [2022-04-28 03:46:35,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {13519#true} [144] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_264 4294967296)) (.cse1 (= v_main_~x~0_264 v_main_~x~0_263)) (.cse2 (= v_main_~y~0_289 v_main_~y~0_288)) (.cse3 (= |v_main_#t~post5_121| |v_main_#t~post5_120|)) (.cse4 (= |v_main_#t~post6_121| |v_main_#t~post6_120|))) (or (and (< 0 .cse0) (< v_main_~y~0_289 v_main_~y~0_288) (forall ((v_it_24 Int)) (or (not (<= (+ v_main_~y~0_289 v_it_24 1) v_main_~y~0_288)) (< 0 (mod (+ v_main_~x~0_264 (* 4294967295 v_it_24)) 4294967296)) (not (<= 1 v_it_24)))) (= v_main_~x~0_263 (+ v_main_~x~0_264 v_main_~y~0_289 (* (- 1) v_main_~y~0_288)))) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_289, main_#t~post5=|v_main_#t~post5_121|, main_~x~0=v_main_~x~0_264, main_#t~post6=|v_main_#t~post6_121|} OutVars{main_~y~0=v_main_~y~0_288, main_#t~post5=|v_main_#t~post5_120|, main_~x~0=v_main_~x~0_263, main_#t~post6=|v_main_#t~post6_120|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13519#true} is VALID [2022-04-28 03:46:35,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {13519#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13519#true} is VALID [2022-04-28 03:46:35,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {13519#true} call #t~ret17 := main(); {13519#true} is VALID [2022-04-28 03:46:35,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13519#true} {13519#true} #94#return; {13519#true} is VALID [2022-04-28 03:46:35,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {13519#true} assume true; {13519#true} is VALID [2022-04-28 03:46:35,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {13519#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13519#true} is VALID [2022-04-28 03:46:35,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {13519#true} call ULTIMATE.init(); {13519#true} is VALID [2022-04-28 03:46:35,687 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:46:35,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672643229] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:46:35,687 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:46:35,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 10] total 22 [2022-04-28 03:46:35,914 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:46:35,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2146317830] [2022-04-28 03:46:35,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2146317830] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:46:35,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:46:35,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:46:35,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397886106] [2022-04-28 03:46:35,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:46:35,914 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 03:46:35,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:46:35,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:35,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:46:35,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 03:46:35,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:46:35,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 03:46:35,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2022-04-28 03:46:35,938 INFO L87 Difference]: Start difference. First operand 118 states and 161 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:40,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:40,532 INFO L93 Difference]: Finished difference Result 299 states and 427 transitions. [2022-04-28 03:46:40,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 03:46:40,532 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 03:46:40,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:46:40,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:40,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 118 transitions. [2022-04-28 03:46:40,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:40,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 118 transitions. [2022-04-28 03:46:40,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 118 transitions. [2022-04-28 03:46:40,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:46:40,665 INFO L225 Difference]: With dead ends: 299 [2022-04-28 03:46:40,665 INFO L226 Difference]: Without dead ends: 266 [2022-04-28 03:46:40,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 03:46:40,666 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 168 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:46:40,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 57 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 03:46:40,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-04-28 03:46:41,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 143. [2022-04-28 03:46:41,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:46:41,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 266 states. Second operand has 143 states, 138 states have (on average 1.355072463768116) internal successors, (187), 138 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:41,652 INFO L74 IsIncluded]: Start isIncluded. First operand 266 states. Second operand has 143 states, 138 states have (on average 1.355072463768116) internal successors, (187), 138 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:41,652 INFO L87 Difference]: Start difference. First operand 266 states. Second operand has 143 states, 138 states have (on average 1.355072463768116) internal successors, (187), 138 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:41,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:41,655 INFO L93 Difference]: Finished difference Result 266 states and 371 transitions. [2022-04-28 03:46:41,655 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 371 transitions. [2022-04-28 03:46:41,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:46:41,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:46:41,656 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 138 states have (on average 1.355072463768116) internal successors, (187), 138 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 266 states. [2022-04-28 03:46:41,656 INFO L87 Difference]: Start difference. First operand has 143 states, 138 states have (on average 1.355072463768116) internal successors, (187), 138 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 266 states. [2022-04-28 03:46:41,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:41,659 INFO L93 Difference]: Finished difference Result 266 states and 371 transitions. [2022-04-28 03:46:41,659 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 371 transitions. [2022-04-28 03:46:41,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:46:41,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:46:41,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:46:41,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:46:41,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.355072463768116) internal successors, (187), 138 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:41,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 191 transitions. [2022-04-28 03:46:41,661 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 191 transitions. Word has length 29 [2022-04-28 03:46:41,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:46:41,661 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 191 transitions. [2022-04-28 03:46:41,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:41,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 143 states and 191 transitions. [2022-04-28 03:46:56,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 186 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-28 03:46:56,400 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 191 transitions. [2022-04-28 03:46:56,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 03:46:56,400 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:46:56,401 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:46:56,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 03:46:56,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:46:56,615 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:46:56,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:46:56,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1414418204, now seen corresponding path program 5 times [2022-04-28 03:46:56,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:46:56,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1204199117] [2022-04-28 03:46:56,888 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:46:56,889 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:46:56,891 INFO L85 PathProgramCache]: Analyzing trace with hash 111979974, now seen corresponding path program 1 times [2022-04-28 03:46:56,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:46:56,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128566881] [2022-04-28 03:46:56,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:46:56,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:46:56,908 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_25.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:46:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:56,919 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_25.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:46:57,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:46:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:57,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {15157#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15149#true} is VALID [2022-04-28 03:46:57,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {15149#true} assume true; {15149#true} is VALID [2022-04-28 03:46:57,041 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15149#true} {15149#true} #94#return; {15149#true} is VALID [2022-04-28 03:46:57,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {15149#true} call ULTIMATE.init(); {15157#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:46:57,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {15157#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15149#true} is VALID [2022-04-28 03:46:57,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {15149#true} assume true; {15149#true} is VALID [2022-04-28 03:46:57,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15149#true} {15149#true} #94#return; {15149#true} is VALID [2022-04-28 03:46:57,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {15149#true} call #t~ret17 := main(); {15149#true} is VALID [2022-04-28 03:46:57,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {15149#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15149#true} is VALID [2022-04-28 03:46:57,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {15149#true} [146] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_303 v_main_~y~0_302)) (.cse4 (mod v_main_~x~0_279 4294967296)) (.cse1 (= |v_main_#t~post5_126| |v_main_#t~post5_125|)) (.cse2 (= |v_main_#t~post6_126| |v_main_#t~post6_125|)) (.cse3 (= v_main_~x~0_279 v_main_~x~0_278))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= v_main_~y~0_302 (+ v_main_~x~0_279 v_main_~y~0_303 (* v_main_~x~0_278 (- 1)))) (< 0 .cse4) (< v_main_~x~0_278 v_main_~x~0_279) (forall ((v_it_25 Int)) (or (< 0 (mod (+ v_main_~x~0_279 (* 4294967295 v_it_25)) 4294967296)) (not (<= (+ v_main_~x~0_278 v_it_25 1) v_main_~x~0_279)) (not (<= 1 v_it_25))))) (and .cse0 (<= .cse4 0) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_303, main_#t~post5=|v_main_#t~post5_126|, main_~x~0=v_main_~x~0_279, main_#t~post6=|v_main_#t~post6_126|} OutVars{main_~y~0=v_main_~y~0_302, main_#t~post5=|v_main_#t~post5_125|, main_~x~0=v_main_~x~0_278, main_#t~post6=|v_main_#t~post6_125|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15149#true} is VALID [2022-04-28 03:46:57,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {15149#true} [145] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {15149#true} is VALID [2022-04-28 03:46:57,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {15149#true} ~z~0 := ~y~0; {15149#true} is VALID [2022-04-28 03:46:57,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {15149#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15149#true} is VALID [2022-04-28 03:46:57,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {15149#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15149#true} is VALID [2022-04-28 03:46:57,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {15149#true} assume !(~z~0 % 4294967296 > 0); {15154#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 03:46:57,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {15154#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15155#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-28 03:46:57,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {15155#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15156#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:46:57,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {15156#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !(~y~0 % 4294967296 > 0); {15156#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:46:57,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {15156#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15156#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:46:57,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {15156#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15156#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:46:57,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {15156#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !(~x~0 % 4294967296 > 0); {15156#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:46:57,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {15156#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15155#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-28 03:46:57,049 INFO L290 TraceCheckUtils]: 19: Hoare triple {15155#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15154#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 03:46:57,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {15154#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15150#false} is VALID [2022-04-28 03:46:57,050 INFO L290 TraceCheckUtils]: 21: Hoare triple {15150#false} assume !(~z~0 % 4294967296 > 0); {15150#false} is VALID [2022-04-28 03:46:57,050 INFO L290 TraceCheckUtils]: 22: Hoare triple {15150#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {15150#false} is VALID [2022-04-28 03:46:57,050 INFO L290 TraceCheckUtils]: 23: Hoare triple {15150#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {15150#false} is VALID [2022-04-28 03:46:57,050 INFO L290 TraceCheckUtils]: 24: Hoare triple {15150#false} assume !(~y~0 % 4294967296 > 0); {15150#false} is VALID [2022-04-28 03:46:57,050 INFO L272 TraceCheckUtils]: 25: Hoare triple {15150#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15150#false} is VALID [2022-04-28 03:46:57,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {15150#false} ~cond := #in~cond; {15150#false} is VALID [2022-04-28 03:46:57,050 INFO L290 TraceCheckUtils]: 27: Hoare triple {15150#false} assume 0 == ~cond; {15150#false} is VALID [2022-04-28 03:46:57,050 INFO L290 TraceCheckUtils]: 28: Hoare triple {15150#false} assume !false; {15150#false} is VALID [2022-04-28 03:46:57,050 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 03:46:57,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:46:57,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128566881] [2022-04-28 03:46:57,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128566881] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:46:57,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884767415] [2022-04-28 03:46:57,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:46:57,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:46:57,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:46:57,052 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:46:57,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 03:46:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:57,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:46:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:57,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:46:57,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {15149#true} call ULTIMATE.init(); {15149#true} is VALID [2022-04-28 03:46:57,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {15149#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15149#true} is VALID [2022-04-28 03:46:57,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {15149#true} assume true; {15149#true} is VALID [2022-04-28 03:46:57,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15149#true} {15149#true} #94#return; {15149#true} is VALID [2022-04-28 03:46:57,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {15149#true} call #t~ret17 := main(); {15149#true} is VALID [2022-04-28 03:46:57,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {15149#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15149#true} is VALID [2022-04-28 03:46:57,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {15149#true} [146] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_303 v_main_~y~0_302)) (.cse4 (mod v_main_~x~0_279 4294967296)) (.cse1 (= |v_main_#t~post5_126| |v_main_#t~post5_125|)) (.cse2 (= |v_main_#t~post6_126| |v_main_#t~post6_125|)) (.cse3 (= v_main_~x~0_279 v_main_~x~0_278))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= v_main_~y~0_302 (+ v_main_~x~0_279 v_main_~y~0_303 (* v_main_~x~0_278 (- 1)))) (< 0 .cse4) (< v_main_~x~0_278 v_main_~x~0_279) (forall ((v_it_25 Int)) (or (< 0 (mod (+ v_main_~x~0_279 (* 4294967295 v_it_25)) 4294967296)) (not (<= (+ v_main_~x~0_278 v_it_25 1) v_main_~x~0_279)) (not (<= 1 v_it_25))))) (and .cse0 (<= .cse4 0) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_303, main_#t~post5=|v_main_#t~post5_126|, main_~x~0=v_main_~x~0_279, main_#t~post6=|v_main_#t~post6_126|} OutVars{main_~y~0=v_main_~y~0_302, main_#t~post5=|v_main_#t~post5_125|, main_~x~0=v_main_~x~0_278, main_#t~post6=|v_main_#t~post6_125|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15149#true} is VALID [2022-04-28 03:46:57,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {15149#true} [145] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {15149#true} is VALID [2022-04-28 03:46:57,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {15149#true} ~z~0 := ~y~0; {15185#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:46:57,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {15185#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15189#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:46:57,639 INFO L290 TraceCheckUtils]: 10: Hoare triple {15189#(= main_~y~0 (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15193#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:46:57,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {15193#(= main_~y~0 (+ main_~z~0 2))} assume !(~z~0 % 4294967296 > 0); {15193#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:46:57,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {15193#(= main_~y~0 (+ main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15185#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:46:57,641 INFO L290 TraceCheckUtils]: 13: Hoare triple {15185#(= main_~z~0 main_~y~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15203#(= (+ main_~y~0 2) main_~z~0)} is VALID [2022-04-28 03:46:57,641 INFO L290 TraceCheckUtils]: 14: Hoare triple {15203#(= (+ main_~y~0 2) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {15156#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:46:57,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {15156#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15156#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:46:57,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {15156#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15156#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:46:57,642 INFO L290 TraceCheckUtils]: 17: Hoare triple {15156#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !(~x~0 % 4294967296 > 0); {15156#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:46:57,643 INFO L290 TraceCheckUtils]: 18: Hoare triple {15156#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15155#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-28 03:46:57,644 INFO L290 TraceCheckUtils]: 19: Hoare triple {15155#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15154#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 03:46:57,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {15154#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15150#false} is VALID [2022-04-28 03:46:57,645 INFO L290 TraceCheckUtils]: 21: Hoare triple {15150#false} assume !(~z~0 % 4294967296 > 0); {15150#false} is VALID [2022-04-28 03:46:57,645 INFO L290 TraceCheckUtils]: 22: Hoare triple {15150#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {15150#false} is VALID [2022-04-28 03:46:57,645 INFO L290 TraceCheckUtils]: 23: Hoare triple {15150#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {15150#false} is VALID [2022-04-28 03:46:57,645 INFO L290 TraceCheckUtils]: 24: Hoare triple {15150#false} assume !(~y~0 % 4294967296 > 0); {15150#false} is VALID [2022-04-28 03:46:57,645 INFO L272 TraceCheckUtils]: 25: Hoare triple {15150#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15150#false} is VALID [2022-04-28 03:46:57,645 INFO L290 TraceCheckUtils]: 26: Hoare triple {15150#false} ~cond := #in~cond; {15150#false} is VALID [2022-04-28 03:46:57,645 INFO L290 TraceCheckUtils]: 27: Hoare triple {15150#false} assume 0 == ~cond; {15150#false} is VALID [2022-04-28 03:46:57,645 INFO L290 TraceCheckUtils]: 28: Hoare triple {15150#false} assume !false; {15150#false} is VALID [2022-04-28 03:46:57,646 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:46:57,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:46:58,541 INFO L290 TraceCheckUtils]: 28: Hoare triple {15150#false} assume !false; {15150#false} is VALID [2022-04-28 03:46:58,541 INFO L290 TraceCheckUtils]: 27: Hoare triple {15150#false} assume 0 == ~cond; {15150#false} is VALID [2022-04-28 03:46:58,541 INFO L290 TraceCheckUtils]: 26: Hoare triple {15150#false} ~cond := #in~cond; {15150#false} is VALID [2022-04-28 03:46:58,541 INFO L272 TraceCheckUtils]: 25: Hoare triple {15150#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15150#false} is VALID [2022-04-28 03:46:58,541 INFO L290 TraceCheckUtils]: 24: Hoare triple {15150#false} assume !(~y~0 % 4294967296 > 0); {15150#false} is VALID [2022-04-28 03:46:58,542 INFO L290 TraceCheckUtils]: 23: Hoare triple {15150#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {15150#false} is VALID [2022-04-28 03:46:58,542 INFO L290 TraceCheckUtils]: 22: Hoare triple {15150#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {15150#false} is VALID [2022-04-28 03:46:58,542 INFO L290 TraceCheckUtils]: 21: Hoare triple {15150#false} assume !(~z~0 % 4294967296 > 0); {15150#false} is VALID [2022-04-28 03:46:58,542 INFO L290 TraceCheckUtils]: 20: Hoare triple {15154#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15150#false} is VALID [2022-04-28 03:46:58,543 INFO L290 TraceCheckUtils]: 19: Hoare triple {15155#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15154#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 03:46:58,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {15156#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15155#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-28 03:46:58,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {15156#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !(~x~0 % 4294967296 > 0); {15156#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:46:58,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {15156#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15156#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:46:58,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {15156#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15156#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:46:58,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {15291#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2)) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {15156#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:46:58,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {15295#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15291#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:46:58,550 INFO L290 TraceCheckUtils]: 12: Hoare triple {15299#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15295#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:46:58,550 INFO L290 TraceCheckUtils]: 11: Hoare triple {15299#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {15299#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:58,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {15306#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15299#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:58,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {15310#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2)) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15306#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1)))} is VALID [2022-04-28 03:46:58,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {15149#true} ~z~0 := ~y~0; {15310#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2)) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:46:58,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {15149#true} [145] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {15149#true} is VALID [2022-04-28 03:46:58,553 INFO L290 TraceCheckUtils]: 6: Hoare triple {15149#true} [146] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_303 v_main_~y~0_302)) (.cse4 (mod v_main_~x~0_279 4294967296)) (.cse1 (= |v_main_#t~post5_126| |v_main_#t~post5_125|)) (.cse2 (= |v_main_#t~post6_126| |v_main_#t~post6_125|)) (.cse3 (= v_main_~x~0_279 v_main_~x~0_278))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= v_main_~y~0_302 (+ v_main_~x~0_279 v_main_~y~0_303 (* v_main_~x~0_278 (- 1)))) (< 0 .cse4) (< v_main_~x~0_278 v_main_~x~0_279) (forall ((v_it_25 Int)) (or (< 0 (mod (+ v_main_~x~0_279 (* 4294967295 v_it_25)) 4294967296)) (not (<= (+ v_main_~x~0_278 v_it_25 1) v_main_~x~0_279)) (not (<= 1 v_it_25))))) (and .cse0 (<= .cse4 0) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_303, main_#t~post5=|v_main_#t~post5_126|, main_~x~0=v_main_~x~0_279, main_#t~post6=|v_main_#t~post6_126|} OutVars{main_~y~0=v_main_~y~0_302, main_#t~post5=|v_main_#t~post5_125|, main_~x~0=v_main_~x~0_278, main_#t~post6=|v_main_#t~post6_125|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15149#true} is VALID [2022-04-28 03:46:58,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {15149#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15149#true} is VALID [2022-04-28 03:46:58,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {15149#true} call #t~ret17 := main(); {15149#true} is VALID [2022-04-28 03:46:58,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15149#true} {15149#true} #94#return; {15149#true} is VALID [2022-04-28 03:46:58,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {15149#true} assume true; {15149#true} is VALID [2022-04-28 03:46:58,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {15149#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15149#true} is VALID [2022-04-28 03:46:58,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {15149#true} call ULTIMATE.init(); {15149#true} is VALID [2022-04-28 03:46:58,554 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:46:58,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884767415] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:46:58,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:46:58,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 10] total 15 [2022-04-28 03:46:58,715 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:46:58,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1204199117] [2022-04-28 03:46:58,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1204199117] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:46:58,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:46:58,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:46:58,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092955032] [2022-04-28 03:46:58,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:46:58,716 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 03:46:58,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:46:58,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:58,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:46:58,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:46:58,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:46:58,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:46:58,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-04-28 03:46:58,754 INFO L87 Difference]: Start difference. First operand 143 states and 191 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:02,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:02,256 INFO L93 Difference]: Finished difference Result 225 states and 304 transitions. [2022-04-28 03:47:02,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 03:47:02,256 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 03:47:02,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:47:02,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:02,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 90 transitions. [2022-04-28 03:47:02,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:02,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 90 transitions. [2022-04-28 03:47:02,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 90 transitions. [2022-04-28 03:47:02,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:47:02,366 INFO L225 Difference]: With dead ends: 225 [2022-04-28 03:47:02,367 INFO L226 Difference]: Without dead ends: 201 [2022-04-28 03:47:02,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2022-04-28 03:47:02,367 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 62 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:47:02,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 49 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:47:02,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-04-28 03:47:03,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 152. [2022-04-28 03:47:03,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:47:03,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 201 states. Second operand has 152 states, 147 states have (on average 1.3197278911564625) internal successors, (194), 147 states have internal predecessors, (194), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:03,466 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand has 152 states, 147 states have (on average 1.3197278911564625) internal successors, (194), 147 states have internal predecessors, (194), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:03,466 INFO L87 Difference]: Start difference. First operand 201 states. Second operand has 152 states, 147 states have (on average 1.3197278911564625) internal successors, (194), 147 states have internal predecessors, (194), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:03,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:03,468 INFO L93 Difference]: Finished difference Result 201 states and 268 transitions. [2022-04-28 03:47:03,468 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 268 transitions. [2022-04-28 03:47:03,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:47:03,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:47:03,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 147 states have (on average 1.3197278911564625) internal successors, (194), 147 states have internal predecessors, (194), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 201 states. [2022-04-28 03:47:03,469 INFO L87 Difference]: Start difference. First operand has 152 states, 147 states have (on average 1.3197278911564625) internal successors, (194), 147 states have internal predecessors, (194), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 201 states. [2022-04-28 03:47:03,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:03,471 INFO L93 Difference]: Finished difference Result 201 states and 268 transitions. [2022-04-28 03:47:03,471 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 268 transitions. [2022-04-28 03:47:03,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:47:03,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:47:03,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:47:03,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:47:03,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 147 states have (on average 1.3197278911564625) internal successors, (194), 147 states have internal predecessors, (194), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:03,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 198 transitions. [2022-04-28 03:47:03,473 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 198 transitions. Word has length 30 [2022-04-28 03:47:03,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:47:03,473 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 198 transitions. [2022-04-28 03:47:03,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:03,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 152 states and 198 transitions. [2022-04-28 03:47:20,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 193 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-28 03:47:20,171 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 198 transitions. [2022-04-28 03:47:20,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 03:47:20,172 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:47:20,172 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:47:20,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-28 03:47:20,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-28 03:47:20,379 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:47:20,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:47:20,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1181811755, now seen corresponding path program 6 times [2022-04-28 03:47:20,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:47:20,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [491853076] [2022-04-28 03:47:20,677 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:47:20,678 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:47:20,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1241997193, now seen corresponding path program 1 times [2022-04-28 03:47:20,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:47:20,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65010831] [2022-04-28 03:47:20,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:47:20,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:47:20,688 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_26.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:47:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:20,698 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_26.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:47:20,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:47:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:20,969 INFO L290 TraceCheckUtils]: 0: Hoare triple {16533#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16522#true} is VALID [2022-04-28 03:47:20,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {16522#true} assume true; {16522#true} is VALID [2022-04-28 03:47:20,969 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16522#true} {16522#true} #94#return; {16522#true} is VALID [2022-04-28 03:47:20,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {16522#true} call ULTIMATE.init(); {16533#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:47:20,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {16533#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16522#true} is VALID [2022-04-28 03:47:20,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {16522#true} assume true; {16522#true} is VALID [2022-04-28 03:47:20,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16522#true} {16522#true} #94#return; {16522#true} is VALID [2022-04-28 03:47:20,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {16522#true} call #t~ret17 := main(); {16522#true} is VALID [2022-04-28 03:47:20,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {16522#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16522#true} is VALID [2022-04-28 03:47:20,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {16522#true} [148] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_295 4294967296)) (.cse1 (= |v_main_#t~post6_131| |v_main_#t~post6_130|)) (.cse2 (= v_main_~x~0_295 v_main_~x~0_294)) (.cse3 (= v_main_~y~0_319 v_main_~y~0_318)) (.cse4 (= |v_main_#t~post5_131| |v_main_#t~post5_130|))) (or (and (< 0 .cse0) (< v_main_~y~0_319 v_main_~y~0_318) (forall ((v_it_26 Int)) (or (not (<= 1 v_it_26)) (not (<= (+ v_main_~y~0_319 v_it_26 1) v_main_~y~0_318)) (< 0 (mod (+ v_main_~x~0_295 (* 4294967295 v_it_26)) 4294967296)))) (= v_main_~x~0_294 (+ v_main_~x~0_295 v_main_~y~0_319 (* (- 1) v_main_~y~0_318)))) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_319, main_#t~post5=|v_main_#t~post5_131|, main_~x~0=v_main_~x~0_295, main_#t~post6=|v_main_#t~post6_131|} OutVars{main_~y~0=v_main_~y~0_318, main_#t~post5=|v_main_#t~post5_130|, main_~x~0=v_main_~x~0_294, main_#t~post6=|v_main_#t~post6_130|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16522#true} is VALID [2022-04-28 03:47:20,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {16522#true} [147] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {16522#true} is VALID [2022-04-28 03:47:20,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {16522#true} ~z~0 := ~y~0; {16527#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:47:20,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {16527#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16528#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:47:20,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {16528#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16529#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:47:20,974 INFO L290 TraceCheckUtils]: 11: Hoare triple {16529#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16530#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:47:20,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {16530#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {16530#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:47:20,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {16530#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16531#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:47:20,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {16531#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16532#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:47:20,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {16532#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {16523#false} is VALID [2022-04-28 03:47:20,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {16523#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {16523#false} is VALID [2022-04-28 03:47:20,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {16523#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {16523#false} is VALID [2022-04-28 03:47:20,977 INFO L290 TraceCheckUtils]: 18: Hoare triple {16523#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {16523#false} is VALID [2022-04-28 03:47:20,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {16523#false} assume !(~x~0 % 4294967296 > 0); {16523#false} is VALID [2022-04-28 03:47:20,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {16523#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {16523#false} is VALID [2022-04-28 03:47:20,977 INFO L290 TraceCheckUtils]: 21: Hoare triple {16523#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {16523#false} is VALID [2022-04-28 03:47:20,977 INFO L290 TraceCheckUtils]: 22: Hoare triple {16523#false} assume !(~z~0 % 4294967296 > 0); {16523#false} is VALID [2022-04-28 03:47:20,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {16523#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {16523#false} is VALID [2022-04-28 03:47:20,977 INFO L290 TraceCheckUtils]: 24: Hoare triple {16523#false} assume !(~y~0 % 4294967296 > 0); {16523#false} is VALID [2022-04-28 03:47:20,977 INFO L272 TraceCheckUtils]: 25: Hoare triple {16523#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16523#false} is VALID [2022-04-28 03:47:20,978 INFO L290 TraceCheckUtils]: 26: Hoare triple {16523#false} ~cond := #in~cond; {16523#false} is VALID [2022-04-28 03:47:20,978 INFO L290 TraceCheckUtils]: 27: Hoare triple {16523#false} assume 0 == ~cond; {16523#false} is VALID [2022-04-28 03:47:20,978 INFO L290 TraceCheckUtils]: 28: Hoare triple {16523#false} assume !false; {16523#false} is VALID [2022-04-28 03:47:20,978 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:47:20,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:47:20,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65010831] [2022-04-28 03:47:20,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65010831] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:47:20,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683669942] [2022-04-28 03:47:20,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:47:20,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:47:20,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:47:20,979 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:47:20,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 03:47:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:21,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:47:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:21,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:47:21,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {16522#true} call ULTIMATE.init(); {16522#true} is VALID [2022-04-28 03:47:21,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {16522#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16522#true} is VALID [2022-04-28 03:47:21,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {16522#true} assume true; {16522#true} is VALID [2022-04-28 03:47:21,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16522#true} {16522#true} #94#return; {16522#true} is VALID [2022-04-28 03:47:21,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {16522#true} call #t~ret17 := main(); {16522#true} is VALID [2022-04-28 03:47:21,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {16522#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16522#true} is VALID [2022-04-28 03:47:21,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {16522#true} [148] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_295 4294967296)) (.cse1 (= |v_main_#t~post6_131| |v_main_#t~post6_130|)) (.cse2 (= v_main_~x~0_295 v_main_~x~0_294)) (.cse3 (= v_main_~y~0_319 v_main_~y~0_318)) (.cse4 (= |v_main_#t~post5_131| |v_main_#t~post5_130|))) (or (and (< 0 .cse0) (< v_main_~y~0_319 v_main_~y~0_318) (forall ((v_it_26 Int)) (or (not (<= 1 v_it_26)) (not (<= (+ v_main_~y~0_319 v_it_26 1) v_main_~y~0_318)) (< 0 (mod (+ v_main_~x~0_295 (* 4294967295 v_it_26)) 4294967296)))) (= v_main_~x~0_294 (+ v_main_~x~0_295 v_main_~y~0_319 (* (- 1) v_main_~y~0_318)))) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_319, main_#t~post5=|v_main_#t~post5_131|, main_~x~0=v_main_~x~0_295, main_#t~post6=|v_main_#t~post6_131|} OutVars{main_~y~0=v_main_~y~0_318, main_#t~post5=|v_main_#t~post5_130|, main_~x~0=v_main_~x~0_294, main_#t~post6=|v_main_#t~post6_130|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16522#true} is VALID [2022-04-28 03:47:21,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {16522#true} [147] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {16522#true} is VALID [2022-04-28 03:47:21,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {16522#true} ~z~0 := ~y~0; {16527#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:47:21,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {16527#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16528#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:47:21,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {16528#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16529#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:47:21,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {16529#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16570#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:47:21,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {16570#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {16570#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:47:21,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {16570#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16528#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:47:21,939 INFO L290 TraceCheckUtils]: 14: Hoare triple {16528#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16580#(and (<= (+ main_~y~0 1) main_~z~0) (<= main_~z~0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:47:21,940 INFO L290 TraceCheckUtils]: 15: Hoare triple {16580#(and (<= (+ main_~y~0 1) main_~z~0) (<= main_~z~0 (+ main_~y~0 1)))} assume !(~y~0 % 4294967296 > 0); {16584#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} is VALID [2022-04-28 03:47:21,941 INFO L290 TraceCheckUtils]: 16: Hoare triple {16584#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {16584#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} is VALID [2022-04-28 03:47:21,941 INFO L290 TraceCheckUtils]: 17: Hoare triple {16584#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {16584#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} is VALID [2022-04-28 03:47:21,941 INFO L290 TraceCheckUtils]: 18: Hoare triple {16584#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {16584#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} is VALID [2022-04-28 03:47:21,941 INFO L290 TraceCheckUtils]: 19: Hoare triple {16584#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {16584#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} is VALID [2022-04-28 03:47:21,943 INFO L290 TraceCheckUtils]: 20: Hoare triple {16584#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {16600#(<= (div (* (- 1) main_~z~0) (- 4294967296)) (div main_~z~0 4294967296))} is VALID [2022-04-28 03:47:21,944 INFO L290 TraceCheckUtils]: 21: Hoare triple {16600#(<= (div (* (- 1) main_~z~0) (- 4294967296)) (div main_~z~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {16523#false} is VALID [2022-04-28 03:47:21,944 INFO L290 TraceCheckUtils]: 22: Hoare triple {16523#false} assume !(~z~0 % 4294967296 > 0); {16523#false} is VALID [2022-04-28 03:47:21,944 INFO L290 TraceCheckUtils]: 23: Hoare triple {16523#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {16523#false} is VALID [2022-04-28 03:47:21,944 INFO L290 TraceCheckUtils]: 24: Hoare triple {16523#false} assume !(~y~0 % 4294967296 > 0); {16523#false} is VALID [2022-04-28 03:47:21,944 INFO L272 TraceCheckUtils]: 25: Hoare triple {16523#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16523#false} is VALID [2022-04-28 03:47:21,944 INFO L290 TraceCheckUtils]: 26: Hoare triple {16523#false} ~cond := #in~cond; {16523#false} is VALID [2022-04-28 03:47:21,944 INFO L290 TraceCheckUtils]: 27: Hoare triple {16523#false} assume 0 == ~cond; {16523#false} is VALID [2022-04-28 03:47:21,944 INFO L290 TraceCheckUtils]: 28: Hoare triple {16523#false} assume !false; {16523#false} is VALID [2022-04-28 03:47:21,944 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-28 03:47:21,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:47:23,128 INFO L290 TraceCheckUtils]: 28: Hoare triple {16523#false} assume !false; {16523#false} is VALID [2022-04-28 03:47:23,128 INFO L290 TraceCheckUtils]: 27: Hoare triple {16523#false} assume 0 == ~cond; {16523#false} is VALID [2022-04-28 03:47:23,128 INFO L290 TraceCheckUtils]: 26: Hoare triple {16523#false} ~cond := #in~cond; {16523#false} is VALID [2022-04-28 03:47:23,128 INFO L272 TraceCheckUtils]: 25: Hoare triple {16523#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16523#false} is VALID [2022-04-28 03:47:23,128 INFO L290 TraceCheckUtils]: 24: Hoare triple {16523#false} assume !(~y~0 % 4294967296 > 0); {16523#false} is VALID [2022-04-28 03:47:23,128 INFO L290 TraceCheckUtils]: 23: Hoare triple {16523#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {16523#false} is VALID [2022-04-28 03:47:23,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {16523#false} assume !(~z~0 % 4294967296 > 0); {16523#false} is VALID [2022-04-28 03:47:23,129 INFO L290 TraceCheckUtils]: 21: Hoare triple {16600#(<= (div (* (- 1) main_~z~0) (- 4294967296)) (div main_~z~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {16523#false} is VALID [2022-04-28 03:47:23,131 INFO L290 TraceCheckUtils]: 20: Hoare triple {16584#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {16600#(<= (div (* (- 1) main_~z~0) (- 4294967296)) (div main_~z~0 4294967296))} is VALID [2022-04-28 03:47:23,131 INFO L290 TraceCheckUtils]: 19: Hoare triple {16584#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {16584#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} is VALID [2022-04-28 03:47:23,132 INFO L290 TraceCheckUtils]: 18: Hoare triple {16584#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {16584#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} is VALID [2022-04-28 03:47:23,132 INFO L290 TraceCheckUtils]: 17: Hoare triple {16584#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {16584#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} is VALID [2022-04-28 03:47:23,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {16584#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {16584#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} is VALID [2022-04-28 03:47:23,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {16664#(or (<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296)) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {16584#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} is VALID [2022-04-28 03:47:23,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {16668#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= (div (* (- 1) main_~z~0) (- 4294967296)) (div main_~z~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16664#(or (<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:47:23,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {16672#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= (div (+ (- 1) (* (- 1) main_~z~0)) (- 4294967296)) (div (+ main_~z~0 1) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16668#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= (div (* (- 1) main_~z~0) (- 4294967296)) (div main_~z~0 4294967296)))} is VALID [2022-04-28 03:47:23,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {16672#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= (div (+ (- 1) (* (- 1) main_~z~0)) (- 4294967296)) (div (+ main_~z~0 1) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {16672#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= (div (+ (- 1) (* (- 1) main_~z~0)) (- 4294967296)) (div (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 03:47:23,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {16679#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= (div (* (- 1) main_~z~0) (- 4294967296)) (div main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16672#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= (div (+ (- 1) (* (- 1) main_~z~0)) (- 4294967296)) (div (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 03:47:23,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {16683#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16679#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= (div (* (- 1) main_~z~0) (- 4294967296)) (div main_~z~0 4294967296)))} is VALID [2022-04-28 03:47:23,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {16687#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= (div (+ 2 (* (- 1) main_~z~0)) (- 4294967296)) (div (+ (- 2) main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16683#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296)))} is VALID [2022-04-28 03:47:23,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {16522#true} ~z~0 := ~y~0; {16687#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= (div (+ 2 (* (- 1) main_~z~0)) (- 4294967296)) (div (+ (- 2) main_~z~0) 4294967296)))} is VALID [2022-04-28 03:47:23,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {16522#true} [147] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {16522#true} is VALID [2022-04-28 03:47:23,144 INFO L290 TraceCheckUtils]: 6: Hoare triple {16522#true} [148] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_295 4294967296)) (.cse1 (= |v_main_#t~post6_131| |v_main_#t~post6_130|)) (.cse2 (= v_main_~x~0_295 v_main_~x~0_294)) (.cse3 (= v_main_~y~0_319 v_main_~y~0_318)) (.cse4 (= |v_main_#t~post5_131| |v_main_#t~post5_130|))) (or (and (< 0 .cse0) (< v_main_~y~0_319 v_main_~y~0_318) (forall ((v_it_26 Int)) (or (not (<= 1 v_it_26)) (not (<= (+ v_main_~y~0_319 v_it_26 1) v_main_~y~0_318)) (< 0 (mod (+ v_main_~x~0_295 (* 4294967295 v_it_26)) 4294967296)))) (= v_main_~x~0_294 (+ v_main_~x~0_295 v_main_~y~0_319 (* (- 1) v_main_~y~0_318)))) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_319, main_#t~post5=|v_main_#t~post5_131|, main_~x~0=v_main_~x~0_295, main_#t~post6=|v_main_#t~post6_131|} OutVars{main_~y~0=v_main_~y~0_318, main_#t~post5=|v_main_#t~post5_130|, main_~x~0=v_main_~x~0_294, main_#t~post6=|v_main_#t~post6_130|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16522#true} is VALID [2022-04-28 03:47:23,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {16522#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16522#true} is VALID [2022-04-28 03:47:23,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {16522#true} call #t~ret17 := main(); {16522#true} is VALID [2022-04-28 03:47:23,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16522#true} {16522#true} #94#return; {16522#true} is VALID [2022-04-28 03:47:23,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {16522#true} assume true; {16522#true} is VALID [2022-04-28 03:47:23,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {16522#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16522#true} is VALID [2022-04-28 03:47:23,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {16522#true} call ULTIMATE.init(); {16522#true} is VALID [2022-04-28 03:47:23,145 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-28 03:47:23,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683669942] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:47:23,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:47:23,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 19 [2022-04-28 03:47:23,355 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:47:23,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [491853076] [2022-04-28 03:47:23,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [491853076] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:47:23,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:47:23,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:47:23,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62959480] [2022-04-28 03:47:23,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:47:23,356 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 03:47:23,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:47:23,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:23,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:47:23,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 03:47:23,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:47:23,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 03:47:23,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2022-04-28 03:47:23,379 INFO L87 Difference]: Start difference. First operand 152 states and 198 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:27,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:27,675 INFO L93 Difference]: Finished difference Result 193 states and 251 transitions. [2022-04-28 03:47:27,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 03:47:27,675 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 03:47:27,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:47:27,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:27,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 77 transitions. [2022-04-28 03:47:27,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:27,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 77 transitions. [2022-04-28 03:47:27,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 77 transitions. [2022-04-28 03:47:27,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:47:27,779 INFO L225 Difference]: With dead ends: 193 [2022-04-28 03:47:27,779 INFO L226 Difference]: Without dead ends: 131 [2022-04-28 03:47:27,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=237, Invalid=1169, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 03:47:27,780 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 48 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:47:27,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 62 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 03:47:27,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-28 03:47:28,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 100. [2022-04-28 03:47:28,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:47:28,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 100 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 95 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:28,518 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 100 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 95 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:28,518 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 100 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 95 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:28,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:28,520 INFO L93 Difference]: Finished difference Result 131 states and 173 transitions. [2022-04-28 03:47:28,520 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 173 transitions. [2022-04-28 03:47:28,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:47:28,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:47:28,520 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 95 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 131 states. [2022-04-28 03:47:28,520 INFO L87 Difference]: Start difference. First operand has 100 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 95 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 131 states. [2022-04-28 03:47:28,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:28,521 INFO L93 Difference]: Finished difference Result 131 states and 173 transitions. [2022-04-28 03:47:28,521 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 173 transitions. [2022-04-28 03:47:28,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:47:28,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:47:28,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:47:28,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:47:28,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 95 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:28,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 130 transitions. [2022-04-28 03:47:28,523 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 130 transitions. Word has length 30 [2022-04-28 03:47:28,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:47:28,523 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 130 transitions. [2022-04-28 03:47:28,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:28,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 130 transitions. [2022-04-28 03:47:38,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 127 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 03:47:38,799 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 130 transitions. [2022-04-28 03:47:38,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 03:47:38,800 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:47:38,800 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:47:38,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 03:47:39,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-28 03:47:39,000 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:47:39,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:47:39,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1738398296, now seen corresponding path program 4 times [2022-04-28 03:47:39,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:47:39,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [994590721] [2022-04-28 03:47:39,290 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:47:39,292 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:47:39,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1162935305, now seen corresponding path program 1 times [2022-04-28 03:47:39,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:47:39,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999495262] [2022-04-28 03:47:39,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:47:39,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:47:39,307 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_27.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:47:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:39,323 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_27.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:47:39,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:47:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:39,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {17615#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17603#true} is VALID [2022-04-28 03:47:39,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {17603#true} assume true; {17603#true} is VALID [2022-04-28 03:47:39,589 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17603#true} {17603#true} #94#return; {17603#true} is VALID [2022-04-28 03:47:39,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {17603#true} call ULTIMATE.init(); {17615#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:47:39,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {17615#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17603#true} is VALID [2022-04-28 03:47:39,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {17603#true} assume true; {17603#true} is VALID [2022-04-28 03:47:39,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17603#true} {17603#true} #94#return; {17603#true} is VALID [2022-04-28 03:47:39,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {17603#true} call #t~ret17 := main(); {17603#true} is VALID [2022-04-28 03:47:39,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {17603#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17603#true} is VALID [2022-04-28 03:47:39,590 INFO L290 TraceCheckUtils]: 6: Hoare triple {17603#true} [150] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_311 4294967296)) (.cse0 (= v_main_~x~0_311 v_main_~x~0_310)) (.cse1 (= |v_main_#t~post6_136| |v_main_#t~post6_135|)) (.cse2 (= |v_main_#t~post5_136| |v_main_#t~post5_135|)) (.cse3 (= v_main_~y~0_335 v_main_~y~0_334))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< 0 .cse4) (forall ((v_it_27 Int)) (or (< 0 (mod (+ v_main_~x~0_311 (* 4294967295 v_it_27)) 4294967296)) (not (<= 1 v_it_27)) (not (<= (+ v_main_~x~0_310 v_it_27 1) v_main_~x~0_311)))) (< v_main_~x~0_310 v_main_~x~0_311) (= v_main_~y~0_334 (+ v_main_~x~0_311 v_main_~y~0_335 (* v_main_~x~0_310 (- 1))))) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_335, main_#t~post5=|v_main_#t~post5_136|, main_~x~0=v_main_~x~0_311, main_#t~post6=|v_main_#t~post6_136|} OutVars{main_~y~0=v_main_~y~0_334, main_#t~post5=|v_main_#t~post5_135|, main_~x~0=v_main_~x~0_310, main_#t~post6=|v_main_#t~post6_135|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17603#true} is VALID [2022-04-28 03:47:39,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {17603#true} [149] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {17603#true} is VALID [2022-04-28 03:47:39,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {17603#true} ~z~0 := ~y~0; {17603#true} is VALID [2022-04-28 03:47:39,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {17603#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17608#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:39,593 INFO L290 TraceCheckUtils]: 10: Hoare triple {17608#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17609#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:47:39,593 INFO L290 TraceCheckUtils]: 11: Hoare triple {17609#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17603#true} is VALID [2022-04-28 03:47:39,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {17603#true} assume !(~z~0 % 4294967296 > 0); {17610#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0)} is VALID [2022-04-28 03:47:39,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {17610#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17611#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:47:39,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {17611#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17612#(<= (+ (* 4294967296 (div (+ main_~z~0 4294967293) 4294967296)) 2) main_~z~0)} is VALID [2022-04-28 03:47:39,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {17612#(<= (+ (* 4294967296 (div (+ main_~z~0 4294967293) 4294967296)) 2) main_~z~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17613#(<= (+ 3 (* (div (+ 4294967292 main_~z~0) 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:47:39,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {17613#(<= (+ 3 (* (div (+ 4294967292 main_~z~0) 4294967296) 4294967296)) main_~z~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17614#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-28 03:47:39,599 INFO L290 TraceCheckUtils]: 17: Hoare triple {17614#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {17614#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-28 03:47:39,599 INFO L290 TraceCheckUtils]: 18: Hoare triple {17614#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17614#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-28 03:47:39,600 INFO L290 TraceCheckUtils]: 19: Hoare triple {17614#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17614#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-28 03:47:39,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {17614#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17614#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-28 03:47:39,600 INFO L290 TraceCheckUtils]: 21: Hoare triple {17614#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {17614#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-28 03:47:39,601 INFO L290 TraceCheckUtils]: 22: Hoare triple {17614#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {17604#false} is VALID [2022-04-28 03:47:39,601 INFO L290 TraceCheckUtils]: 23: Hoare triple {17604#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {17604#false} is VALID [2022-04-28 03:47:39,601 INFO L290 TraceCheckUtils]: 24: Hoare triple {17604#false} assume !(~y~0 % 4294967296 > 0); {17604#false} is VALID [2022-04-28 03:47:39,601 INFO L272 TraceCheckUtils]: 25: Hoare triple {17604#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17604#false} is VALID [2022-04-28 03:47:39,601 INFO L290 TraceCheckUtils]: 26: Hoare triple {17604#false} ~cond := #in~cond; {17604#false} is VALID [2022-04-28 03:47:39,601 INFO L290 TraceCheckUtils]: 27: Hoare triple {17604#false} assume 0 == ~cond; {17604#false} is VALID [2022-04-28 03:47:39,601 INFO L290 TraceCheckUtils]: 28: Hoare triple {17604#false} assume !false; {17604#false} is VALID [2022-04-28 03:47:39,601 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 03:47:39,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:47:39,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999495262] [2022-04-28 03:47:39,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999495262] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:47:39,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986880921] [2022-04-28 03:47:39,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:47:39,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:47:39,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:47:39,603 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:47:39,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 03:47:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:39,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 03:47:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:39,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:47:40,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {17603#true} call ULTIMATE.init(); {17603#true} is VALID [2022-04-28 03:47:40,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {17603#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17603#true} is VALID [2022-04-28 03:47:40,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {17603#true} assume true; {17603#true} is VALID [2022-04-28 03:47:40,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17603#true} {17603#true} #94#return; {17603#true} is VALID [2022-04-28 03:47:40,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {17603#true} call #t~ret17 := main(); {17603#true} is VALID [2022-04-28 03:47:40,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {17603#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17603#true} is VALID [2022-04-28 03:47:40,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {17603#true} [150] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_311 4294967296)) (.cse0 (= v_main_~x~0_311 v_main_~x~0_310)) (.cse1 (= |v_main_#t~post6_136| |v_main_#t~post6_135|)) (.cse2 (= |v_main_#t~post5_136| |v_main_#t~post5_135|)) (.cse3 (= v_main_~y~0_335 v_main_~y~0_334))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< 0 .cse4) (forall ((v_it_27 Int)) (or (< 0 (mod (+ v_main_~x~0_311 (* 4294967295 v_it_27)) 4294967296)) (not (<= 1 v_it_27)) (not (<= (+ v_main_~x~0_310 v_it_27 1) v_main_~x~0_311)))) (< v_main_~x~0_310 v_main_~x~0_311) (= v_main_~y~0_334 (+ v_main_~x~0_311 v_main_~y~0_335 (* v_main_~x~0_310 (- 1))))) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_335, main_#t~post5=|v_main_#t~post5_136|, main_~x~0=v_main_~x~0_311, main_#t~post6=|v_main_#t~post6_136|} OutVars{main_~y~0=v_main_~y~0_334, main_#t~post5=|v_main_#t~post5_135|, main_~x~0=v_main_~x~0_310, main_#t~post6=|v_main_#t~post6_135|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17603#true} is VALID [2022-04-28 03:47:40,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {17603#true} [149] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {17603#true} is VALID [2022-04-28 03:47:40,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {17603#true} ~z~0 := ~y~0; {17643#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:47:40,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {17643#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17647#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:47:40,168 INFO L290 TraceCheckUtils]: 10: Hoare triple {17647#(= main_~y~0 (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17651#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:47:40,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {17651#(= main_~y~0 (+ main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17655#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-28 03:47:40,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {17655#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {17659#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:47:40,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {17659#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17663#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:47:40,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {17663#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17667#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:47:40,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {17667#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17671#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:47:40,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {17671#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17604#false} is VALID [2022-04-28 03:47:40,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {17604#false} assume !(~y~0 % 4294967296 > 0); {17604#false} is VALID [2022-04-28 03:47:40,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {17604#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17604#false} is VALID [2022-04-28 03:47:40,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {17604#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17604#false} is VALID [2022-04-28 03:47:40,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {17604#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17604#false} is VALID [2022-04-28 03:47:40,174 INFO L290 TraceCheckUtils]: 21: Hoare triple {17604#false} assume !(~x~0 % 4294967296 > 0); {17604#false} is VALID [2022-04-28 03:47:40,174 INFO L290 TraceCheckUtils]: 22: Hoare triple {17604#false} assume !(~z~0 % 4294967296 > 0); {17604#false} is VALID [2022-04-28 03:47:40,174 INFO L290 TraceCheckUtils]: 23: Hoare triple {17604#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {17604#false} is VALID [2022-04-28 03:47:40,174 INFO L290 TraceCheckUtils]: 24: Hoare triple {17604#false} assume !(~y~0 % 4294967296 > 0); {17604#false} is VALID [2022-04-28 03:47:40,174 INFO L272 TraceCheckUtils]: 25: Hoare triple {17604#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17604#false} is VALID [2022-04-28 03:47:40,174 INFO L290 TraceCheckUtils]: 26: Hoare triple {17604#false} ~cond := #in~cond; {17604#false} is VALID [2022-04-28 03:47:40,174 INFO L290 TraceCheckUtils]: 27: Hoare triple {17604#false} assume 0 == ~cond; {17604#false} is VALID [2022-04-28 03:47:40,174 INFO L290 TraceCheckUtils]: 28: Hoare triple {17604#false} assume !false; {17604#false} is VALID [2022-04-28 03:47:40,174 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-28 03:47:40,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:47:40,646 INFO L290 TraceCheckUtils]: 28: Hoare triple {17604#false} assume !false; {17604#false} is VALID [2022-04-28 03:47:40,646 INFO L290 TraceCheckUtils]: 27: Hoare triple {17604#false} assume 0 == ~cond; {17604#false} is VALID [2022-04-28 03:47:40,647 INFO L290 TraceCheckUtils]: 26: Hoare triple {17604#false} ~cond := #in~cond; {17604#false} is VALID [2022-04-28 03:47:40,647 INFO L272 TraceCheckUtils]: 25: Hoare triple {17604#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17604#false} is VALID [2022-04-28 03:47:40,647 INFO L290 TraceCheckUtils]: 24: Hoare triple {17604#false} assume !(~y~0 % 4294967296 > 0); {17604#false} is VALID [2022-04-28 03:47:40,647 INFO L290 TraceCheckUtils]: 23: Hoare triple {17604#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {17604#false} is VALID [2022-04-28 03:47:40,647 INFO L290 TraceCheckUtils]: 22: Hoare triple {17604#false} assume !(~z~0 % 4294967296 > 0); {17604#false} is VALID [2022-04-28 03:47:40,647 INFO L290 TraceCheckUtils]: 21: Hoare triple {17604#false} assume !(~x~0 % 4294967296 > 0); {17604#false} is VALID [2022-04-28 03:47:40,647 INFO L290 TraceCheckUtils]: 20: Hoare triple {17604#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17604#false} is VALID [2022-04-28 03:47:40,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {17604#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17604#false} is VALID [2022-04-28 03:47:40,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {17604#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17604#false} is VALID [2022-04-28 03:47:40,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {17604#false} assume !(~y~0 % 4294967296 > 0); {17604#false} is VALID [2022-04-28 03:47:40,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {17671#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17604#false} is VALID [2022-04-28 03:47:40,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {17667#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17671#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:47:40,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {17663#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17667#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:47:40,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {17659#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17663#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:47:40,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {17759#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {17659#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:47:40,653 INFO L290 TraceCheckUtils]: 11: Hoare triple {17763#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17759#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-28 03:47:40,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {17767#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17763#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:47:40,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {17771#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17767#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-28 03:47:40,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {17603#true} ~z~0 := ~y~0; {17771#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:47:40,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {17603#true} [149] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {17603#true} is VALID [2022-04-28 03:47:40,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {17603#true} [150] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_311 4294967296)) (.cse0 (= v_main_~x~0_311 v_main_~x~0_310)) (.cse1 (= |v_main_#t~post6_136| |v_main_#t~post6_135|)) (.cse2 (= |v_main_#t~post5_136| |v_main_#t~post5_135|)) (.cse3 (= v_main_~y~0_335 v_main_~y~0_334))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< 0 .cse4) (forall ((v_it_27 Int)) (or (< 0 (mod (+ v_main_~x~0_311 (* 4294967295 v_it_27)) 4294967296)) (not (<= 1 v_it_27)) (not (<= (+ v_main_~x~0_310 v_it_27 1) v_main_~x~0_311)))) (< v_main_~x~0_310 v_main_~x~0_311) (= v_main_~y~0_334 (+ v_main_~x~0_311 v_main_~y~0_335 (* v_main_~x~0_310 (- 1))))) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_335, main_#t~post5=|v_main_#t~post5_136|, main_~x~0=v_main_~x~0_311, main_#t~post6=|v_main_#t~post6_136|} OutVars{main_~y~0=v_main_~y~0_334, main_#t~post5=|v_main_#t~post5_135|, main_~x~0=v_main_~x~0_310, main_#t~post6=|v_main_#t~post6_135|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17603#true} is VALID [2022-04-28 03:47:40,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {17603#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17603#true} is VALID [2022-04-28 03:47:40,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {17603#true} call #t~ret17 := main(); {17603#true} is VALID [2022-04-28 03:47:40,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17603#true} {17603#true} #94#return; {17603#true} is VALID [2022-04-28 03:47:40,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {17603#true} assume true; {17603#true} is VALID [2022-04-28 03:47:40,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {17603#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17603#true} is VALID [2022-04-28 03:47:40,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {17603#true} call ULTIMATE.init(); {17603#true} is VALID [2022-04-28 03:47:40,656 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-28 03:47:40,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986880921] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:47:40,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:47:40,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2022-04-28 03:47:41,018 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:47:41,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [994590721] [2022-04-28 03:47:41,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [994590721] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:47:41,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:47:41,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 03:47:41,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691915437] [2022-04-28 03:47:41,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:47:41,019 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-28 03:47:41,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:47:41,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:41,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:47:41,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 03:47:41,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:47:41,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 03:47:41,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2022-04-28 03:47:41,051 INFO L87 Difference]: Start difference. First operand 100 states and 130 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:49,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:49,627 INFO L93 Difference]: Finished difference Result 298 states and 431 transitions. [2022-04-28 03:47:49,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 03:47:49,627 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-28 03:47:49,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:47:49,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:49,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 198 transitions. [2022-04-28 03:47:49,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:49,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 198 transitions. [2022-04-28 03:47:49,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 198 transitions. [2022-04-28 03:47:49,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:47:49,957 INFO L225 Difference]: With dead ends: 298 [2022-04-28 03:47:49,957 INFO L226 Difference]: Without dead ends: 283 [2022-04-28 03:47:49,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=599, Invalid=2941, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 03:47:49,958 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 199 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:47:49,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 53 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-28 03:47:49,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-04-28 03:47:50,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 137. [2022-04-28 03:47:50,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:47:50,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 283 states. Second operand has 137 states, 132 states have (on average 1.3636363636363635) internal successors, (180), 132 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:50,970 INFO L74 IsIncluded]: Start isIncluded. First operand 283 states. Second operand has 137 states, 132 states have (on average 1.3636363636363635) internal successors, (180), 132 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:50,970 INFO L87 Difference]: Start difference. First operand 283 states. Second operand has 137 states, 132 states have (on average 1.3636363636363635) internal successors, (180), 132 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:50,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:50,974 INFO L93 Difference]: Finished difference Result 283 states and 391 transitions. [2022-04-28 03:47:50,974 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 391 transitions. [2022-04-28 03:47:50,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:47:50,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:47:50,974 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 132 states have (on average 1.3636363636363635) internal successors, (180), 132 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 283 states. [2022-04-28 03:47:50,974 INFO L87 Difference]: Start difference. First operand has 137 states, 132 states have (on average 1.3636363636363635) internal successors, (180), 132 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 283 states. [2022-04-28 03:47:50,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:50,978 INFO L93 Difference]: Finished difference Result 283 states and 391 transitions. [2022-04-28 03:47:50,978 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 391 transitions. [2022-04-28 03:47:50,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:47:50,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:47:50,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:47:50,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:47:50,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 132 states have (on average 1.3636363636363635) internal successors, (180), 132 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:50,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 184 transitions. [2022-04-28 03:47:50,980 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 184 transitions. Word has length 31 [2022-04-28 03:47:50,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:47:50,980 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 184 transitions. [2022-04-28 03:47:50,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:50,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 184 transitions. [2022-04-28 03:48:02,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 181 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:02,647 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 184 transitions. [2022-04-28 03:48:02,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 03:48:02,647 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:48:02,647 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:48:02,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 03:48:02,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-28 03:48:02,848 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:48:02,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:48:02,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1371725145, now seen corresponding path program 7 times [2022-04-28 03:48:02,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:02,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1328069147] [2022-04-28 03:48:05,165 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:48:05,167 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:48:05,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1236761896, now seen corresponding path program 1 times [2022-04-28 03:48:05,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:48:05,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538528192] [2022-04-28 03:48:05,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:05,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:48:05,176 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_28.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:48:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:05,188 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_28.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:48:05,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:48:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:05,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {19325#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19312#true} is VALID [2022-04-28 03:48:05,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {19312#true} assume true; {19312#true} is VALID [2022-04-28 03:48:05,524 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19312#true} {19312#true} #94#return; {19312#true} is VALID [2022-04-28 03:48:05,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {19312#true} call ULTIMATE.init(); {19325#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:48:05,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {19325#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19312#true} is VALID [2022-04-28 03:48:05,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {19312#true} assume true; {19312#true} is VALID [2022-04-28 03:48:05,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19312#true} {19312#true} #94#return; {19312#true} is VALID [2022-04-28 03:48:05,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {19312#true} call #t~ret17 := main(); {19312#true} is VALID [2022-04-28 03:48:05,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {19312#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19312#true} is VALID [2022-04-28 03:48:05,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {19312#true} [152] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_326 4294967296)) (.cse0 (= |v_main_#t~post6_141| |v_main_#t~post6_140|)) (.cse1 (= v_main_~x~0_326 v_main_~x~0_325)) (.cse2 (= v_main_~y~0_355 v_main_~y~0_354)) (.cse3 (= |v_main_#t~post5_141| |v_main_#t~post5_140|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~y~0_355 v_main_~y~0_354) (< 0 .cse4) (forall ((v_it_28 Int)) (or (not (<= (+ v_main_~y~0_355 v_it_28 1) v_main_~y~0_354)) (not (<= 1 v_it_28)) (< 0 (mod (+ v_main_~x~0_326 (* 4294967295 v_it_28)) 4294967296)))) (= v_main_~x~0_325 (+ v_main_~x~0_326 v_main_~y~0_355 (* (- 1) v_main_~y~0_354)))) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_355, main_#t~post5=|v_main_#t~post5_141|, main_~x~0=v_main_~x~0_326, main_#t~post6=|v_main_#t~post6_141|} OutVars{main_~y~0=v_main_~y~0_354, main_#t~post5=|v_main_#t~post5_140|, main_~x~0=v_main_~x~0_325, main_#t~post6=|v_main_#t~post6_140|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {19312#true} is VALID [2022-04-28 03:48:05,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {19312#true} [151] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {19312#true} is VALID [2022-04-28 03:48:05,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {19312#true} ~z~0 := ~y~0; {19317#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:48:05,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {19317#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19318#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:48:05,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {19318#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19319#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:48:05,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {19319#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19320#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:48:05,528 INFO L290 TraceCheckUtils]: 12: Hoare triple {19320#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {19321#(and (<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 3 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:48:05,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {19321#(and (<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 3 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19322#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:05,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {19322#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19323#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:48:05,531 INFO L290 TraceCheckUtils]: 15: Hoare triple {19323#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19324#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:48:05,532 INFO L290 TraceCheckUtils]: 16: Hoare triple {19324#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19313#false} is VALID [2022-04-28 03:48:05,532 INFO L290 TraceCheckUtils]: 17: Hoare triple {19313#false} assume !(~y~0 % 4294967296 > 0); {19313#false} is VALID [2022-04-28 03:48:05,532 INFO L290 TraceCheckUtils]: 18: Hoare triple {19313#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19313#false} is VALID [2022-04-28 03:48:05,532 INFO L290 TraceCheckUtils]: 19: Hoare triple {19313#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19313#false} is VALID [2022-04-28 03:48:05,532 INFO L290 TraceCheckUtils]: 20: Hoare triple {19313#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19313#false} is VALID [2022-04-28 03:48:05,532 INFO L290 TraceCheckUtils]: 21: Hoare triple {19313#false} assume !(~x~0 % 4294967296 > 0); {19313#false} is VALID [2022-04-28 03:48:05,532 INFO L290 TraceCheckUtils]: 22: Hoare triple {19313#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {19313#false} is VALID [2022-04-28 03:48:05,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {19313#false} assume !(~z~0 % 4294967296 > 0); {19313#false} is VALID [2022-04-28 03:48:05,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {19313#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {19313#false} is VALID [2022-04-28 03:48:05,532 INFO L290 TraceCheckUtils]: 25: Hoare triple {19313#false} assume !(~y~0 % 4294967296 > 0); {19313#false} is VALID [2022-04-28 03:48:05,532 INFO L272 TraceCheckUtils]: 26: Hoare triple {19313#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19313#false} is VALID [2022-04-28 03:48:05,532 INFO L290 TraceCheckUtils]: 27: Hoare triple {19313#false} ~cond := #in~cond; {19313#false} is VALID [2022-04-28 03:48:05,532 INFO L290 TraceCheckUtils]: 28: Hoare triple {19313#false} assume 0 == ~cond; {19313#false} is VALID [2022-04-28 03:48:05,533 INFO L290 TraceCheckUtils]: 29: Hoare triple {19313#false} assume !false; {19313#false} is VALID [2022-04-28 03:48:05,533 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 03:48:05,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:48:05,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538528192] [2022-04-28 03:48:05,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538528192] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:48:05,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273665077] [2022-04-28 03:48:05,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:05,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:48:05,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:48:05,534 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:48:05,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 03:48:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:05,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 03:48:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:05,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:48:06,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {19312#true} call ULTIMATE.init(); {19312#true} is VALID [2022-04-28 03:48:06,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {19312#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19312#true} is VALID [2022-04-28 03:48:06,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {19312#true} assume true; {19312#true} is VALID [2022-04-28 03:48:06,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19312#true} {19312#true} #94#return; {19312#true} is VALID [2022-04-28 03:48:06,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {19312#true} call #t~ret17 := main(); {19312#true} is VALID [2022-04-28 03:48:06,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {19312#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19312#true} is VALID [2022-04-28 03:48:06,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {19312#true} [152] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_326 4294967296)) (.cse0 (= |v_main_#t~post6_141| |v_main_#t~post6_140|)) (.cse1 (= v_main_~x~0_326 v_main_~x~0_325)) (.cse2 (= v_main_~y~0_355 v_main_~y~0_354)) (.cse3 (= |v_main_#t~post5_141| |v_main_#t~post5_140|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~y~0_355 v_main_~y~0_354) (< 0 .cse4) (forall ((v_it_28 Int)) (or (not (<= (+ v_main_~y~0_355 v_it_28 1) v_main_~y~0_354)) (not (<= 1 v_it_28)) (< 0 (mod (+ v_main_~x~0_326 (* 4294967295 v_it_28)) 4294967296)))) (= v_main_~x~0_325 (+ v_main_~x~0_326 v_main_~y~0_355 (* (- 1) v_main_~y~0_354)))) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_355, main_#t~post5=|v_main_#t~post5_141|, main_~x~0=v_main_~x~0_326, main_#t~post6=|v_main_#t~post6_141|} OutVars{main_~y~0=v_main_~y~0_354, main_#t~post5=|v_main_#t~post5_140|, main_~x~0=v_main_~x~0_325, main_#t~post6=|v_main_#t~post6_140|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {19312#true} is VALID [2022-04-28 03:48:06,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {19312#true} [151] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {19312#true} is VALID [2022-04-28 03:48:06,206 INFO L290 TraceCheckUtils]: 8: Hoare triple {19312#true} ~z~0 := ~y~0; {19317#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:48:06,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {19317#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19318#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:48:06,207 INFO L290 TraceCheckUtils]: 10: Hoare triple {19318#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19319#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:48:06,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {19319#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19320#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:48:06,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {19320#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {19365#(<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296))} is VALID [2022-04-28 03:48:06,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {19365#(<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19322#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:06,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {19322#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19323#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:48:06,213 INFO L290 TraceCheckUtils]: 15: Hoare triple {19323#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19324#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:48:06,213 INFO L290 TraceCheckUtils]: 16: Hoare triple {19324#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19313#false} is VALID [2022-04-28 03:48:06,213 INFO L290 TraceCheckUtils]: 17: Hoare triple {19313#false} assume !(~y~0 % 4294967296 > 0); {19313#false} is VALID [2022-04-28 03:48:06,213 INFO L290 TraceCheckUtils]: 18: Hoare triple {19313#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19313#false} is VALID [2022-04-28 03:48:06,213 INFO L290 TraceCheckUtils]: 19: Hoare triple {19313#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19313#false} is VALID [2022-04-28 03:48:06,214 INFO L290 TraceCheckUtils]: 20: Hoare triple {19313#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19313#false} is VALID [2022-04-28 03:48:06,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {19313#false} assume !(~x~0 % 4294967296 > 0); {19313#false} is VALID [2022-04-28 03:48:06,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {19313#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {19313#false} is VALID [2022-04-28 03:48:06,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {19313#false} assume !(~z~0 % 4294967296 > 0); {19313#false} is VALID [2022-04-28 03:48:06,214 INFO L290 TraceCheckUtils]: 24: Hoare triple {19313#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {19313#false} is VALID [2022-04-28 03:48:06,214 INFO L290 TraceCheckUtils]: 25: Hoare triple {19313#false} assume !(~y~0 % 4294967296 > 0); {19313#false} is VALID [2022-04-28 03:48:06,214 INFO L272 TraceCheckUtils]: 26: Hoare triple {19313#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19313#false} is VALID [2022-04-28 03:48:06,214 INFO L290 TraceCheckUtils]: 27: Hoare triple {19313#false} ~cond := #in~cond; {19313#false} is VALID [2022-04-28 03:48:06,214 INFO L290 TraceCheckUtils]: 28: Hoare triple {19313#false} assume 0 == ~cond; {19313#false} is VALID [2022-04-28 03:48:06,214 INFO L290 TraceCheckUtils]: 29: Hoare triple {19313#false} assume !false; {19313#false} is VALID [2022-04-28 03:48:06,214 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 03:48:06,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:48:07,368 INFO L290 TraceCheckUtils]: 29: Hoare triple {19313#false} assume !false; {19313#false} is VALID [2022-04-28 03:48:07,368 INFO L290 TraceCheckUtils]: 28: Hoare triple {19313#false} assume 0 == ~cond; {19313#false} is VALID [2022-04-28 03:48:07,368 INFO L290 TraceCheckUtils]: 27: Hoare triple {19313#false} ~cond := #in~cond; {19313#false} is VALID [2022-04-28 03:48:07,368 INFO L272 TraceCheckUtils]: 26: Hoare triple {19313#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19313#false} is VALID [2022-04-28 03:48:07,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {19313#false} assume !(~y~0 % 4294967296 > 0); {19313#false} is VALID [2022-04-28 03:48:07,369 INFO L290 TraceCheckUtils]: 24: Hoare triple {19313#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {19313#false} is VALID [2022-04-28 03:48:07,369 INFO L290 TraceCheckUtils]: 23: Hoare triple {19313#false} assume !(~z~0 % 4294967296 > 0); {19313#false} is VALID [2022-04-28 03:48:07,369 INFO L290 TraceCheckUtils]: 22: Hoare triple {19313#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {19313#false} is VALID [2022-04-28 03:48:07,369 INFO L290 TraceCheckUtils]: 21: Hoare triple {19313#false} assume !(~x~0 % 4294967296 > 0); {19313#false} is VALID [2022-04-28 03:48:07,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {19313#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19313#false} is VALID [2022-04-28 03:48:07,369 INFO L290 TraceCheckUtils]: 19: Hoare triple {19313#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19313#false} is VALID [2022-04-28 03:48:07,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {19313#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19313#false} is VALID [2022-04-28 03:48:07,369 INFO L290 TraceCheckUtils]: 17: Hoare triple {19313#false} assume !(~y~0 % 4294967296 > 0); {19313#false} is VALID [2022-04-28 03:48:07,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {19324#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19313#false} is VALID [2022-04-28 03:48:07,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {19323#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19324#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:48:07,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {19322#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19323#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:48:07,373 INFO L290 TraceCheckUtils]: 13: Hoare triple {19365#(<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19322#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:07,373 INFO L290 TraceCheckUtils]: 12: Hoare triple {19468#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {19365#(<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296))} is VALID [2022-04-28 03:48:07,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {19472#(or (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19468#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)))} is VALID [2022-04-28 03:48:07,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {19476#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19472#(or (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:48:07,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {19480#(or (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19476#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)))} is VALID [2022-04-28 03:48:07,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {19312#true} ~z~0 := ~y~0; {19480#(or (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:48:07,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {19312#true} [151] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {19312#true} is VALID [2022-04-28 03:48:07,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {19312#true} [152] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_326 4294967296)) (.cse0 (= |v_main_#t~post6_141| |v_main_#t~post6_140|)) (.cse1 (= v_main_~x~0_326 v_main_~x~0_325)) (.cse2 (= v_main_~y~0_355 v_main_~y~0_354)) (.cse3 (= |v_main_#t~post5_141| |v_main_#t~post5_140|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~y~0_355 v_main_~y~0_354) (< 0 .cse4) (forall ((v_it_28 Int)) (or (not (<= (+ v_main_~y~0_355 v_it_28 1) v_main_~y~0_354)) (not (<= 1 v_it_28)) (< 0 (mod (+ v_main_~x~0_326 (* 4294967295 v_it_28)) 4294967296)))) (= v_main_~x~0_325 (+ v_main_~x~0_326 v_main_~y~0_355 (* (- 1) v_main_~y~0_354)))) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_355, main_#t~post5=|v_main_#t~post5_141|, main_~x~0=v_main_~x~0_326, main_#t~post6=|v_main_#t~post6_141|} OutVars{main_~y~0=v_main_~y~0_354, main_#t~post5=|v_main_#t~post5_140|, main_~x~0=v_main_~x~0_325, main_#t~post6=|v_main_#t~post6_140|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {19312#true} is VALID [2022-04-28 03:48:07,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {19312#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19312#true} is VALID [2022-04-28 03:48:07,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {19312#true} call #t~ret17 := main(); {19312#true} is VALID [2022-04-28 03:48:07,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19312#true} {19312#true} #94#return; {19312#true} is VALID [2022-04-28 03:48:07,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {19312#true} assume true; {19312#true} is VALID [2022-04-28 03:48:07,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {19312#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19312#true} is VALID [2022-04-28 03:48:07,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {19312#true} call ULTIMATE.init(); {19312#true} is VALID [2022-04-28 03:48:07,379 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 03:48:07,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273665077] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:48:07,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:48:07,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2022-04-28 03:48:07,655 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:48:07,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1328069147] [2022-04-28 03:48:07,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1328069147] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:48:07,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:48:07,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 03:48:07,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960865513] [2022-04-28 03:48:07,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:48:07,656 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 03:48:07,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:48:07,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:07,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:07,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 03:48:07,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:07,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 03:48:07,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-28 03:48:07,685 INFO L87 Difference]: Start difference. First operand 137 states and 184 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:13,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:13,398 INFO L93 Difference]: Finished difference Result 179 states and 245 transitions. [2022-04-28 03:48:13,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 03:48:13,398 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 03:48:13,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:48:13,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:13,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 105 transitions. [2022-04-28 03:48:13,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:13,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 105 transitions. [2022-04-28 03:48:13,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 105 transitions. [2022-04-28 03:48:13,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:13,548 INFO L225 Difference]: With dead ends: 179 [2022-04-28 03:48:13,548 INFO L226 Difference]: Without dead ends: 158 [2022-04-28 03:48:13,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 67 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=223, Invalid=1337, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 03:48:13,549 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 71 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:48:13,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 66 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 03:48:13,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-04-28 03:48:14,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 125. [2022-04-28 03:48:14,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:48:14,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand has 125 states, 120 states have (on average 1.3583333333333334) internal successors, (163), 120 states have internal predecessors, (163), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:14,492 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand has 125 states, 120 states have (on average 1.3583333333333334) internal successors, (163), 120 states have internal predecessors, (163), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:14,492 INFO L87 Difference]: Start difference. First operand 158 states. Second operand has 125 states, 120 states have (on average 1.3583333333333334) internal successors, (163), 120 states have internal predecessors, (163), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:14,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:14,493 INFO L93 Difference]: Finished difference Result 158 states and 218 transitions. [2022-04-28 03:48:14,494 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 218 transitions. [2022-04-28 03:48:14,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:14,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:14,494 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 120 states have (on average 1.3583333333333334) internal successors, (163), 120 states have internal predecessors, (163), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 158 states. [2022-04-28 03:48:14,494 INFO L87 Difference]: Start difference. First operand has 125 states, 120 states have (on average 1.3583333333333334) internal successors, (163), 120 states have internal predecessors, (163), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 158 states. [2022-04-28 03:48:14,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:14,496 INFO L93 Difference]: Finished difference Result 158 states and 218 transitions. [2022-04-28 03:48:14,496 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 218 transitions. [2022-04-28 03:48:14,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:14,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:14,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:48:14,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:48:14,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 120 states have (on average 1.3583333333333334) internal successors, (163), 120 states have internal predecessors, (163), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:14,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 167 transitions. [2022-04-28 03:48:14,498 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 167 transitions. Word has length 32 [2022-04-28 03:48:14,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:48:14,498 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 167 transitions. [2022-04-28 03:48:14,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:14,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 125 states and 167 transitions. [2022-04-28 03:48:24,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 164 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:24,997 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 167 transitions. [2022-04-28 03:48:24,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 03:48:24,997 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:48:24,997 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:48:25,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-28 03:48:25,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:48:25,199 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:48:25,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:48:25,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1148384935, now seen corresponding path program 8 times [2022-04-28 03:48:25,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:25,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [323588166] [2022-04-28 03:48:25,465 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:48:25,467 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:48:25,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1817420136, now seen corresponding path program 1 times [2022-04-28 03:48:25,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:48:25,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179428483] [2022-04-28 03:48:25,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:25,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:48:25,476 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_29.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:48:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:25,485 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_29.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:48:25,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:48:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:25,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {20493#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20481#true} is VALID [2022-04-28 03:48:25,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {20481#true} assume true; {20481#true} is VALID [2022-04-28 03:48:25,764 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20481#true} {20481#true} #94#return; {20481#true} is VALID [2022-04-28 03:48:25,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {20481#true} call ULTIMATE.init(); {20493#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:48:25,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {20493#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20481#true} is VALID [2022-04-28 03:48:25,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {20481#true} assume true; {20481#true} is VALID [2022-04-28 03:48:25,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20481#true} {20481#true} #94#return; {20481#true} is VALID [2022-04-28 03:48:25,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {20481#true} call #t~ret17 := main(); {20481#true} is VALID [2022-04-28 03:48:25,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {20481#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20481#true} is VALID [2022-04-28 03:48:25,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {20481#true} [154] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_376 v_main_~y~0_375)) (.cse0 (mod v_main_~x~0_342 4294967296)) (.cse2 (= v_main_~x~0_342 v_main_~x~0_341)) (.cse3 (= |v_main_#t~post5_146| |v_main_#t~post5_145|)) (.cse4 (= |v_main_#t~post6_146| |v_main_#t~post6_145|))) (or (and (< 0 .cse0) (= v_main_~x~0_341 (+ v_main_~x~0_342 (* (- 1) v_main_~y~0_375) v_main_~y~0_376)) (< v_main_~y~0_376 v_main_~y~0_375) (forall ((v_it_29 Int)) (or (not (<= (+ v_main_~y~0_376 v_it_29 1) v_main_~y~0_375)) (< 0 (mod (+ v_main_~x~0_342 (* 4294967295 v_it_29)) 4294967296)) (not (<= 1 v_it_29))))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_376, main_#t~post5=|v_main_#t~post5_146|, main_~x~0=v_main_~x~0_342, main_#t~post6=|v_main_#t~post6_146|} OutVars{main_~y~0=v_main_~y~0_375, main_#t~post5=|v_main_#t~post5_145|, main_~x~0=v_main_~x~0_341, main_#t~post6=|v_main_#t~post6_145|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20481#true} is VALID [2022-04-28 03:48:25,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {20481#true} [153] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {20486#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:48:25,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {20486#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {20486#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:48:25,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {20486#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20487#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:48:25,768 INFO L290 TraceCheckUtils]: 10: Hoare triple {20487#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20488#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:25,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {20488#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20489#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:25,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {20489#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20490#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:25,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {20490#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20491#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:48:25,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {20491#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {20491#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:48:25,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {20491#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20491#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:48:25,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {20491#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20491#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:48:25,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {20491#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20491#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:48:25,773 INFO L290 TraceCheckUtils]: 18: Hoare triple {20491#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20491#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:48:25,774 INFO L290 TraceCheckUtils]: 19: Hoare triple {20491#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~y~0 % 4294967296 > 0); {20491#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:48:25,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {20491#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20492#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:48:25,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {20492#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {20482#false} is VALID [2022-04-28 03:48:25,776 INFO L290 TraceCheckUtils]: 22: Hoare triple {20482#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20482#false} is VALID [2022-04-28 03:48:25,776 INFO L290 TraceCheckUtils]: 23: Hoare triple {20482#false} assume !(~z~0 % 4294967296 > 0); {20482#false} is VALID [2022-04-28 03:48:25,776 INFO L290 TraceCheckUtils]: 24: Hoare triple {20482#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {20482#false} is VALID [2022-04-28 03:48:25,776 INFO L290 TraceCheckUtils]: 25: Hoare triple {20482#false} assume !(~y~0 % 4294967296 > 0); {20482#false} is VALID [2022-04-28 03:48:25,776 INFO L272 TraceCheckUtils]: 26: Hoare triple {20482#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {20482#false} is VALID [2022-04-28 03:48:25,776 INFO L290 TraceCheckUtils]: 27: Hoare triple {20482#false} ~cond := #in~cond; {20482#false} is VALID [2022-04-28 03:48:25,776 INFO L290 TraceCheckUtils]: 28: Hoare triple {20482#false} assume 0 == ~cond; {20482#false} is VALID [2022-04-28 03:48:25,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {20482#false} assume !false; {20482#false} is VALID [2022-04-28 03:48:25,776 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 03:48:25,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:48:25,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179428483] [2022-04-28 03:48:25,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179428483] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:48:25,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166467560] [2022-04-28 03:48:25,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:25,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:48:25,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:48:25,778 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:48:25,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-28 03:48:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:25,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:48:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:25,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:48:26,551 INFO L272 TraceCheckUtils]: 0: Hoare triple {20481#true} call ULTIMATE.init(); {20481#true} is VALID [2022-04-28 03:48:26,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {20481#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20481#true} is VALID [2022-04-28 03:48:26,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {20481#true} assume true; {20481#true} is VALID [2022-04-28 03:48:26,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20481#true} {20481#true} #94#return; {20481#true} is VALID [2022-04-28 03:48:26,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {20481#true} call #t~ret17 := main(); {20481#true} is VALID [2022-04-28 03:48:26,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {20481#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20481#true} is VALID [2022-04-28 03:48:26,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {20481#true} [154] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_376 v_main_~y~0_375)) (.cse0 (mod v_main_~x~0_342 4294967296)) (.cse2 (= v_main_~x~0_342 v_main_~x~0_341)) (.cse3 (= |v_main_#t~post5_146| |v_main_#t~post5_145|)) (.cse4 (= |v_main_#t~post6_146| |v_main_#t~post6_145|))) (or (and (< 0 .cse0) (= v_main_~x~0_341 (+ v_main_~x~0_342 (* (- 1) v_main_~y~0_375) v_main_~y~0_376)) (< v_main_~y~0_376 v_main_~y~0_375) (forall ((v_it_29 Int)) (or (not (<= (+ v_main_~y~0_376 v_it_29 1) v_main_~y~0_375)) (< 0 (mod (+ v_main_~x~0_342 (* 4294967295 v_it_29)) 4294967296)) (not (<= 1 v_it_29))))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_376, main_#t~post5=|v_main_#t~post5_146|, main_~x~0=v_main_~x~0_342, main_#t~post6=|v_main_#t~post6_146|} OutVars{main_~y~0=v_main_~y~0_375, main_#t~post5=|v_main_#t~post5_145|, main_~x~0=v_main_~x~0_341, main_#t~post6=|v_main_#t~post6_145|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20481#true} is VALID [2022-04-28 03:48:26,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {20481#true} [153] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {20481#true} is VALID [2022-04-28 03:48:26,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {20481#true} ~z~0 := ~y~0; {20521#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:48:26,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {20521#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20525#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:48:26,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {20525#(= main_~y~0 (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20529#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:48:26,554 INFO L290 TraceCheckUtils]: 11: Hoare triple {20529#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20533#(= (+ main_~z~0 2) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:48:26,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {20533#(= (+ main_~z~0 2) (+ (- 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20537#(= (+ main_~z~0 3) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:48:26,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {20537#(= (+ main_~z~0 3) (+ (- 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20541#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:48:26,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {20541#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {20541#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:48:26,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {20541#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20548#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:48:26,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {20548#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20552#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:48:26,559 INFO L290 TraceCheckUtils]: 17: Hoare triple {20552#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:48:26,560 INFO L290 TraceCheckUtils]: 18: Hoare triple {20556#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20560#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:48:26,560 INFO L290 TraceCheckUtils]: 19: Hoare triple {20560#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {20482#false} is VALID [2022-04-28 03:48:26,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {20482#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20482#false} is VALID [2022-04-28 03:48:26,560 INFO L290 TraceCheckUtils]: 21: Hoare triple {20482#false} assume !(~x~0 % 4294967296 > 0); {20482#false} is VALID [2022-04-28 03:48:26,560 INFO L290 TraceCheckUtils]: 22: Hoare triple {20482#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20482#false} is VALID [2022-04-28 03:48:26,560 INFO L290 TraceCheckUtils]: 23: Hoare triple {20482#false} assume !(~z~0 % 4294967296 > 0); {20482#false} is VALID [2022-04-28 03:48:26,560 INFO L290 TraceCheckUtils]: 24: Hoare triple {20482#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {20482#false} is VALID [2022-04-28 03:48:26,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {20482#false} assume !(~y~0 % 4294967296 > 0); {20482#false} is VALID [2022-04-28 03:48:26,560 INFO L272 TraceCheckUtils]: 26: Hoare triple {20482#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {20482#false} is VALID [2022-04-28 03:48:26,560 INFO L290 TraceCheckUtils]: 27: Hoare triple {20482#false} ~cond := #in~cond; {20482#false} is VALID [2022-04-28 03:48:26,561 INFO L290 TraceCheckUtils]: 28: Hoare triple {20482#false} assume 0 == ~cond; {20482#false} is VALID [2022-04-28 03:48:26,561 INFO L290 TraceCheckUtils]: 29: Hoare triple {20482#false} assume !false; {20482#false} is VALID [2022-04-28 03:48:26,561 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:48:26,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:48:27,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {20482#false} assume !false; {20482#false} is VALID [2022-04-28 03:48:27,247 INFO L290 TraceCheckUtils]: 28: Hoare triple {20482#false} assume 0 == ~cond; {20482#false} is VALID [2022-04-28 03:48:27,247 INFO L290 TraceCheckUtils]: 27: Hoare triple {20482#false} ~cond := #in~cond; {20482#false} is VALID [2022-04-28 03:48:27,247 INFO L272 TraceCheckUtils]: 26: Hoare triple {20482#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {20482#false} is VALID [2022-04-28 03:48:27,247 INFO L290 TraceCheckUtils]: 25: Hoare triple {20482#false} assume !(~y~0 % 4294967296 > 0); {20482#false} is VALID [2022-04-28 03:48:27,248 INFO L290 TraceCheckUtils]: 24: Hoare triple {20482#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {20482#false} is VALID [2022-04-28 03:48:27,248 INFO L290 TraceCheckUtils]: 23: Hoare triple {20482#false} assume !(~z~0 % 4294967296 > 0); {20482#false} is VALID [2022-04-28 03:48:27,248 INFO L290 TraceCheckUtils]: 22: Hoare triple {20482#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20482#false} is VALID [2022-04-28 03:48:27,248 INFO L290 TraceCheckUtils]: 21: Hoare triple {20482#false} assume !(~x~0 % 4294967296 > 0); {20482#false} is VALID [2022-04-28 03:48:27,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {20482#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20482#false} is VALID [2022-04-28 03:48:27,251 INFO L290 TraceCheckUtils]: 19: Hoare triple {20560#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {20482#false} is VALID [2022-04-28 03:48:27,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {20556#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20560#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:48:27,253 INFO L290 TraceCheckUtils]: 17: Hoare triple {20552#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:48:27,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {20548#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20552#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:48:27,255 INFO L290 TraceCheckUtils]: 15: Hoare triple {20541#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20548#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:48:27,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {20541#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {20541#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:48:27,256 INFO L290 TraceCheckUtils]: 13: Hoare triple {20642#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20541#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:48:27,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {20646#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20642#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:48:27,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {20650#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20646#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:48:27,260 INFO L290 TraceCheckUtils]: 10: Hoare triple {20654#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20650#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:48:27,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {20658#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20654#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:48:27,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {20481#true} ~z~0 := ~y~0; {20658#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:48:27,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {20481#true} [153] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {20481#true} is VALID [2022-04-28 03:48:27,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {20481#true} [154] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_376 v_main_~y~0_375)) (.cse0 (mod v_main_~x~0_342 4294967296)) (.cse2 (= v_main_~x~0_342 v_main_~x~0_341)) (.cse3 (= |v_main_#t~post5_146| |v_main_#t~post5_145|)) (.cse4 (= |v_main_#t~post6_146| |v_main_#t~post6_145|))) (or (and (< 0 .cse0) (= v_main_~x~0_341 (+ v_main_~x~0_342 (* (- 1) v_main_~y~0_375) v_main_~y~0_376)) (< v_main_~y~0_376 v_main_~y~0_375) (forall ((v_it_29 Int)) (or (not (<= (+ v_main_~y~0_376 v_it_29 1) v_main_~y~0_375)) (< 0 (mod (+ v_main_~x~0_342 (* 4294967295 v_it_29)) 4294967296)) (not (<= 1 v_it_29))))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_376, main_#t~post5=|v_main_#t~post5_146|, main_~x~0=v_main_~x~0_342, main_#t~post6=|v_main_#t~post6_146|} OutVars{main_~y~0=v_main_~y~0_375, main_#t~post5=|v_main_#t~post5_145|, main_~x~0=v_main_~x~0_341, main_#t~post6=|v_main_#t~post6_145|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20481#true} is VALID [2022-04-28 03:48:27,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {20481#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20481#true} is VALID [2022-04-28 03:48:27,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {20481#true} call #t~ret17 := main(); {20481#true} is VALID [2022-04-28 03:48:27,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20481#true} {20481#true} #94#return; {20481#true} is VALID [2022-04-28 03:48:27,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {20481#true} assume true; {20481#true} is VALID [2022-04-28 03:48:27,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {20481#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20481#true} is VALID [2022-04-28 03:48:27,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {20481#true} call ULTIMATE.init(); {20481#true} is VALID [2022-04-28 03:48:27,263 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:48:27,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166467560] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:48:27,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:48:27,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 25 [2022-04-28 03:48:27,635 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:48:27,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [323588166] [2022-04-28 03:48:27,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [323588166] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:48:27,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:48:27,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 03:48:27,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985005257] [2022-04-28 03:48:27,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:48:27,636 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 03:48:27,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:48:27,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:27,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:27,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 03:48:27,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:27,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 03:48:27,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2022-04-28 03:48:27,665 INFO L87 Difference]: Start difference. First operand 125 states and 167 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:34,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:34,517 INFO L93 Difference]: Finished difference Result 348 states and 510 transitions. [2022-04-28 03:48:34,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 03:48:34,517 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 03:48:34,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:48:34,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:34,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 140 transitions. [2022-04-28 03:48:34,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:34,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 140 transitions. [2022-04-28 03:48:34,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 140 transitions. [2022-04-28 03:48:34,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:34,725 INFO L225 Difference]: With dead ends: 348 [2022-04-28 03:48:34,725 INFO L226 Difference]: Without dead ends: 305 [2022-04-28 03:48:34,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=208, Invalid=1432, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 03:48:34,726 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 203 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:48:34,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 56 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 03:48:34,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-04-28 03:48:35,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 138. [2022-04-28 03:48:35,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:48:35,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 305 states. Second operand has 138 states, 133 states have (on average 1.3759398496240602) internal successors, (183), 133 states have internal predecessors, (183), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:35,794 INFO L74 IsIncluded]: Start isIncluded. First operand 305 states. Second operand has 138 states, 133 states have (on average 1.3759398496240602) internal successors, (183), 133 states have internal predecessors, (183), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:35,795 INFO L87 Difference]: Start difference. First operand 305 states. Second operand has 138 states, 133 states have (on average 1.3759398496240602) internal successors, (183), 133 states have internal predecessors, (183), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:35,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:35,798 INFO L93 Difference]: Finished difference Result 305 states and 438 transitions. [2022-04-28 03:48:35,798 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 438 transitions. [2022-04-28 03:48:35,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:35,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:35,799 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 133 states have (on average 1.3759398496240602) internal successors, (183), 133 states have internal predecessors, (183), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 305 states. [2022-04-28 03:48:35,799 INFO L87 Difference]: Start difference. First operand has 138 states, 133 states have (on average 1.3759398496240602) internal successors, (183), 133 states have internal predecessors, (183), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 305 states. [2022-04-28 03:48:35,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:35,803 INFO L93 Difference]: Finished difference Result 305 states and 438 transitions. [2022-04-28 03:48:35,803 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 438 transitions. [2022-04-28 03:48:35,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:35,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:35,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:48:35,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:48:35,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 133 states have (on average 1.3759398496240602) internal successors, (183), 133 states have internal predecessors, (183), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:35,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 187 transitions. [2022-04-28 03:48:35,804 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 187 transitions. Word has length 32 [2022-04-28 03:48:35,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:48:35,805 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 187 transitions. [2022-04-28 03:48:35,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:35,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 138 states and 187 transitions. [2022-04-28 03:48:45,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 185 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:45,867 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 187 transitions. [2022-04-28 03:48:45,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 03:48:45,867 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:48:45,867 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:48:45,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-28 03:48:46,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:48:46,075 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:48:46,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:48:46,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1040491994, now seen corresponding path program 9 times [2022-04-28 03:48:46,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:46,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1228032111] [2022-04-28 03:48:46,345 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:48:46,346 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:48:46,348 INFO L85 PathProgramCache]: Analyzing trace with hash 312281849, now seen corresponding path program 1 times [2022-04-28 03:48:46,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:48:46,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618282778] [2022-04-28 03:48:46,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:46,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:48:46,357 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_30.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:48:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:46,368 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_30.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:48:46,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:48:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:46,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {22312#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22299#true} is VALID [2022-04-28 03:48:46,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {22299#true} assume true; {22299#true} is VALID [2022-04-28 03:48:46,719 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22299#true} {22299#true} #94#return; {22299#true} is VALID [2022-04-28 03:48:46,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {22299#true} call ULTIMATE.init(); {22312#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:48:46,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {22312#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22299#true} is VALID [2022-04-28 03:48:46,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {22299#true} assume true; {22299#true} is VALID [2022-04-28 03:48:46,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22299#true} {22299#true} #94#return; {22299#true} is VALID [2022-04-28 03:48:46,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {22299#true} call #t~ret17 := main(); {22299#true} is VALID [2022-04-28 03:48:46,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {22299#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22299#true} is VALID [2022-04-28 03:48:46,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {22299#true} [156] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_151| |v_main_#t~post6_150|)) (.cse1 (= v_main_~x~0_358 v_main_~x~0_357)) (.cse2 (= v_main_~y~0_395 v_main_~y~0_394)) (.cse4 (= |v_main_#t~post5_151| |v_main_#t~post5_150|)) (.cse3 (mod v_main_~x~0_358 4294967296))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and .cse0 .cse1 .cse2 .cse4) (and (< 0 .cse3) (< v_main_~y~0_395 v_main_~y~0_394) (= (+ v_main_~x~0_358 v_main_~y~0_395 (* (- 1) v_main_~y~0_394)) v_main_~x~0_357) (forall ((v_it_30 Int)) (or (not (<= (+ v_main_~y~0_395 v_it_30 1) v_main_~y~0_394)) (not (<= 1 v_it_30)) (< 0 (mod (+ v_main_~x~0_358 (* 4294967295 v_it_30)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_395, main_#t~post5=|v_main_#t~post5_151|, main_~x~0=v_main_~x~0_358, main_#t~post6=|v_main_#t~post6_151|} OutVars{main_~y~0=v_main_~y~0_394, main_#t~post5=|v_main_#t~post5_150|, main_~x~0=v_main_~x~0_357, main_#t~post6=|v_main_#t~post6_150|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {22299#true} is VALID [2022-04-28 03:48:46,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {22299#true} [155] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {22299#true} is VALID [2022-04-28 03:48:46,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {22299#true} ~z~0 := ~y~0; {22304#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:48:46,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {22304#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22305#(and (= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0) (<= main_~y~0 (+ 4294967295 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:48:46,723 INFO L290 TraceCheckUtils]: 10: Hoare triple {22305#(and (= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0) (<= main_~y~0 (+ 4294967295 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22306#(and (<= (+ main_~z~0 2) main_~y~0) (<= main_~y~0 (+ 4294967295 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:48:46,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {22306#(and (<= (+ main_~z~0 2) main_~y~0) (<= main_~y~0 (+ 4294967295 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22307#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:46,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {22307#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {22307#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:46,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {22307#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22308#(<= main_~y~0 (+ 4294967294 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:46,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {22308#(<= main_~y~0 (+ 4294967294 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22309#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 4294967293))} is VALID [2022-04-28 03:48:46,728 INFO L290 TraceCheckUtils]: 15: Hoare triple {22309#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22310#(<= main_~y~0 (+ 4294967292 (* (div main_~y~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:46,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {22310#(<= main_~y~0 (+ 4294967292 (* (div main_~y~0 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {22310#(<= main_~y~0 (+ 4294967292 (* (div main_~y~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:46,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {22310#(<= main_~y~0 (+ 4294967292 (* (div main_~y~0 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {22309#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 4294967293))} is VALID [2022-04-28 03:48:46,731 INFO L290 TraceCheckUtils]: 18: Hoare triple {22309#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {22308#(<= main_~y~0 (+ 4294967294 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:46,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {22308#(<= main_~y~0 (+ 4294967294 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {22307#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:46,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {22307#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {22307#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:46,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {22307#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {22307#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:46,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {22307#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {22307#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:46,734 INFO L290 TraceCheckUtils]: 23: Hoare triple {22307#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {22307#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:46,734 INFO L290 TraceCheckUtils]: 24: Hoare triple {22307#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {22307#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:46,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {22307#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {22311#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 2) main_~y~0)} is VALID [2022-04-28 03:48:46,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {22311#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 2) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {22300#false} is VALID [2022-04-28 03:48:46,736 INFO L272 TraceCheckUtils]: 27: Hoare triple {22300#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {22300#false} is VALID [2022-04-28 03:48:46,736 INFO L290 TraceCheckUtils]: 28: Hoare triple {22300#false} ~cond := #in~cond; {22300#false} is VALID [2022-04-28 03:48:46,736 INFO L290 TraceCheckUtils]: 29: Hoare triple {22300#false} assume 0 == ~cond; {22300#false} is VALID [2022-04-28 03:48:46,736 INFO L290 TraceCheckUtils]: 30: Hoare triple {22300#false} assume !false; {22300#false} is VALID [2022-04-28 03:48:46,736 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:48:46,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:48:46,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618282778] [2022-04-28 03:48:46,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618282778] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:48:46,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836519206] [2022-04-28 03:48:46,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:46,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:48:46,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:48:46,737 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:48:46,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-28 03:48:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:46,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 03:48:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:46,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:48:47,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {22299#true} call ULTIMATE.init(); {22299#true} is VALID [2022-04-28 03:48:47,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {22299#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22299#true} is VALID [2022-04-28 03:48:47,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {22299#true} assume true; {22299#true} is VALID [2022-04-28 03:48:47,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22299#true} {22299#true} #94#return; {22299#true} is VALID [2022-04-28 03:48:47,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {22299#true} call #t~ret17 := main(); {22299#true} is VALID [2022-04-28 03:48:47,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {22299#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22299#true} is VALID [2022-04-28 03:48:47,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {22299#true} [156] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_151| |v_main_#t~post6_150|)) (.cse1 (= v_main_~x~0_358 v_main_~x~0_357)) (.cse2 (= v_main_~y~0_395 v_main_~y~0_394)) (.cse4 (= |v_main_#t~post5_151| |v_main_#t~post5_150|)) (.cse3 (mod v_main_~x~0_358 4294967296))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and .cse0 .cse1 .cse2 .cse4) (and (< 0 .cse3) (< v_main_~y~0_395 v_main_~y~0_394) (= (+ v_main_~x~0_358 v_main_~y~0_395 (* (- 1) v_main_~y~0_394)) v_main_~x~0_357) (forall ((v_it_30 Int)) (or (not (<= (+ v_main_~y~0_395 v_it_30 1) v_main_~y~0_394)) (not (<= 1 v_it_30)) (< 0 (mod (+ v_main_~x~0_358 (* 4294967295 v_it_30)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_395, main_#t~post5=|v_main_#t~post5_151|, main_~x~0=v_main_~x~0_358, main_#t~post6=|v_main_#t~post6_151|} OutVars{main_~y~0=v_main_~y~0_394, main_#t~post5=|v_main_#t~post5_150|, main_~x~0=v_main_~x~0_357, main_#t~post6=|v_main_#t~post6_150|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {22299#true} is VALID [2022-04-28 03:48:47,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {22299#true} [155] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {22299#true} is VALID [2022-04-28 03:48:47,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {22299#true} ~z~0 := ~y~0; {22299#true} is VALID [2022-04-28 03:48:47,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {22299#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22299#true} is VALID [2022-04-28 03:48:47,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {22299#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22299#true} is VALID [2022-04-28 03:48:47,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {22299#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22299#true} is VALID [2022-04-28 03:48:47,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {22299#true} assume !(~z~0 % 4294967296 > 0); {22299#true} is VALID [2022-04-28 03:48:47,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {22299#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22299#true} is VALID [2022-04-28 03:48:47,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {22299#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22358#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 03:48:47,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {22358#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22362#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 03:48:47,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {22362#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !(~y~0 % 4294967296 > 0); {22362#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 03:48:47,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {22362#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {22358#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 03:48:47,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {22358#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {22372#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:48:47,097 INFO L290 TraceCheckUtils]: 19: Hoare triple {22372#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {22376#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:48:47,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {22376#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {22376#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:48:47,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {22376#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {22376#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:48:47,098 INFO L290 TraceCheckUtils]: 22: Hoare triple {22376#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {22376#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:48:47,098 INFO L290 TraceCheckUtils]: 23: Hoare triple {22376#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {22376#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:48:47,098 INFO L290 TraceCheckUtils]: 24: Hoare triple {22376#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {22376#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:48:47,101 INFO L290 TraceCheckUtils]: 25: Hoare triple {22376#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {22372#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:48:47,101 INFO L290 TraceCheckUtils]: 26: Hoare triple {22372#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {22300#false} is VALID [2022-04-28 03:48:47,101 INFO L272 TraceCheckUtils]: 27: Hoare triple {22300#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {22300#false} is VALID [2022-04-28 03:48:47,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {22300#false} ~cond := #in~cond; {22300#false} is VALID [2022-04-28 03:48:47,101 INFO L290 TraceCheckUtils]: 29: Hoare triple {22300#false} assume 0 == ~cond; {22300#false} is VALID [2022-04-28 03:48:47,101 INFO L290 TraceCheckUtils]: 30: Hoare triple {22300#false} assume !false; {22300#false} is VALID [2022-04-28 03:48:47,101 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-28 03:48:47,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:48:47,218 INFO L290 TraceCheckUtils]: 30: Hoare triple {22300#false} assume !false; {22300#false} is VALID [2022-04-28 03:48:47,218 INFO L290 TraceCheckUtils]: 29: Hoare triple {22300#false} assume 0 == ~cond; {22300#false} is VALID [2022-04-28 03:48:47,218 INFO L290 TraceCheckUtils]: 28: Hoare triple {22300#false} ~cond := #in~cond; {22300#false} is VALID [2022-04-28 03:48:47,219 INFO L272 TraceCheckUtils]: 27: Hoare triple {22300#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {22300#false} is VALID [2022-04-28 03:48:47,219 INFO L290 TraceCheckUtils]: 26: Hoare triple {22372#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {22300#false} is VALID [2022-04-28 03:48:47,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {22376#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {22372#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:48:47,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {22376#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {22376#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:48:47,221 INFO L290 TraceCheckUtils]: 23: Hoare triple {22376#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {22376#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:48:47,221 INFO L290 TraceCheckUtils]: 22: Hoare triple {22376#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {22376#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:48:47,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {22376#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {22376#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:48:47,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {22376#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {22376#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:48:47,223 INFO L290 TraceCheckUtils]: 19: Hoare triple {22372#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {22376#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:48:47,224 INFO L290 TraceCheckUtils]: 18: Hoare triple {22358#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {22372#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:48:47,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {22362#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {22358#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 03:48:47,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {22362#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !(~y~0 % 4294967296 > 0); {22362#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 03:48:47,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {22358#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22362#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 03:48:47,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {22299#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22358#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 03:48:47,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {22299#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22299#true} is VALID [2022-04-28 03:48:47,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {22299#true} assume !(~z~0 % 4294967296 > 0); {22299#true} is VALID [2022-04-28 03:48:47,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {22299#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22299#true} is VALID [2022-04-28 03:48:47,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {22299#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22299#true} is VALID [2022-04-28 03:48:47,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {22299#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22299#true} is VALID [2022-04-28 03:48:47,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {22299#true} ~z~0 := ~y~0; {22299#true} is VALID [2022-04-28 03:48:47,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {22299#true} [155] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {22299#true} is VALID [2022-04-28 03:48:47,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {22299#true} [156] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_151| |v_main_#t~post6_150|)) (.cse1 (= v_main_~x~0_358 v_main_~x~0_357)) (.cse2 (= v_main_~y~0_395 v_main_~y~0_394)) (.cse4 (= |v_main_#t~post5_151| |v_main_#t~post5_150|)) (.cse3 (mod v_main_~x~0_358 4294967296))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and .cse0 .cse1 .cse2 .cse4) (and (< 0 .cse3) (< v_main_~y~0_395 v_main_~y~0_394) (= (+ v_main_~x~0_358 v_main_~y~0_395 (* (- 1) v_main_~y~0_394)) v_main_~x~0_357) (forall ((v_it_30 Int)) (or (not (<= (+ v_main_~y~0_395 v_it_30 1) v_main_~y~0_394)) (not (<= 1 v_it_30)) (< 0 (mod (+ v_main_~x~0_358 (* 4294967295 v_it_30)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_395, main_#t~post5=|v_main_#t~post5_151|, main_~x~0=v_main_~x~0_358, main_#t~post6=|v_main_#t~post6_151|} OutVars{main_~y~0=v_main_~y~0_394, main_#t~post5=|v_main_#t~post5_150|, main_~x~0=v_main_~x~0_357, main_#t~post6=|v_main_#t~post6_150|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {22299#true} is VALID [2022-04-28 03:48:47,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {22299#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22299#true} is VALID [2022-04-28 03:48:47,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {22299#true} call #t~ret17 := main(); {22299#true} is VALID [2022-04-28 03:48:47,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22299#true} {22299#true} #94#return; {22299#true} is VALID [2022-04-28 03:48:47,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {22299#true} assume true; {22299#true} is VALID [2022-04-28 03:48:47,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {22299#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22299#true} is VALID [2022-04-28 03:48:47,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {22299#true} call ULTIMATE.init(); {22299#true} is VALID [2022-04-28 03:48:47,228 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-28 03:48:47,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836519206] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:48:47,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:48:47,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 15 [2022-04-28 03:48:47,473 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:48:47,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1228032111] [2022-04-28 03:48:47,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1228032111] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:48:47,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:48:47,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 03:48:47,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895234180] [2022-04-28 03:48:47,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:48:47,474 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-28 03:48:47,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:48:47,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:47,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:47,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 03:48:47,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:47,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 03:48:47,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-04-28 03:48:47,508 INFO L87 Difference]: Start difference. First operand 138 states and 187 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:54,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:54,301 INFO L93 Difference]: Finished difference Result 205 states and 284 transitions. [2022-04-28 03:48:54,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 03:48:54,301 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-28 03:48:54,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:48:54,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:54,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 125 transitions. [2022-04-28 03:48:54,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:54,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 125 transitions. [2022-04-28 03:48:54,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 125 transitions. [2022-04-28 03:48:54,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:54,498 INFO L225 Difference]: With dead ends: 205 [2022-04-28 03:48:54,498 INFO L226 Difference]: Without dead ends: 200 [2022-04-28 03:48:54,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=342, Invalid=1550, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 03:48:54,499 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 77 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:48:54,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 60 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-28 03:48:54,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-04-28 03:48:55,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 140. [2022-04-28 03:48:55,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:48:55,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand has 140 states, 135 states have (on average 1.3703703703703705) internal successors, (185), 135 states have internal predecessors, (185), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:55,681 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand has 140 states, 135 states have (on average 1.3703703703703705) internal successors, (185), 135 states have internal predecessors, (185), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:55,681 INFO L87 Difference]: Start difference. First operand 200 states. Second operand has 140 states, 135 states have (on average 1.3703703703703705) internal successors, (185), 135 states have internal predecessors, (185), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:55,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:55,683 INFO L93 Difference]: Finished difference Result 200 states and 272 transitions. [2022-04-28 03:48:55,683 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 272 transitions. [2022-04-28 03:48:55,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:55,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:55,683 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 135 states have (on average 1.3703703703703705) internal successors, (185), 135 states have internal predecessors, (185), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 200 states. [2022-04-28 03:48:55,684 INFO L87 Difference]: Start difference. First operand has 140 states, 135 states have (on average 1.3703703703703705) internal successors, (185), 135 states have internal predecessors, (185), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 200 states. [2022-04-28 03:48:55,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:55,686 INFO L93 Difference]: Finished difference Result 200 states and 272 transitions. [2022-04-28 03:48:55,686 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 272 transitions. [2022-04-28 03:48:55,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:55,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:55,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:48:55,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:48:55,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 135 states have (on average 1.3703703703703705) internal successors, (185), 135 states have internal predecessors, (185), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:55,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 189 transitions. [2022-04-28 03:48:55,687 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 189 transitions. Word has length 33 [2022-04-28 03:48:55,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:48:55,688 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 189 transitions. [2022-04-28 03:48:55,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:55,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 189 transitions. [2022-04-28 03:49:04,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 187 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:49:04,604 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 189 transitions. [2022-04-28 03:49:04,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 03:49:04,604 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:49:04,604 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:49:04,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-28 03:49:04,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-04-28 03:49:04,805 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:49:04,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:49:04,805 INFO L85 PathProgramCache]: Analyzing trace with hash 425178919, now seen corresponding path program 5 times [2022-04-28 03:49:04,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:49:04,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1374293321] [2022-04-28 03:49:08,951 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:49:09,070 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:49:09,071 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:49:09,073 INFO L85 PathProgramCache]: Analyzing trace with hash -296496122, now seen corresponding path program 1 times [2022-04-28 03:49:09,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:49:09,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846068002] [2022-04-28 03:49:09,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:49:09,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:49:09,091 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_31.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:49:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:09,112 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_31.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:49:09,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:49:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:09,603 INFO L290 TraceCheckUtils]: 0: Hoare triple {23665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23650#true} is VALID [2022-04-28 03:49:09,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {23650#true} assume true; {23650#true} is VALID [2022-04-28 03:49:09,603 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23650#true} {23650#true} #94#return; {23650#true} is VALID [2022-04-28 03:49:09,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {23650#true} call ULTIMATE.init(); {23665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:49:09,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {23665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23650#true} is VALID [2022-04-28 03:49:09,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {23650#true} assume true; {23650#true} is VALID [2022-04-28 03:49:09,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23650#true} {23650#true} #94#return; {23650#true} is VALID [2022-04-28 03:49:09,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {23650#true} call #t~ret17 := main(); {23650#true} is VALID [2022-04-28 03:49:09,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {23650#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23650#true} is VALID [2022-04-28 03:49:09,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {23650#true} [158] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_156| |v_main_#t~post6_155|)) (.cse1 (= v_main_~x~0_373 v_main_~x~0_372)) (.cse2 (= v_main_~y~0_416 v_main_~y~0_415)) (.cse3 (= |v_main_#t~post5_156| |v_main_#t~post5_155|)) (.cse4 (mod v_main_~x~0_373 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3) (and (forall ((v_it_31 Int)) (or (not (<= 1 v_it_31)) (< 0 (mod (+ v_main_~x~0_373 (* 4294967295 v_it_31)) 4294967296)) (not (<= (+ v_main_~y~0_416 v_it_31 1) v_main_~y~0_415)))) (< 0 .cse4) (= v_main_~x~0_372 (+ v_main_~x~0_373 v_main_~y~0_416 (* (- 1) v_main_~y~0_415))) (< v_main_~y~0_416 v_main_~y~0_415)))) InVars {main_~y~0=v_main_~y~0_416, main_#t~post5=|v_main_#t~post5_156|, main_~x~0=v_main_~x~0_373, main_#t~post6=|v_main_#t~post6_156|} OutVars{main_~y~0=v_main_~y~0_415, main_#t~post5=|v_main_#t~post5_155|, main_~x~0=v_main_~x~0_372, main_#t~post6=|v_main_#t~post6_155|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {23650#true} is VALID [2022-04-28 03:49:09,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {23650#true} [157] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {23650#true} is VALID [2022-04-28 03:49:09,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {23650#true} ~z~0 := ~y~0; {23655#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:49:09,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {23655#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23656#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:49:09,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {23656#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23657#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967296)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:49:09,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {23657#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967296)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23658#(and (or (<= (+ main_~z~0 3) main_~y~0) (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296))) (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:09,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {23658#(and (or (<= (+ main_~z~0 3) main_~y~0) (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296))) (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23659#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (* 4294967296 (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 (* (- 1) main_~y~0) 4294967299) 4294967296)) main_~z~0))} is VALID [2022-04-28 03:49:09,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {23659#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (* 4294967296 (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 (* (- 1) main_~y~0) 4294967299) 4294967296)) main_~z~0))} assume !(~z~0 % 4294967296 > 0); {23659#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (* 4294967296 (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 (* (- 1) main_~y~0) 4294967299) 4294967296)) main_~z~0))} is VALID [2022-04-28 03:49:09,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {23659#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (* 4294967296 (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 (* (- 1) main_~y~0) 4294967299) 4294967296)) main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23660#(<= (+ (* (div (+ main_~z~0 3) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:49:09,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {23660#(<= (+ (* (div (+ main_~z~0 3) 4294967296) 4294967296) 1) main_~z~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23661#(<= (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) 2) main_~z~0)} is VALID [2022-04-28 03:49:09,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {23661#(<= (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) 2) main_~z~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23662#(<= (+ 3 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:49:09,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {23662#(<= (+ 3 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) main_~z~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23663#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-28 03:49:09,615 INFO L290 TraceCheckUtils]: 18: Hoare triple {23663#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {23663#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-28 03:49:09,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {23663#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23663#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-28 03:49:09,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {23663#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23663#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-28 03:49:09,615 INFO L290 TraceCheckUtils]: 21: Hoare triple {23663#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23663#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-28 03:49:09,616 INFO L290 TraceCheckUtils]: 22: Hoare triple {23663#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23663#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-28 03:49:09,616 INFO L290 TraceCheckUtils]: 23: Hoare triple {23663#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {23663#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-28 03:49:09,617 INFO L290 TraceCheckUtils]: 24: Hoare triple {23663#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {23664#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:49:09,618 INFO L290 TraceCheckUtils]: 25: Hoare triple {23664#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {23651#false} is VALID [2022-04-28 03:49:09,618 INFO L290 TraceCheckUtils]: 26: Hoare triple {23651#false} assume !(~y~0 % 4294967296 > 0); {23651#false} is VALID [2022-04-28 03:49:09,618 INFO L272 TraceCheckUtils]: 27: Hoare triple {23651#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23651#false} is VALID [2022-04-28 03:49:09,618 INFO L290 TraceCheckUtils]: 28: Hoare triple {23651#false} ~cond := #in~cond; {23651#false} is VALID [2022-04-28 03:49:09,618 INFO L290 TraceCheckUtils]: 29: Hoare triple {23651#false} assume 0 == ~cond; {23651#false} is VALID [2022-04-28 03:49:09,618 INFO L290 TraceCheckUtils]: 30: Hoare triple {23651#false} assume !false; {23651#false} is VALID [2022-04-28 03:49:09,618 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:49:09,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:49:09,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846068002] [2022-04-28 03:49:09,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846068002] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:49:09,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610557270] [2022-04-28 03:49:09,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:49:09,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:49:09,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:49:09,620 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:49:09,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-28 03:49:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:09,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 03:49:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:09,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:49:10,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {23650#true} call ULTIMATE.init(); {23650#true} is VALID [2022-04-28 03:49:10,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {23650#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23650#true} is VALID [2022-04-28 03:49:10,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {23650#true} assume true; {23650#true} is VALID [2022-04-28 03:49:10,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23650#true} {23650#true} #94#return; {23650#true} is VALID [2022-04-28 03:49:10,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {23650#true} call #t~ret17 := main(); {23650#true} is VALID [2022-04-28 03:49:10,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {23650#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23650#true} is VALID [2022-04-28 03:49:10,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {23650#true} [158] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_156| |v_main_#t~post6_155|)) (.cse1 (= v_main_~x~0_373 v_main_~x~0_372)) (.cse2 (= v_main_~y~0_416 v_main_~y~0_415)) (.cse3 (= |v_main_#t~post5_156| |v_main_#t~post5_155|)) (.cse4 (mod v_main_~x~0_373 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3) (and (forall ((v_it_31 Int)) (or (not (<= 1 v_it_31)) (< 0 (mod (+ v_main_~x~0_373 (* 4294967295 v_it_31)) 4294967296)) (not (<= (+ v_main_~y~0_416 v_it_31 1) v_main_~y~0_415)))) (< 0 .cse4) (= v_main_~x~0_372 (+ v_main_~x~0_373 v_main_~y~0_416 (* (- 1) v_main_~y~0_415))) (< v_main_~y~0_416 v_main_~y~0_415)))) InVars {main_~y~0=v_main_~y~0_416, main_#t~post5=|v_main_#t~post5_156|, main_~x~0=v_main_~x~0_373, main_#t~post6=|v_main_#t~post6_156|} OutVars{main_~y~0=v_main_~y~0_415, main_#t~post5=|v_main_#t~post5_155|, main_~x~0=v_main_~x~0_372, main_#t~post6=|v_main_#t~post6_155|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {23650#true} is VALID [2022-04-28 03:49:10,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {23650#true} [157] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {23650#true} is VALID [2022-04-28 03:49:10,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {23650#true} ~z~0 := ~y~0; {23655#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:49:10,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {23655#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23656#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:49:10,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {23656#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23699#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:49:10,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {23699#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23703#(= (+ main_~z~0 2) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:49:10,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {23703#(= (+ main_~z~0 2) (+ (- 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23707#(= (+ main_~y~0 (- 3)) (+ main_~z~0 1))} is VALID [2022-04-28 03:49:10,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {23707#(= (+ main_~y~0 (- 3)) (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {23707#(= (+ main_~y~0 (- 3)) (+ main_~z~0 1))} is VALID [2022-04-28 03:49:10,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {23707#(= (+ main_~y~0 (- 3)) (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23699#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:49:10,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {23699#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23717#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:49:10,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {23717#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23721#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:49:10,228 INFO L290 TraceCheckUtils]: 17: Hoare triple {23721#(< 0 (mod main_~z~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23725#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:49:10,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {23725#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {23725#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:49:10,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {23725#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23725#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:49:10,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {23725#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23725#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:49:10,230 INFO L290 TraceCheckUtils]: 21: Hoare triple {23725#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23725#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:49:10,230 INFO L290 TraceCheckUtils]: 22: Hoare triple {23725#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23725#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:49:10,230 INFO L290 TraceCheckUtils]: 23: Hoare triple {23725#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {23725#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:49:10,231 INFO L290 TraceCheckUtils]: 24: Hoare triple {23725#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {23721#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:49:10,232 INFO L290 TraceCheckUtils]: 25: Hoare triple {23721#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {23651#false} is VALID [2022-04-28 03:49:10,232 INFO L290 TraceCheckUtils]: 26: Hoare triple {23651#false} assume !(~y~0 % 4294967296 > 0); {23651#false} is VALID [2022-04-28 03:49:10,232 INFO L272 TraceCheckUtils]: 27: Hoare triple {23651#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23651#false} is VALID [2022-04-28 03:49:10,232 INFO L290 TraceCheckUtils]: 28: Hoare triple {23651#false} ~cond := #in~cond; {23651#false} is VALID [2022-04-28 03:49:10,232 INFO L290 TraceCheckUtils]: 29: Hoare triple {23651#false} assume 0 == ~cond; {23651#false} is VALID [2022-04-28 03:49:10,232 INFO L290 TraceCheckUtils]: 30: Hoare triple {23651#false} assume !false; {23651#false} is VALID [2022-04-28 03:49:10,232 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:49:10,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:49:10,977 INFO L290 TraceCheckUtils]: 30: Hoare triple {23651#false} assume !false; {23651#false} is VALID [2022-04-28 03:49:10,977 INFO L290 TraceCheckUtils]: 29: Hoare triple {23651#false} assume 0 == ~cond; {23651#false} is VALID [2022-04-28 03:49:10,977 INFO L290 TraceCheckUtils]: 28: Hoare triple {23651#false} ~cond := #in~cond; {23651#false} is VALID [2022-04-28 03:49:10,977 INFO L272 TraceCheckUtils]: 27: Hoare triple {23651#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23651#false} is VALID [2022-04-28 03:49:10,977 INFO L290 TraceCheckUtils]: 26: Hoare triple {23651#false} assume !(~y~0 % 4294967296 > 0); {23651#false} is VALID [2022-04-28 03:49:10,977 INFO L290 TraceCheckUtils]: 25: Hoare triple {23721#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {23651#false} is VALID [2022-04-28 03:49:10,979 INFO L290 TraceCheckUtils]: 24: Hoare triple {23725#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {23721#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:49:10,979 INFO L290 TraceCheckUtils]: 23: Hoare triple {23725#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {23725#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:49:10,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {23725#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23725#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:49:10,980 INFO L290 TraceCheckUtils]: 21: Hoare triple {23725#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23725#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:49:10,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {23725#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23725#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:49:10,980 INFO L290 TraceCheckUtils]: 19: Hoare triple {23725#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23725#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:49:10,981 INFO L290 TraceCheckUtils]: 18: Hoare triple {23725#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {23725#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:49:10,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {23721#(< 0 (mod main_~z~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23725#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:49:10,982 INFO L290 TraceCheckUtils]: 16: Hoare triple {23717#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23721#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:49:10,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {23810#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (not (< 0 (mod main_~y~0 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23717#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:49:10,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {23814#(or (< 0 (mod (+ main_~z~0 3) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23810#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (not (< 0 (mod main_~y~0 4294967296))))} is VALID [2022-04-28 03:49:10,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {23814#(or (< 0 (mod (+ main_~z~0 3) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {23814#(or (< 0 (mod (+ main_~z~0 3) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:49:10,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {23821#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23814#(or (< 0 (mod (+ main_~z~0 3) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:49:10,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {23825#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23821#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:49:10,989 INFO L290 TraceCheckUtils]: 10: Hoare triple {23829#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23825#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:49:10,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {23833#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23829#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:49:10,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {23650#true} ~z~0 := ~y~0; {23833#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:49:10,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {23650#true} [157] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {23650#true} is VALID [2022-04-28 03:49:10,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {23650#true} [158] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_156| |v_main_#t~post6_155|)) (.cse1 (= v_main_~x~0_373 v_main_~x~0_372)) (.cse2 (= v_main_~y~0_416 v_main_~y~0_415)) (.cse3 (= |v_main_#t~post5_156| |v_main_#t~post5_155|)) (.cse4 (mod v_main_~x~0_373 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3) (and (forall ((v_it_31 Int)) (or (not (<= 1 v_it_31)) (< 0 (mod (+ v_main_~x~0_373 (* 4294967295 v_it_31)) 4294967296)) (not (<= (+ v_main_~y~0_416 v_it_31 1) v_main_~y~0_415)))) (< 0 .cse4) (= v_main_~x~0_372 (+ v_main_~x~0_373 v_main_~y~0_416 (* (- 1) v_main_~y~0_415))) (< v_main_~y~0_416 v_main_~y~0_415)))) InVars {main_~y~0=v_main_~y~0_416, main_#t~post5=|v_main_#t~post5_156|, main_~x~0=v_main_~x~0_373, main_#t~post6=|v_main_#t~post6_156|} OutVars{main_~y~0=v_main_~y~0_415, main_#t~post5=|v_main_#t~post5_155|, main_~x~0=v_main_~x~0_372, main_#t~post6=|v_main_#t~post6_155|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {23650#true} is VALID [2022-04-28 03:49:10,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {23650#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23650#true} is VALID [2022-04-28 03:49:10,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {23650#true} call #t~ret17 := main(); {23650#true} is VALID [2022-04-28 03:49:10,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23650#true} {23650#true} #94#return; {23650#true} is VALID [2022-04-28 03:49:10,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {23650#true} assume true; {23650#true} is VALID [2022-04-28 03:49:10,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {23650#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23650#true} is VALID [2022-04-28 03:49:10,992 INFO L272 TraceCheckUtils]: 0: Hoare triple {23650#true} call ULTIMATE.init(); {23650#true} is VALID [2022-04-28 03:49:10,992 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:49:10,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610557270] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:49:10,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:49:10,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 11] total 25 [2022-04-28 03:49:11,339 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:49:11,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1374293321] [2022-04-28 03:49:11,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1374293321] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:49:11,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:49:11,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 03:49:11,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125156354] [2022-04-28 03:49:11,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:49:11,340 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-28 03:49:11,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:49:11,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:11,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:49:11,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 03:49:11,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:49:11,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 03:49:11,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2022-04-28 03:49:11,381 INFO L87 Difference]: Start difference. First operand 140 states and 189 transitions. Second operand has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:21,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:21,835 INFO L93 Difference]: Finished difference Result 242 states and 329 transitions. [2022-04-28 03:49:21,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 03:49:21,836 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-28 03:49:21,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:49:21,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:21,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 114 transitions. [2022-04-28 03:49:21,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:21,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 114 transitions. [2022-04-28 03:49:21,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 114 transitions. [2022-04-28 03:49:22,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:49:22,090 INFO L225 Difference]: With dead ends: 242 [2022-04-28 03:49:22,090 INFO L226 Difference]: Without dead ends: 230 [2022-04-28 03:49:22,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=587, Invalid=3319, Unknown=0, NotChecked=0, Total=3906 [2022-04-28 03:49:22,091 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 47 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:49:22,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 84 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 03:49:22,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-04-28 03:49:23,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 167. [2022-04-28 03:49:23,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:49:23,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 230 states. Second operand has 167 states, 162 states have (on average 1.3395061728395061) internal successors, (217), 162 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:23,555 INFO L74 IsIncluded]: Start isIncluded. First operand 230 states. Second operand has 167 states, 162 states have (on average 1.3395061728395061) internal successors, (217), 162 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:23,555 INFO L87 Difference]: Start difference. First operand 230 states. Second operand has 167 states, 162 states have (on average 1.3395061728395061) internal successors, (217), 162 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:23,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:23,557 INFO L93 Difference]: Finished difference Result 230 states and 302 transitions. [2022-04-28 03:49:23,557 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 302 transitions. [2022-04-28 03:49:23,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:49:23,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:49:23,558 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 162 states have (on average 1.3395061728395061) internal successors, (217), 162 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 230 states. [2022-04-28 03:49:23,558 INFO L87 Difference]: Start difference. First operand has 167 states, 162 states have (on average 1.3395061728395061) internal successors, (217), 162 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 230 states. [2022-04-28 03:49:23,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:23,560 INFO L93 Difference]: Finished difference Result 230 states and 302 transitions. [2022-04-28 03:49:23,560 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 302 transitions. [2022-04-28 03:49:23,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:49:23,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:49:23,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:49:23,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:49:23,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 162 states have (on average 1.3395061728395061) internal successors, (217), 162 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:23,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 221 transitions. [2022-04-28 03:49:23,563 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 221 transitions. Word has length 33 [2022-04-28 03:49:23,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:49:23,563 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 221 transitions. [2022-04-28 03:49:23,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:23,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 167 states and 221 transitions. [2022-04-28 03:49:37,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 218 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 03:49:37,600 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 221 transitions. [2022-04-28 03:49:37,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 03:49:37,600 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:49:37,600 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:49:37,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-28 03:49:37,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-04-28 03:49:37,801 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:49:37,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:49:37,801 INFO L85 PathProgramCache]: Analyzing trace with hash -893507562, now seen corresponding path program 6 times [2022-04-28 03:49:37,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:49:37,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1135161818] [2022-04-28 03:49:38,099 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:49:38,101 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:49:38,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1588009129, now seen corresponding path program 1 times [2022-04-28 03:49:38,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:49:38,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842602697] [2022-04-28 03:49:38,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:49:38,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:49:38,111 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_32.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:49:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:38,122 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_32.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:49:38,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:49:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:38,473 INFO L290 TraceCheckUtils]: 0: Hoare triple {25229#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25216#true} is VALID [2022-04-28 03:49:38,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {25216#true} assume true; {25216#true} is VALID [2022-04-28 03:49:38,473 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25216#true} {25216#true} #94#return; {25216#true} is VALID [2022-04-28 03:49:38,473 INFO L272 TraceCheckUtils]: 0: Hoare triple {25216#true} call ULTIMATE.init(); {25229#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:49:38,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {25229#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25216#true} is VALID [2022-04-28 03:49:38,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {25216#true} assume true; {25216#true} is VALID [2022-04-28 03:49:38,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25216#true} {25216#true} #94#return; {25216#true} is VALID [2022-04-28 03:49:38,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {25216#true} call #t~ret17 := main(); {25216#true} is VALID [2022-04-28 03:49:38,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {25216#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25216#true} is VALID [2022-04-28 03:49:38,474 INFO L290 TraceCheckUtils]: 6: Hoare triple {25216#true} [160] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_161| |v_main_#t~post6_160|)) (.cse2 (= v_main_~y~0_434 v_main_~y~0_433)) (.cse3 (= v_main_~x~0_391 v_main_~x~0_390)) (.cse4 (= |v_main_#t~post5_161| |v_main_#t~post5_160|)) (.cse0 (mod v_main_~x~0_391 4294967296))) (or (and (< 0 .cse0) (< v_main_~y~0_434 v_main_~y~0_433) (= (+ v_main_~x~0_391 v_main_~y~0_434 (* (- 1) v_main_~y~0_433)) v_main_~x~0_390) (forall ((v_it_32 Int)) (or (< 0 (mod (+ v_main_~x~0_391 (* 4294967295 v_it_32)) 4294967296)) (not (<= 1 v_it_32)) (not (<= (+ v_main_~y~0_434 v_it_32 1) v_main_~y~0_433))))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)))) InVars {main_~y~0=v_main_~y~0_434, main_#t~post5=|v_main_#t~post5_161|, main_~x~0=v_main_~x~0_391, main_#t~post6=|v_main_#t~post6_161|} OutVars{main_~y~0=v_main_~y~0_433, main_#t~post5=|v_main_#t~post5_160|, main_~x~0=v_main_~x~0_390, main_#t~post6=|v_main_#t~post6_160|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25216#true} is VALID [2022-04-28 03:49:38,474 INFO L290 TraceCheckUtils]: 7: Hoare triple {25216#true} [159] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {25216#true} is VALID [2022-04-28 03:49:38,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {25216#true} ~z~0 := ~y~0; {25221#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:49:38,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {25221#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25222#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:49:38,476 INFO L290 TraceCheckUtils]: 10: Hoare triple {25222#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25223#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:49:38,477 INFO L290 TraceCheckUtils]: 11: Hoare triple {25223#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25224#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:49:38,478 INFO L290 TraceCheckUtils]: 12: Hoare triple {25224#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25225#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:49:38,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {25225#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {25225#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:49:38,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {25225#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25226#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:49:38,480 INFO L290 TraceCheckUtils]: 15: Hoare triple {25226#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25227#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:49:38,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {25227#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25228#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:49:38,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {25228#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {25217#false} is VALID [2022-04-28 03:49:38,482 INFO L290 TraceCheckUtils]: 18: Hoare triple {25217#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25217#false} is VALID [2022-04-28 03:49:38,482 INFO L290 TraceCheckUtils]: 19: Hoare triple {25217#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25217#false} is VALID [2022-04-28 03:49:38,482 INFO L290 TraceCheckUtils]: 20: Hoare triple {25217#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25217#false} is VALID [2022-04-28 03:49:38,482 INFO L290 TraceCheckUtils]: 21: Hoare triple {25217#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25217#false} is VALID [2022-04-28 03:49:38,482 INFO L290 TraceCheckUtils]: 22: Hoare triple {25217#false} assume !(~x~0 % 4294967296 > 0); {25217#false} is VALID [2022-04-28 03:49:38,482 INFO L290 TraceCheckUtils]: 23: Hoare triple {25217#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {25217#false} is VALID [2022-04-28 03:49:38,482 INFO L290 TraceCheckUtils]: 24: Hoare triple {25217#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {25217#false} is VALID [2022-04-28 03:49:38,483 INFO L290 TraceCheckUtils]: 25: Hoare triple {25217#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {25217#false} is VALID [2022-04-28 03:49:38,483 INFO L290 TraceCheckUtils]: 26: Hoare triple {25217#false} assume !(~z~0 % 4294967296 > 0); {25217#false} is VALID [2022-04-28 03:49:38,483 INFO L290 TraceCheckUtils]: 27: Hoare triple {25217#false} assume !(~y~0 % 4294967296 > 0); {25217#false} is VALID [2022-04-28 03:49:38,483 INFO L272 TraceCheckUtils]: 28: Hoare triple {25217#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {25217#false} is VALID [2022-04-28 03:49:38,483 INFO L290 TraceCheckUtils]: 29: Hoare triple {25217#false} ~cond := #in~cond; {25217#false} is VALID [2022-04-28 03:49:38,483 INFO L290 TraceCheckUtils]: 30: Hoare triple {25217#false} assume 0 == ~cond; {25217#false} is VALID [2022-04-28 03:49:38,483 INFO L290 TraceCheckUtils]: 31: Hoare triple {25217#false} assume !false; {25217#false} is VALID [2022-04-28 03:49:38,483 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 03:49:38,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:49:38,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842602697] [2022-04-28 03:49:38,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842602697] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:49:38,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547087793] [2022-04-28 03:49:38,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:49:38,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:49:38,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:49:38,485 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:49:38,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-28 03:49:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:38,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 03:49:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:38,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:49:39,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {25216#true} call ULTIMATE.init(); {25216#true} is VALID [2022-04-28 03:49:39,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {25216#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25216#true} is VALID [2022-04-28 03:49:39,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {25216#true} assume true; {25216#true} is VALID [2022-04-28 03:49:39,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25216#true} {25216#true} #94#return; {25216#true} is VALID [2022-04-28 03:49:39,182 INFO L272 TraceCheckUtils]: 4: Hoare triple {25216#true} call #t~ret17 := main(); {25216#true} is VALID [2022-04-28 03:49:39,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {25216#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25216#true} is VALID [2022-04-28 03:49:39,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {25216#true} [160] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_161| |v_main_#t~post6_160|)) (.cse2 (= v_main_~y~0_434 v_main_~y~0_433)) (.cse3 (= v_main_~x~0_391 v_main_~x~0_390)) (.cse4 (= |v_main_#t~post5_161| |v_main_#t~post5_160|)) (.cse0 (mod v_main_~x~0_391 4294967296))) (or (and (< 0 .cse0) (< v_main_~y~0_434 v_main_~y~0_433) (= (+ v_main_~x~0_391 v_main_~y~0_434 (* (- 1) v_main_~y~0_433)) v_main_~x~0_390) (forall ((v_it_32 Int)) (or (< 0 (mod (+ v_main_~x~0_391 (* 4294967295 v_it_32)) 4294967296)) (not (<= 1 v_it_32)) (not (<= (+ v_main_~y~0_434 v_it_32 1) v_main_~y~0_433))))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)))) InVars {main_~y~0=v_main_~y~0_434, main_#t~post5=|v_main_#t~post5_161|, main_~x~0=v_main_~x~0_391, main_#t~post6=|v_main_#t~post6_161|} OutVars{main_~y~0=v_main_~y~0_433, main_#t~post5=|v_main_#t~post5_160|, main_~x~0=v_main_~x~0_390, main_#t~post6=|v_main_#t~post6_160|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25216#true} is VALID [2022-04-28 03:49:39,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {25216#true} [159] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {25216#true} is VALID [2022-04-28 03:49:39,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {25216#true} ~z~0 := ~y~0; {25221#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:49:39,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {25221#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25222#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:49:39,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {25222#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25223#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:49:39,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {25223#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25224#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:49:39,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {25224#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25225#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:49:39,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {25225#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {25225#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:49:39,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {25225#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25226#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:49:39,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {25226#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25227#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:49:39,189 INFO L290 TraceCheckUtils]: 16: Hoare triple {25227#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25228#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:49:39,190 INFO L290 TraceCheckUtils]: 17: Hoare triple {25228#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {25217#false} is VALID [2022-04-28 03:49:39,190 INFO L290 TraceCheckUtils]: 18: Hoare triple {25217#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25217#false} is VALID [2022-04-28 03:49:39,190 INFO L290 TraceCheckUtils]: 19: Hoare triple {25217#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25217#false} is VALID [2022-04-28 03:49:39,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {25217#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25217#false} is VALID [2022-04-28 03:49:39,190 INFO L290 TraceCheckUtils]: 21: Hoare triple {25217#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25217#false} is VALID [2022-04-28 03:49:39,190 INFO L290 TraceCheckUtils]: 22: Hoare triple {25217#false} assume !(~x~0 % 4294967296 > 0); {25217#false} is VALID [2022-04-28 03:49:39,190 INFO L290 TraceCheckUtils]: 23: Hoare triple {25217#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {25217#false} is VALID [2022-04-28 03:49:39,190 INFO L290 TraceCheckUtils]: 24: Hoare triple {25217#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {25217#false} is VALID [2022-04-28 03:49:39,190 INFO L290 TraceCheckUtils]: 25: Hoare triple {25217#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {25217#false} is VALID [2022-04-28 03:49:39,190 INFO L290 TraceCheckUtils]: 26: Hoare triple {25217#false} assume !(~z~0 % 4294967296 > 0); {25217#false} is VALID [2022-04-28 03:49:39,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {25217#false} assume !(~y~0 % 4294967296 > 0); {25217#false} is VALID [2022-04-28 03:49:39,190 INFO L272 TraceCheckUtils]: 28: Hoare triple {25217#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {25217#false} is VALID [2022-04-28 03:49:39,191 INFO L290 TraceCheckUtils]: 29: Hoare triple {25217#false} ~cond := #in~cond; {25217#false} is VALID [2022-04-28 03:49:39,191 INFO L290 TraceCheckUtils]: 30: Hoare triple {25217#false} assume 0 == ~cond; {25217#false} is VALID [2022-04-28 03:49:39,191 INFO L290 TraceCheckUtils]: 31: Hoare triple {25217#false} assume !false; {25217#false} is VALID [2022-04-28 03:49:39,191 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 03:49:39,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:49:39,928 INFO L290 TraceCheckUtils]: 31: Hoare triple {25217#false} assume !false; {25217#false} is VALID [2022-04-28 03:49:39,928 INFO L290 TraceCheckUtils]: 30: Hoare triple {25217#false} assume 0 == ~cond; {25217#false} is VALID [2022-04-28 03:49:39,928 INFO L290 TraceCheckUtils]: 29: Hoare triple {25217#false} ~cond := #in~cond; {25217#false} is VALID [2022-04-28 03:49:39,928 INFO L272 TraceCheckUtils]: 28: Hoare triple {25217#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {25217#false} is VALID [2022-04-28 03:49:39,928 INFO L290 TraceCheckUtils]: 27: Hoare triple {25217#false} assume !(~y~0 % 4294967296 > 0); {25217#false} is VALID [2022-04-28 03:49:39,928 INFO L290 TraceCheckUtils]: 26: Hoare triple {25217#false} assume !(~z~0 % 4294967296 > 0); {25217#false} is VALID [2022-04-28 03:49:39,929 INFO L290 TraceCheckUtils]: 25: Hoare triple {25217#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {25217#false} is VALID [2022-04-28 03:49:39,929 INFO L290 TraceCheckUtils]: 24: Hoare triple {25217#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {25217#false} is VALID [2022-04-28 03:49:39,929 INFO L290 TraceCheckUtils]: 23: Hoare triple {25217#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {25217#false} is VALID [2022-04-28 03:49:39,929 INFO L290 TraceCheckUtils]: 22: Hoare triple {25217#false} assume !(~x~0 % 4294967296 > 0); {25217#false} is VALID [2022-04-28 03:49:39,929 INFO L290 TraceCheckUtils]: 21: Hoare triple {25217#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25217#false} is VALID [2022-04-28 03:49:39,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {25217#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25217#false} is VALID [2022-04-28 03:49:39,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {25217#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25217#false} is VALID [2022-04-28 03:49:39,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {25217#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25217#false} is VALID [2022-04-28 03:49:39,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {25228#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {25217#false} is VALID [2022-04-28 03:49:39,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {25227#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25228#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:49:39,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {25226#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25227#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:49:39,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {25225#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25226#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:49:39,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {25225#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {25225#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:49:39,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {25383#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25225#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:49:39,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {25387#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25383#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-28 03:49:39,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {25391#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25387#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-28 03:49:39,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {25395#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25391#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-28 03:49:39,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {25216#true} ~z~0 := ~y~0; {25395#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-28 03:49:39,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {25216#true} [159] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {25216#true} is VALID [2022-04-28 03:49:39,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {25216#true} [160] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_161| |v_main_#t~post6_160|)) (.cse2 (= v_main_~y~0_434 v_main_~y~0_433)) (.cse3 (= v_main_~x~0_391 v_main_~x~0_390)) (.cse4 (= |v_main_#t~post5_161| |v_main_#t~post5_160|)) (.cse0 (mod v_main_~x~0_391 4294967296))) (or (and (< 0 .cse0) (< v_main_~y~0_434 v_main_~y~0_433) (= (+ v_main_~x~0_391 v_main_~y~0_434 (* (- 1) v_main_~y~0_433)) v_main_~x~0_390) (forall ((v_it_32 Int)) (or (< 0 (mod (+ v_main_~x~0_391 (* 4294967295 v_it_32)) 4294967296)) (not (<= 1 v_it_32)) (not (<= (+ v_main_~y~0_434 v_it_32 1) v_main_~y~0_433))))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)))) InVars {main_~y~0=v_main_~y~0_434, main_#t~post5=|v_main_#t~post5_161|, main_~x~0=v_main_~x~0_391, main_#t~post6=|v_main_#t~post6_161|} OutVars{main_~y~0=v_main_~y~0_433, main_#t~post5=|v_main_#t~post5_160|, main_~x~0=v_main_~x~0_390, main_#t~post6=|v_main_#t~post6_160|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25216#true} is VALID [2022-04-28 03:49:39,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {25216#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25216#true} is VALID [2022-04-28 03:49:39,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {25216#true} call #t~ret17 := main(); {25216#true} is VALID [2022-04-28 03:49:39,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25216#true} {25216#true} #94#return; {25216#true} is VALID [2022-04-28 03:49:39,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {25216#true} assume true; {25216#true} is VALID [2022-04-28 03:49:39,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {25216#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25216#true} is VALID [2022-04-28 03:49:39,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {25216#true} call ULTIMATE.init(); {25216#true} is VALID [2022-04-28 03:49:39,940 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 03:49:39,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547087793] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:49:39,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:49:39,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 15 [2022-04-28 03:49:40,174 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:49:40,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1135161818] [2022-04-28 03:49:40,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1135161818] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:49:40,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:49:40,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 03:49:40,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102610768] [2022-04-28 03:49:40,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:49:40,175 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-28 03:49:40,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:49:40,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:40,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:49:40,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 03:49:40,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:49:40,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 03:49:40,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2022-04-28 03:49:40,205 INFO L87 Difference]: Start difference. First operand 167 states and 221 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:48,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:48,466 INFO L93 Difference]: Finished difference Result 248 states and 320 transitions. [2022-04-28 03:49:48,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-28 03:49:48,466 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-28 03:49:48,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:49:48,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:48,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 117 transitions. [2022-04-28 03:49:48,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:48,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 117 transitions. [2022-04-28 03:49:48,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 117 transitions. [2022-04-28 03:49:48,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:49:48,751 INFO L225 Difference]: With dead ends: 248 [2022-04-28 03:49:48,751 INFO L226 Difference]: Without dead ends: 204 [2022-04-28 03:49:48,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 73 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=521, Invalid=2341, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 03:49:48,753 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 73 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:49:48,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 76 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 03:49:48,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-04-28 03:49:49,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 139. [2022-04-28 03:49:49,950 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:49:49,950 INFO L82 GeneralOperation]: Start isEquivalent. First operand 204 states. Second operand has 139 states, 134 states have (on average 1.3432835820895523) internal successors, (180), 134 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:49,950 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand has 139 states, 134 states have (on average 1.3432835820895523) internal successors, (180), 134 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:49,950 INFO L87 Difference]: Start difference. First operand 204 states. Second operand has 139 states, 134 states have (on average 1.3432835820895523) internal successors, (180), 134 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:49,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:49,952 INFO L93 Difference]: Finished difference Result 204 states and 267 transitions. [2022-04-28 03:49:49,952 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 267 transitions. [2022-04-28 03:49:49,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:49:49,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:49:49,953 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 134 states have (on average 1.3432835820895523) internal successors, (180), 134 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 204 states. [2022-04-28 03:49:49,953 INFO L87 Difference]: Start difference. First operand has 139 states, 134 states have (on average 1.3432835820895523) internal successors, (180), 134 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 204 states. [2022-04-28 03:49:49,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:49,955 INFO L93 Difference]: Finished difference Result 204 states and 267 transitions. [2022-04-28 03:49:49,955 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 267 transitions. [2022-04-28 03:49:49,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:49:49,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:49:49,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:49:49,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:49:49,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.3432835820895523) internal successors, (180), 134 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:49,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 184 transitions. [2022-04-28 03:49:49,956 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 184 transitions. Word has length 34 [2022-04-28 03:49:49,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:49:49,956 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 184 transitions. [2022-04-28 03:49:49,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:49,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 139 states and 184 transitions. [2022-04-28 03:50:05,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 180 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:05,202 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 184 transitions. [2022-04-28 03:50:05,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 03:50:05,202 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:50:05,202 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:50:05,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-28 03:50:05,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:50:05,403 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:50:05,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:50:05,403 INFO L85 PathProgramCache]: Analyzing trace with hash -260516842, now seen corresponding path program 7 times [2022-04-28 03:50:05,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:05,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1377980121] [2022-04-28 03:50:05,682 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:50:05,683 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:50:05,685 INFO L85 PathProgramCache]: Analyzing trace with hash -752430185, now seen corresponding path program 1 times [2022-04-28 03:50:05,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:50:05,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446406659] [2022-04-28 03:50:05,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:05,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:50:05,693 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_33.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:50:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:05,716 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_33.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:50:06,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:50:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:06,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {26699#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26684#true} is VALID [2022-04-28 03:50:06,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {26684#true} assume true; {26684#true} is VALID [2022-04-28 03:50:06,181 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26684#true} {26684#true} #94#return; {26684#true} is VALID [2022-04-28 03:50:06,182 INFO L272 TraceCheckUtils]: 0: Hoare triple {26684#true} call ULTIMATE.init(); {26699#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:50:06,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {26699#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26684#true} is VALID [2022-04-28 03:50:06,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {26684#true} assume true; {26684#true} is VALID [2022-04-28 03:50:06,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26684#true} {26684#true} #94#return; {26684#true} is VALID [2022-04-28 03:50:06,182 INFO L272 TraceCheckUtils]: 4: Hoare triple {26684#true} call #t~ret17 := main(); {26684#true} is VALID [2022-04-28 03:50:06,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {26684#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26684#true} is VALID [2022-04-28 03:50:06,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {26684#true} [162] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_166| |v_main_#t~post5_165|)) (.cse1 (= v_main_~y~0_453 v_main_~y~0_452)) (.cse2 (= |v_main_#t~post6_166| |v_main_#t~post6_165|)) (.cse4 (= v_main_~x~0_411 v_main_~x~0_410)) (.cse3 (mod v_main_~x~0_411 4294967296))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and .cse0 .cse1 .cse2 .cse4) (and (forall ((v_it_33 Int)) (or (not (<= 1 v_it_33)) (< 0 (mod (+ v_main_~x~0_411 (* 4294967295 v_it_33)) 4294967296)) (not (<= (+ v_main_~y~0_453 v_it_33 1) v_main_~y~0_452)))) (< v_main_~y~0_453 v_main_~y~0_452) (< 0 .cse3) (= v_main_~x~0_410 (+ v_main_~x~0_411 v_main_~y~0_453 (* (- 1) v_main_~y~0_452)))))) InVars {main_~y~0=v_main_~y~0_453, main_#t~post5=|v_main_#t~post5_166|, main_~x~0=v_main_~x~0_411, main_#t~post6=|v_main_#t~post6_166|} OutVars{main_~y~0=v_main_~y~0_452, main_#t~post5=|v_main_#t~post5_165|, main_~x~0=v_main_~x~0_410, main_#t~post6=|v_main_#t~post6_165|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {26684#true} is VALID [2022-04-28 03:50:06,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {26684#true} [161] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {26684#true} is VALID [2022-04-28 03:50:06,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {26684#true} ~z~0 := ~y~0; {26689#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:50:06,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {26689#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26690#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:50:06,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {26690#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26691#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:50:06,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {26691#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26692#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:50:06,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {26692#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26693#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:50:06,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {26693#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {26694#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4)) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~y~0))} is VALID [2022-04-28 03:50:06,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {26694#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4)) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26695#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:50:06,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {26695#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26696#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:50:06,189 INFO L290 TraceCheckUtils]: 16: Hoare triple {26696#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26697#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:50:06,190 INFO L290 TraceCheckUtils]: 17: Hoare triple {26697#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26698#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:50:06,191 INFO L290 TraceCheckUtils]: 18: Hoare triple {26698#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26685#false} is VALID [2022-04-28 03:50:06,191 INFO L290 TraceCheckUtils]: 19: Hoare triple {26685#false} assume !(~y~0 % 4294967296 > 0); {26685#false} is VALID [2022-04-28 03:50:06,191 INFO L290 TraceCheckUtils]: 20: Hoare triple {26685#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26685#false} is VALID [2022-04-28 03:50:06,191 INFO L290 TraceCheckUtils]: 21: Hoare triple {26685#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26685#false} is VALID [2022-04-28 03:50:06,191 INFO L290 TraceCheckUtils]: 22: Hoare triple {26685#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26685#false} is VALID [2022-04-28 03:50:06,191 INFO L290 TraceCheckUtils]: 23: Hoare triple {26685#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26685#false} is VALID [2022-04-28 03:50:06,191 INFO L290 TraceCheckUtils]: 24: Hoare triple {26685#false} assume !(~x~0 % 4294967296 > 0); {26685#false} is VALID [2022-04-28 03:50:06,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {26685#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26685#false} is VALID [2022-04-28 03:50:06,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {26685#false} assume !(~z~0 % 4294967296 > 0); {26685#false} is VALID [2022-04-28 03:50:06,191 INFO L290 TraceCheckUtils]: 27: Hoare triple {26685#false} assume !(~y~0 % 4294967296 > 0); {26685#false} is VALID [2022-04-28 03:50:06,191 INFO L272 TraceCheckUtils]: 28: Hoare triple {26685#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {26685#false} is VALID [2022-04-28 03:50:06,192 INFO L290 TraceCheckUtils]: 29: Hoare triple {26685#false} ~cond := #in~cond; {26685#false} is VALID [2022-04-28 03:50:06,192 INFO L290 TraceCheckUtils]: 30: Hoare triple {26685#false} assume 0 == ~cond; {26685#false} is VALID [2022-04-28 03:50:06,192 INFO L290 TraceCheckUtils]: 31: Hoare triple {26685#false} assume !false; {26685#false} is VALID [2022-04-28 03:50:06,192 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 03:50:06,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:50:06,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446406659] [2022-04-28 03:50:06,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446406659] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:50:06,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272270662] [2022-04-28 03:50:06,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:06,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:50:06,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:50:06,193 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:50:06,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-28 03:50:06,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:06,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 03:50:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:06,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:50:07,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {26684#true} call ULTIMATE.init(); {26684#true} is VALID [2022-04-28 03:50:07,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {26684#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26684#true} is VALID [2022-04-28 03:50:07,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {26684#true} assume true; {26684#true} is VALID [2022-04-28 03:50:07,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26684#true} {26684#true} #94#return; {26684#true} is VALID [2022-04-28 03:50:07,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {26684#true} call #t~ret17 := main(); {26684#true} is VALID [2022-04-28 03:50:07,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {26684#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26684#true} is VALID [2022-04-28 03:50:07,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {26684#true} [162] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_166| |v_main_#t~post5_165|)) (.cse1 (= v_main_~y~0_453 v_main_~y~0_452)) (.cse2 (= |v_main_#t~post6_166| |v_main_#t~post6_165|)) (.cse4 (= v_main_~x~0_411 v_main_~x~0_410)) (.cse3 (mod v_main_~x~0_411 4294967296))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and .cse0 .cse1 .cse2 .cse4) (and (forall ((v_it_33 Int)) (or (not (<= 1 v_it_33)) (< 0 (mod (+ v_main_~x~0_411 (* 4294967295 v_it_33)) 4294967296)) (not (<= (+ v_main_~y~0_453 v_it_33 1) v_main_~y~0_452)))) (< v_main_~y~0_453 v_main_~y~0_452) (< 0 .cse3) (= v_main_~x~0_410 (+ v_main_~x~0_411 v_main_~y~0_453 (* (- 1) v_main_~y~0_452)))))) InVars {main_~y~0=v_main_~y~0_453, main_#t~post5=|v_main_#t~post5_166|, main_~x~0=v_main_~x~0_411, main_#t~post6=|v_main_#t~post6_166|} OutVars{main_~y~0=v_main_~y~0_452, main_#t~post5=|v_main_#t~post5_165|, main_~x~0=v_main_~x~0_410, main_#t~post6=|v_main_#t~post6_165|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {26684#true} is VALID [2022-04-28 03:50:07,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {26684#true} [161] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {26684#true} is VALID [2022-04-28 03:50:07,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {26684#true} ~z~0 := ~y~0; {26689#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:50:07,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {26689#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26690#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:50:07,733 INFO L290 TraceCheckUtils]: 10: Hoare triple {26690#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26691#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:50:07,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {26691#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26692#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:50:07,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {26692#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26693#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:50:07,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {26693#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {26693#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:50:07,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {26693#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26745#(< (div (+ 4294967292 (* (- 1) main_~z~0)) (- 4294967296)) (+ (div (+ main_~z~0 2) 4294967296) 1))} is VALID [2022-04-28 03:50:07,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {26745#(< (div (+ 4294967292 (* (- 1) main_~z~0)) (- 4294967296)) (+ (div (+ main_~z~0 2) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26749#(< (div (+ (* (- 1) main_~z~0) 4294967293) (- 4294967296)) (+ (div (+ main_~z~0 1) 4294967296) 1))} is VALID [2022-04-28 03:50:07,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {26749#(< (div (+ (* (- 1) main_~z~0) 4294967293) (- 4294967296)) (+ (div (+ main_~z~0 1) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26753#(< (div (+ (* (- 1) main_~z~0) 4294967294) (- 4294967296)) (+ (div main_~z~0 4294967296) 1))} is VALID [2022-04-28 03:50:07,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {26753#(< (div (+ (* (- 1) main_~z~0) 4294967294) (- 4294967296)) (+ (div main_~z~0 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26757#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:50:07,742 INFO L290 TraceCheckUtils]: 18: Hoare triple {26757#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26761#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:50:07,742 INFO L290 TraceCheckUtils]: 19: Hoare triple {26761#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {26761#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:50:07,743 INFO L290 TraceCheckUtils]: 20: Hoare triple {26761#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26761#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:50:07,743 INFO L290 TraceCheckUtils]: 21: Hoare triple {26761#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26761#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:50:07,743 INFO L290 TraceCheckUtils]: 22: Hoare triple {26761#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26761#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:50:07,743 INFO L290 TraceCheckUtils]: 23: Hoare triple {26761#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26761#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:50:07,744 INFO L290 TraceCheckUtils]: 24: Hoare triple {26761#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} assume !(~x~0 % 4294967296 > 0); {26761#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:50:07,745 INFO L290 TraceCheckUtils]: 25: Hoare triple {26761#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26757#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:50:07,746 INFO L290 TraceCheckUtils]: 26: Hoare triple {26757#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {26685#false} is VALID [2022-04-28 03:50:07,746 INFO L290 TraceCheckUtils]: 27: Hoare triple {26685#false} assume !(~y~0 % 4294967296 > 0); {26685#false} is VALID [2022-04-28 03:50:07,746 INFO L272 TraceCheckUtils]: 28: Hoare triple {26685#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {26685#false} is VALID [2022-04-28 03:50:07,746 INFO L290 TraceCheckUtils]: 29: Hoare triple {26685#false} ~cond := #in~cond; {26685#false} is VALID [2022-04-28 03:50:07,746 INFO L290 TraceCheckUtils]: 30: Hoare triple {26685#false} assume 0 == ~cond; {26685#false} is VALID [2022-04-28 03:50:07,746 INFO L290 TraceCheckUtils]: 31: Hoare triple {26685#false} assume !false; {26685#false} is VALID [2022-04-28 03:50:07,746 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:50:07,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:50:08,965 INFO L290 TraceCheckUtils]: 31: Hoare triple {26685#false} assume !false; {26685#false} is VALID [2022-04-28 03:50:08,965 INFO L290 TraceCheckUtils]: 30: Hoare triple {26685#false} assume 0 == ~cond; {26685#false} is VALID [2022-04-28 03:50:08,966 INFO L290 TraceCheckUtils]: 29: Hoare triple {26685#false} ~cond := #in~cond; {26685#false} is VALID [2022-04-28 03:50:08,966 INFO L272 TraceCheckUtils]: 28: Hoare triple {26685#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {26685#false} is VALID [2022-04-28 03:50:08,966 INFO L290 TraceCheckUtils]: 27: Hoare triple {26685#false} assume !(~y~0 % 4294967296 > 0); {26685#false} is VALID [2022-04-28 03:50:08,967 INFO L290 TraceCheckUtils]: 26: Hoare triple {26757#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {26685#false} is VALID [2022-04-28 03:50:08,968 INFO L290 TraceCheckUtils]: 25: Hoare triple {26761#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26757#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:50:08,968 INFO L290 TraceCheckUtils]: 24: Hoare triple {26761#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} assume !(~x~0 % 4294967296 > 0); {26761#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:50:08,969 INFO L290 TraceCheckUtils]: 23: Hoare triple {26761#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26761#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:50:08,969 INFO L290 TraceCheckUtils]: 22: Hoare triple {26761#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26761#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:50:08,969 INFO L290 TraceCheckUtils]: 21: Hoare triple {26761#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26761#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:50:08,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {26761#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26761#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:50:08,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {26761#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {26761#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:50:08,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {26757#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26761#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:50:08,973 INFO L290 TraceCheckUtils]: 17: Hoare triple {26753#(< (div (+ (* (- 1) main_~z~0) 4294967294) (- 4294967296)) (+ (div main_~z~0 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26757#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:50:08,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {26749#(< (div (+ (* (- 1) main_~z~0) 4294967293) (- 4294967296)) (+ (div (+ main_~z~0 1) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26753#(< (div (+ (* (- 1) main_~z~0) 4294967294) (- 4294967296)) (+ (div main_~z~0 4294967296) 1))} is VALID [2022-04-28 03:50:08,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {26745#(< (div (+ 4294967292 (* (- 1) main_~z~0)) (- 4294967296)) (+ (div (+ main_~z~0 2) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26749#(< (div (+ (* (- 1) main_~z~0) 4294967293) (- 4294967296)) (+ (div (+ main_~z~0 1) 4294967296) 1))} is VALID [2022-04-28 03:50:08,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {26852#(or (not (< 0 (mod main_~y~0 4294967296))) (< (div (+ 4294967291 (* (- 1) main_~z~0)) (- 4294967296)) (+ (div (+ main_~z~0 3) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26745#(< (div (+ 4294967292 (* (- 1) main_~z~0)) (- 4294967296)) (+ (div (+ main_~z~0 2) 4294967296) 1))} is VALID [2022-04-28 03:50:08,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {26852#(or (not (< 0 (mod main_~y~0 4294967296))) (< (div (+ 4294967291 (* (- 1) main_~z~0)) (- 4294967296)) (+ (div (+ main_~z~0 3) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {26852#(or (not (< 0 (mod main_~y~0 4294967296))) (< (div (+ 4294967291 (* (- 1) main_~z~0)) (- 4294967296)) (+ (div (+ main_~z~0 3) 4294967296) 1)))} is VALID [2022-04-28 03:50:08,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {26859#(or (not (< 0 (mod main_~y~0 4294967296))) (< (div (+ 4294967292 (* (- 1) main_~z~0)) (- 4294967296)) (+ (div (+ main_~z~0 2) 4294967296) 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26852#(or (not (< 0 (mod main_~y~0 4294967296))) (< (div (+ 4294967291 (* (- 1) main_~z~0)) (- 4294967296)) (+ (div (+ main_~z~0 3) 4294967296) 1)))} is VALID [2022-04-28 03:50:08,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {26863#(or (not (< 0 (mod main_~y~0 4294967296))) (< (div (+ (* (- 1) main_~z~0) 4294967293) (- 4294967296)) (+ (div (+ main_~z~0 1) 4294967296) 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26859#(or (not (< 0 (mod main_~y~0 4294967296))) (< (div (+ 4294967292 (* (- 1) main_~z~0)) (- 4294967296)) (+ (div (+ main_~z~0 2) 4294967296) 1)))} is VALID [2022-04-28 03:50:08,982 INFO L290 TraceCheckUtils]: 10: Hoare triple {26867#(or (< (div (+ (* (- 1) main_~z~0) 4294967294) (- 4294967296)) (+ (div main_~z~0 4294967296) 1)) (not (< 0 (mod main_~y~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26863#(or (not (< 0 (mod main_~y~0 4294967296))) (< (div (+ (* (- 1) main_~z~0) 4294967293) (- 4294967296)) (+ (div (+ main_~z~0 1) 4294967296) 1)))} is VALID [2022-04-28 03:50:08,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {26871#(or (not (< 0 (mod main_~y~0 4294967296))) (< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26867#(or (< (div (+ (* (- 1) main_~z~0) 4294967294) (- 4294967296)) (+ (div main_~z~0 4294967296) 1)) (not (< 0 (mod main_~y~0 4294967296))))} is VALID [2022-04-28 03:50:08,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {26684#true} ~z~0 := ~y~0; {26871#(or (not (< 0 (mod main_~y~0 4294967296))) (< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1)))} is VALID [2022-04-28 03:50:08,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {26684#true} [161] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {26684#true} is VALID [2022-04-28 03:50:08,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {26684#true} [162] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_166| |v_main_#t~post5_165|)) (.cse1 (= v_main_~y~0_453 v_main_~y~0_452)) (.cse2 (= |v_main_#t~post6_166| |v_main_#t~post6_165|)) (.cse4 (= v_main_~x~0_411 v_main_~x~0_410)) (.cse3 (mod v_main_~x~0_411 4294967296))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and .cse0 .cse1 .cse2 .cse4) (and (forall ((v_it_33 Int)) (or (not (<= 1 v_it_33)) (< 0 (mod (+ v_main_~x~0_411 (* 4294967295 v_it_33)) 4294967296)) (not (<= (+ v_main_~y~0_453 v_it_33 1) v_main_~y~0_452)))) (< v_main_~y~0_453 v_main_~y~0_452) (< 0 .cse3) (= v_main_~x~0_410 (+ v_main_~x~0_411 v_main_~y~0_453 (* (- 1) v_main_~y~0_452)))))) InVars {main_~y~0=v_main_~y~0_453, main_#t~post5=|v_main_#t~post5_166|, main_~x~0=v_main_~x~0_411, main_#t~post6=|v_main_#t~post6_166|} OutVars{main_~y~0=v_main_~y~0_452, main_#t~post5=|v_main_#t~post5_165|, main_~x~0=v_main_~x~0_410, main_#t~post6=|v_main_#t~post6_165|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {26684#true} is VALID [2022-04-28 03:50:08,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {26684#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26684#true} is VALID [2022-04-28 03:50:08,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {26684#true} call #t~ret17 := main(); {26684#true} is VALID [2022-04-28 03:50:08,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26684#true} {26684#true} #94#return; {26684#true} is VALID [2022-04-28 03:50:08,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {26684#true} assume true; {26684#true} is VALID [2022-04-28 03:50:08,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {26684#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26684#true} is VALID [2022-04-28 03:50:08,985 INFO L272 TraceCheckUtils]: 0: Hoare triple {26684#true} call ULTIMATE.init(); {26684#true} is VALID [2022-04-28 03:50:08,985 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:50:08,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272270662] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:50:08,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:50:08,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 23 [2022-04-28 03:50:09,366 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:50:09,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1377980121] [2022-04-28 03:50:09,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1377980121] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:50:09,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:50:09,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 03:50:09,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728700196] [2022-04-28 03:50:09,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:50:09,367 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-28 03:50:09,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:50:09,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:09,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:09,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 03:50:09,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:09,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 03:50:09,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2022-04-28 03:50:09,399 INFO L87 Difference]: Start difference. First operand 139 states and 184 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:18,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:18,951 INFO L93 Difference]: Finished difference Result 306 states and 415 transitions. [2022-04-28 03:50:18,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 03:50:18,951 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-28 03:50:18,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:50:18,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:18,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 138 transitions. [2022-04-28 03:50:18,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:18,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 138 transitions. [2022-04-28 03:50:18,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 138 transitions. [2022-04-28 03:50:19,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:19,164 INFO L225 Difference]: With dead ends: 306 [2022-04-28 03:50:19,164 INFO L226 Difference]: Without dead ends: 194 [2022-04-28 03:50:19,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=421, Invalid=2885, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 03:50:19,165 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 93 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:50:19,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 84 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 03:50:19,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-04-28 03:50:20,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 140. [2022-04-28 03:50:20,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:50:20,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand has 140 states, 135 states have (on average 1.3185185185185184) internal successors, (178), 135 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:20,477 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand has 140 states, 135 states have (on average 1.3185185185185184) internal successors, (178), 135 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:20,477 INFO L87 Difference]: Start difference. First operand 194 states. Second operand has 140 states, 135 states have (on average 1.3185185185185184) internal successors, (178), 135 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:20,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:20,479 INFO L93 Difference]: Finished difference Result 194 states and 254 transitions. [2022-04-28 03:50:20,479 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 254 transitions. [2022-04-28 03:50:20,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:20,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:20,479 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 135 states have (on average 1.3185185185185184) internal successors, (178), 135 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 194 states. [2022-04-28 03:50:20,479 INFO L87 Difference]: Start difference. First operand has 140 states, 135 states have (on average 1.3185185185185184) internal successors, (178), 135 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 194 states. [2022-04-28 03:50:20,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:20,481 INFO L93 Difference]: Finished difference Result 194 states and 254 transitions. [2022-04-28 03:50:20,481 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 254 transitions. [2022-04-28 03:50:20,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:20,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:20,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:50:20,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:50:20,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 135 states have (on average 1.3185185185185184) internal successors, (178), 135 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:20,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 182 transitions. [2022-04-28 03:50:20,484 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 182 transitions. Word has length 34 [2022-04-28 03:50:20,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:50:20,484 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 182 transitions. [2022-04-28 03:50:20,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:20,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 182 transitions. [2022-04-28 03:50:41,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 177 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:41,272 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 182 transitions. [2022-04-28 03:50:41,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 03:50:41,272 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:50:41,273 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:50:41,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-28 03:50:41,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:50:41,473 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:50:41,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:50:41,474 INFO L85 PathProgramCache]: Analyzing trace with hash 289270042, now seen corresponding path program 10 times [2022-04-28 03:50:41,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:41,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [625475172] [2022-04-28 03:50:41,804 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:50:41,806 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:50:41,807 INFO L85 PathProgramCache]: Analyzing trace with hash -89874055, now seen corresponding path program 1 times [2022-04-28 03:50:41,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:50:41,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708869174] [2022-04-28 03:50:41,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:41,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:50:41,817 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_34.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:50:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:41,837 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_34.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:50:42,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:50:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:42,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {28267#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28251#true} is VALID [2022-04-28 03:50:42,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {28251#true} assume true; {28251#true} is VALID [2022-04-28 03:50:42,495 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28251#true} {28251#true} #94#return; {28251#true} is VALID [2022-04-28 03:50:42,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {28251#true} call ULTIMATE.init(); {28267#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:50:42,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {28267#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28251#true} is VALID [2022-04-28 03:50:42,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {28251#true} assume true; {28251#true} is VALID [2022-04-28 03:50:42,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28251#true} {28251#true} #94#return; {28251#true} is VALID [2022-04-28 03:50:42,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {28251#true} call #t~ret17 := main(); {28251#true} is VALID [2022-04-28 03:50:42,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {28251#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28256#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:50:42,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {28256#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [164] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_171| |v_main_#t~post6_170|)) (.cse2 (= |v_main_#t~post5_171| |v_main_#t~post5_170|)) (.cse3 (= v_main_~y~0_472 v_main_~y~0_471)) (.cse4 (= v_main_~x~0_429 v_main_~x~0_428)) (.cse1 (mod v_main_~x~0_429 4294967296))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (= v_main_~x~0_428 (+ v_main_~x~0_429 v_main_~y~0_472 (* (- 1) v_main_~y~0_471))) (< v_main_~y~0_472 v_main_~y~0_471) (< 0 .cse1) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ v_main_~x~0_429 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_main_~y~0_472 v_it_34 1) v_main_~y~0_471))))))) InVars {main_~y~0=v_main_~y~0_472, main_#t~post5=|v_main_#t~post5_171|, main_~x~0=v_main_~x~0_429, main_#t~post6=|v_main_#t~post6_171|} OutVars{main_~y~0=v_main_~y~0_471, main_#t~post5=|v_main_#t~post5_170|, main_~x~0=v_main_~x~0_428, main_#t~post6=|v_main_#t~post6_170|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {28257#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:50:42,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {28257#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} [163] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {28258#(or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-28 03:50:42,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {28258#(or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} ~z~0 := ~y~0; {28259#(and (= main_~z~0 main_~y~0) (or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))))))} is VALID [2022-04-28 03:50:42,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {28259#(and (= main_~z~0 main_~y~0) (or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28260#(and (= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-28 03:50:42,502 INFO L290 TraceCheckUtils]: 10: Hoare triple {28260#(and (= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28261#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:50:42,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {28261#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28262#(<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296))))} is VALID [2022-04-28 03:50:42,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {28262#(<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {28262#(<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296))))} is VALID [2022-04-28 03:50:42,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {28262#(<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28261#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:50:42,506 INFO L290 TraceCheckUtils]: 14: Hoare triple {28261#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28263#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:50:42,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {28263#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28264#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:50:42,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {28264#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {28264#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:50:42,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {28264#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28264#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:50:42,508 INFO L290 TraceCheckUtils]: 18: Hoare triple {28264#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28264#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:50:42,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {28264#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28264#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:50:42,509 INFO L290 TraceCheckUtils]: 20: Hoare triple {28264#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {28264#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:50:42,510 INFO L290 TraceCheckUtils]: 21: Hoare triple {28264#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28263#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:50:42,511 INFO L290 TraceCheckUtils]: 22: Hoare triple {28263#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28261#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:50:42,512 INFO L290 TraceCheckUtils]: 23: Hoare triple {28261#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28262#(<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296))))} is VALID [2022-04-28 03:50:42,512 INFO L290 TraceCheckUtils]: 24: Hoare triple {28262#(<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {28262#(<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296))))} is VALID [2022-04-28 03:50:42,514 INFO L290 TraceCheckUtils]: 25: Hoare triple {28262#(<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {28261#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:50:42,515 INFO L290 TraceCheckUtils]: 26: Hoare triple {28261#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {28263#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:50:42,516 INFO L290 TraceCheckUtils]: 27: Hoare triple {28263#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {28264#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:50:42,516 INFO L290 TraceCheckUtils]: 28: Hoare triple {28264#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {28264#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:50:42,518 INFO L272 TraceCheckUtils]: 29: Hoare triple {28264#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {28265#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:50:42,518 INFO L290 TraceCheckUtils]: 30: Hoare triple {28265#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {28266#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:50:42,519 INFO L290 TraceCheckUtils]: 31: Hoare triple {28266#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {28252#false} is VALID [2022-04-28 03:50:42,519 INFO L290 TraceCheckUtils]: 32: Hoare triple {28252#false} assume !false; {28252#false} is VALID [2022-04-28 03:50:42,519 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:50:42,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:50:42,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708869174] [2022-04-28 03:50:42,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708869174] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:50:42,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622655405] [2022-04-28 03:50:42,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:42,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:50:42,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:50:42,520 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:50:42,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-28 03:50:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:42,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 03:50:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:42,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:51:22,447 WARN L232 SmtUtils]: Spent 7.12s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 03:53:29,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {28251#true} call ULTIMATE.init(); {28251#true} is VALID [2022-04-28 03:53:29,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {28251#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28251#true} is VALID [2022-04-28 03:53:29,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {28251#true} assume true; {28251#true} is VALID [2022-04-28 03:53:29,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28251#true} {28251#true} #94#return; {28251#true} is VALID [2022-04-28 03:53:29,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {28251#true} call #t~ret17 := main(); {28251#true} is VALID [2022-04-28 03:53:29,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {28251#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28256#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:53:29,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {28256#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [164] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_171| |v_main_#t~post6_170|)) (.cse2 (= |v_main_#t~post5_171| |v_main_#t~post5_170|)) (.cse3 (= v_main_~y~0_472 v_main_~y~0_471)) (.cse4 (= v_main_~x~0_429 v_main_~x~0_428)) (.cse1 (mod v_main_~x~0_429 4294967296))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (= v_main_~x~0_428 (+ v_main_~x~0_429 v_main_~y~0_472 (* (- 1) v_main_~y~0_471))) (< v_main_~y~0_472 v_main_~y~0_471) (< 0 .cse1) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ v_main_~x~0_429 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_main_~y~0_472 v_it_34 1) v_main_~y~0_471))))))) InVars {main_~y~0=v_main_~y~0_472, main_#t~post5=|v_main_#t~post5_171|, main_~x~0=v_main_~x~0_429, main_#t~post6=|v_main_#t~post6_171|} OutVars{main_~y~0=v_main_~y~0_471, main_#t~post5=|v_main_#t~post5_170|, main_~x~0=v_main_~x~0_428, main_#t~post6=|v_main_#t~post6_170|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {28289#(or (and (= main_~n~0 main_~x~0) (= main_~y~0 0)) (and (= main_~x~0 (+ main_~n~0 (* (- 1) main_~y~0))) (< 0 (mod main_~n~0 4294967296)) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_it_34 1) main_~y~0)))) (< 0 main_~y~0)))} is VALID [2022-04-28 03:53:29,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {28289#(or (and (= main_~n~0 main_~x~0) (= main_~y~0 0)) (and (= main_~x~0 (+ main_~n~0 (* (- 1) main_~y~0))) (< 0 (mod main_~n~0 4294967296)) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_it_34 1) main_~y~0)))) (< 0 main_~y~0)))} [163] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {28293#(or (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 (mod main_~n~0 4294967296)) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_it_34 1) main_~y~0)))) (< 0 main_~y~0)) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0)))} is VALID [2022-04-28 03:53:29,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {28293#(or (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 (mod main_~n~0 4294967296)) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_it_34 1) main_~y~0)))) (< 0 main_~y~0)) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0)))} ~z~0 := ~y~0; {28297#(and (= main_~z~0 main_~y~0) (or (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 (mod main_~n~0 4294967296)) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_it_34 1) main_~y~0)))) (< 0 main_~y~0)) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0))))} is VALID [2022-04-28 03:53:29,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {28297#(and (= main_~z~0 main_~y~0) (or (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 (mod main_~n~0 4294967296)) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_it_34 1) main_~y~0)))) (< 0 main_~y~0)) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28301#(and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_it_34 1) main_~y~0)))) (< 0 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:53:29,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {28301#(and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_it_34 1) main_~y~0)))) (< 0 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28305#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 2)) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_it_34 1) main_~y~0)))) (< 0 main_~y~0) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:53:29,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {28305#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 2)) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_it_34 1) main_~y~0)))) (< 0 main_~y~0) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28309#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_it_34 1) main_~y~0)))) (< 0 main_~y~0) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:53:29,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {28309#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_it_34 1) main_~y~0)))) (< 0 main_~y~0) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {28313#(and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_it_34 1) main_~y~0)))) (< 0 main_~y~0) (= main_~y~0 (+ main_~z~0 3)) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-28 03:53:29,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {28313#(and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_it_34 1) main_~y~0)))) (< 0 main_~y~0) (= main_~y~0 (+ main_~z~0 3)) (<= (mod main_~z~0 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28317#(and (<= (div (+ main_~y~0 (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (= main_~z~0 (+ (- 1) main_~y~0)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)) (not (<= v_it_34 main_~y~0)))) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:53:29,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {28317#(and (<= (div (+ main_~y~0 (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (= main_~z~0 (+ (- 1) main_~y~0)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)) (not (<= v_it_34 main_~y~0)))) (< 0 (+ main_~y~0 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28321#(and (< 0 (+ main_~y~0 2)) (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (= main_~z~0 (+ main_~y~0 1)) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)) (not (<= v_it_34 (+ main_~y~0 1))))) (<= (div (+ main_~y~0 2 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 2) main_~n~0 (* (- 1) main_~y~0)) 4294967296)))} is VALID [2022-04-28 03:53:29,655 INFO L290 TraceCheckUtils]: 15: Hoare triple {28321#(and (< 0 (+ main_~y~0 2)) (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (= main_~z~0 (+ main_~y~0 1)) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)) (not (<= v_it_34 (+ main_~y~0 1))))) (<= (div (+ main_~y~0 2 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 2) main_~n~0 (* (- 1) main_~y~0)) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28325#(and (<= (mod main_~y~0 4294967296) 0) (< 0 (+ main_~y~0 3)) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)) (not (<= v_it_34 (+ main_~y~0 2))))) (= main_~z~0 (+ main_~y~0 3)) (<= (div (+ main_~y~0 3 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (- 3) (* (- 1) main_~y~0)) 4294967296)))} is VALID [2022-04-28 03:53:29,673 INFO L290 TraceCheckUtils]: 16: Hoare triple {28325#(and (<= (mod main_~y~0 4294967296) 0) (< 0 (+ main_~y~0 3)) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)) (not (<= v_it_34 (+ main_~y~0 2))))) (= main_~z~0 (+ main_~y~0 3)) (<= (div (+ main_~y~0 3 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (- 3) (* (- 1) main_~y~0)) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {28329#(and (< 0 main_~z~0) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_it_34 1) main_~z~0)))) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} is VALID [2022-04-28 03:53:29,676 INFO L290 TraceCheckUtils]: 17: Hoare triple {28329#(and (< 0 main_~z~0) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_it_34 1) main_~z~0)))) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28329#(and (< 0 main_~z~0) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_it_34 1) main_~z~0)))) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} is VALID [2022-04-28 03:53:29,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {28329#(and (< 0 main_~z~0) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_it_34 1) main_~z~0)))) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28329#(and (< 0 main_~z~0) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_it_34 1) main_~z~0)))) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} is VALID [2022-04-28 03:53:29,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {28329#(and (< 0 main_~z~0) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_it_34 1) main_~z~0)))) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28329#(and (< 0 main_~z~0) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_it_34 1) main_~z~0)))) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} is VALID [2022-04-28 03:53:29,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {28329#(and (< 0 main_~z~0) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_it_34 1) main_~z~0)))) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {28329#(and (< 0 main_~z~0) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_it_34 1) main_~z~0)))) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} is VALID [2022-04-28 03:53:29,703 INFO L290 TraceCheckUtils]: 21: Hoare triple {28329#(and (< 0 main_~z~0) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_it_34 1) main_~z~0)))) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28345#(and (< 0 (+ main_~z~0 1)) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (not (<= v_it_34 main_~z~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)))) (<= (div (+ main_~z~0 (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} is VALID [2022-04-28 03:53:29,743 INFO L290 TraceCheckUtils]: 22: Hoare triple {28345#(and (< 0 (+ main_~z~0 1)) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (not (<= v_it_34 main_~z~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)))) (<= (div (+ main_~z~0 (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28349#(and (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (< 0 (+ main_~z~0 2)) (<= (div (+ main_~z~0 2 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296)) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (not (<= v_it_34 (+ main_~z~0 1))) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)))))} is VALID [2022-04-28 03:53:29,865 INFO L290 TraceCheckUtils]: 23: Hoare triple {28349#(and (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (< 0 (+ main_~z~0 2)) (<= (div (+ main_~z~0 2 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296)) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (not (<= v_it_34 (+ main_~z~0 1))) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28353#(and (< 0 (+ main_~z~0 3)) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (not (<= v_it_34 (+ main_~z~0 2))) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)))) (<= (div (+ main_~z~0 3 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296)) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-28 03:53:29,867 INFO L290 TraceCheckUtils]: 24: Hoare triple {28353#(and (< 0 (+ main_~z~0 3)) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (not (<= v_it_34 (+ main_~z~0 2))) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)))) (<= (div (+ main_~z~0 3 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296)) (<= (mod main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {28353#(and (< 0 (+ main_~z~0 3)) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (not (<= v_it_34 (+ main_~z~0 2))) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)))) (<= (div (+ main_~z~0 3 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296)) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-28 03:53:29,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {28353#(and (< 0 (+ main_~z~0 3)) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (not (<= v_it_34 (+ main_~z~0 2))) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)))) (<= (div (+ main_~z~0 3 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296)) (<= (mod main_~z~0 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {28349#(and (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (< 0 (+ main_~z~0 2)) (<= (div (+ main_~z~0 2 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296)) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (not (<= v_it_34 (+ main_~z~0 1))) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)))))} is VALID [2022-04-28 03:53:29,958 INFO L290 TraceCheckUtils]: 26: Hoare triple {28349#(and (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (< 0 (+ main_~z~0 2)) (<= (div (+ main_~z~0 2 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296)) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (not (<= v_it_34 (+ main_~z~0 1))) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)))))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {28345#(and (< 0 (+ main_~z~0 1)) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (not (<= v_it_34 main_~z~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)))) (<= (div (+ main_~z~0 (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} is VALID [2022-04-28 03:53:29,983 INFO L290 TraceCheckUtils]: 27: Hoare triple {28345#(and (< 0 (+ main_~z~0 1)) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (not (<= v_it_34 main_~z~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)))) (<= (div (+ main_~z~0 (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {28329#(and (< 0 main_~z~0) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_it_34 1) main_~z~0)))) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} is VALID [2022-04-28 03:53:29,985 INFO L290 TraceCheckUtils]: 28: Hoare triple {28329#(and (< 0 main_~z~0) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_it_34 1) main_~z~0)))) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {28329#(and (< 0 main_~z~0) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_it_34 1) main_~z~0)))) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} is VALID [2022-04-28 03:53:30,004 INFO L272 TraceCheckUtils]: 29: Hoare triple {28329#(and (< 0 main_~z~0) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_it_34 1) main_~z~0)))) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {28372#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:53:30,005 INFO L290 TraceCheckUtils]: 30: Hoare triple {28372#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28376#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:53:30,005 INFO L290 TraceCheckUtils]: 31: Hoare triple {28376#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {28252#false} is VALID [2022-04-28 03:53:30,005 INFO L290 TraceCheckUtils]: 32: Hoare triple {28252#false} assume !false; {28252#false} is VALID [2022-04-28 03:53:30,005 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 23 refuted. 1 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:53:30,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:54:39,359 INFO L290 TraceCheckUtils]: 32: Hoare triple {28252#false} assume !false; {28252#false} is VALID [2022-04-28 03:54:39,359 INFO L290 TraceCheckUtils]: 31: Hoare triple {28376#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {28252#false} is VALID [2022-04-28 03:54:39,360 INFO L290 TraceCheckUtils]: 30: Hoare triple {28372#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28376#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:54:39,361 INFO L272 TraceCheckUtils]: 29: Hoare triple {28264#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {28372#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:54:39,362 INFO L290 TraceCheckUtils]: 28: Hoare triple {28264#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {28264#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:39,363 INFO L290 TraceCheckUtils]: 27: Hoare triple {28263#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {28264#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:39,364 INFO L290 TraceCheckUtils]: 26: Hoare triple {28261#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {28263#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:54:39,365 INFO L290 TraceCheckUtils]: 25: Hoare triple {28262#(<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {28261#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:39,366 INFO L290 TraceCheckUtils]: 24: Hoare triple {28262#(<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {28262#(<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296))))} is VALID [2022-04-28 03:54:39,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {28261#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28262#(<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296))))} is VALID [2022-04-28 03:54:39,368 INFO L290 TraceCheckUtils]: 22: Hoare triple {28263#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28261#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:39,369 INFO L290 TraceCheckUtils]: 21: Hoare triple {28264#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28263#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:54:39,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {28264#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {28264#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:39,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {28264#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28264#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:39,370 INFO L290 TraceCheckUtils]: 18: Hoare triple {28264#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28264#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:39,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {28264#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28264#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:39,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {28431#(or (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {28264#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:39,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {28435#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28431#(or (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:54:39,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {28439#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28435#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:54:39,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {28443#(or (<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296)))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28439#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:54:39,377 INFO L290 TraceCheckUtils]: 12: Hoare triple {28447#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296)))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {28443#(or (<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296)))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:54:39,379 INFO L290 TraceCheckUtils]: 11: Hoare triple {28451#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)) (<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28447#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296)))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:54:39,381 INFO L290 TraceCheckUtils]: 10: Hoare triple {28455#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)) (<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28451#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)) (<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:54:39,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {28459#(or (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28455#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)) (<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:54:39,384 INFO L290 TraceCheckUtils]: 8: Hoare triple {28463#(or (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} ~z~0 := ~y~0; {28459#(or (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:54:39,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {28467#(or (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} [163] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {28463#(or (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:54:41,401 WARN L290 TraceCheckUtils]: 6: Hoare triple {28471#(forall ((aux_div_aux_mod_v_main_~y~0_489_47_124 Int) (aux_div_v_main_~y~0_489_47 Int) (aux_mod_aux_mod_v_main_~y~0_489_47_124 Int)) (or (and (or (not (= main_~n~0 (+ aux_mod_aux_mod_v_main_~y~0_489_47_124 main_~y~0 (* 4294967296 aux_div_aux_mod_v_main_~y~0_489_47_124)))) (< 0 (mod main_~x~0 4294967296))) (or (forall ((aux_div_v_main_~x~0_443_32 Int)) (or (< (+ aux_mod_aux_mod_v_main_~y~0_489_47_124 main_~y~0 main_~x~0 (* 4294967296 aux_div_aux_mod_v_main_~y~0_489_47_124)) (+ main_~n~0 (* 4294967296 aux_div_v_main_~x~0_443_32))) (< (+ main_~n~0 (* 4294967296 aux_div_v_main_~x~0_443_32)) (+ aux_mod_aux_mod_v_main_~y~0_489_47_124 main_~y~0 main_~x~0 (* 4294967296 aux_div_aux_mod_v_main_~y~0_489_47_124))))) (exists ((v_it_34 Int)) (and (not (< 0 (mod (+ main_~x~0 (* 4294967295 v_it_34)) 4294967296))) (<= (+ aux_mod_aux_mod_v_main_~y~0_489_47_124 main_~y~0 v_it_34 (* 4294967296 aux_div_aux_mod_v_main_~y~0_489_47_124) 1) main_~n~0) (<= 1 v_it_34))) (not (< (+ aux_mod_aux_mod_v_main_~y~0_489_47_124 main_~y~0 (* 4294967296 aux_div_aux_mod_v_main_~y~0_489_47_124)) main_~n~0)) (not (< 0 (mod main_~x~0 4294967296))))) (<= aux_mod_aux_mod_v_main_~y~0_489_47_124 0) (< (+ main_~n~0 4294967293) (+ (* 4294967296 aux_div_v_main_~y~0_489_47) aux_mod_aux_mod_v_main_~y~0_489_47_124 (* 4294967296 aux_div_aux_mod_v_main_~y~0_489_47_124))) (<= 4294967296 aux_mod_aux_mod_v_main_~y~0_489_47_124) (< (+ (* 4294967296 aux_div_v_main_~y~0_489_47) aux_mod_aux_mod_v_main_~y~0_489_47_124 (* 4294967296 aux_div_aux_mod_v_main_~y~0_489_47_124)) (+ main_~n~0 4294967293))))} [164] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_171| |v_main_#t~post6_170|)) (.cse2 (= |v_main_#t~post5_171| |v_main_#t~post5_170|)) (.cse3 (= v_main_~y~0_472 v_main_~y~0_471)) (.cse4 (= v_main_~x~0_429 v_main_~x~0_428)) (.cse1 (mod v_main_~x~0_429 4294967296))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (= v_main_~x~0_428 (+ v_main_~x~0_429 v_main_~y~0_472 (* (- 1) v_main_~y~0_471))) (< v_main_~y~0_472 v_main_~y~0_471) (< 0 .cse1) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ v_main_~x~0_429 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_main_~y~0_472 v_it_34 1) v_main_~y~0_471))))))) InVars {main_~y~0=v_main_~y~0_472, main_#t~post5=|v_main_#t~post5_171|, main_~x~0=v_main_~x~0_429, main_#t~post6=|v_main_#t~post6_171|} OutVars{main_~y~0=v_main_~y~0_471, main_#t~post5=|v_main_#t~post5_170|, main_~x~0=v_main_~x~0_428, main_#t~post6=|v_main_#t~post6_170|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {28467#(or (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is UNKNOWN [2022-04-28 03:54:41,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {28251#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28471#(forall ((aux_div_aux_mod_v_main_~y~0_489_47_124 Int) (aux_div_v_main_~y~0_489_47 Int) (aux_mod_aux_mod_v_main_~y~0_489_47_124 Int)) (or (and (or (not (= main_~n~0 (+ aux_mod_aux_mod_v_main_~y~0_489_47_124 main_~y~0 (* 4294967296 aux_div_aux_mod_v_main_~y~0_489_47_124)))) (< 0 (mod main_~x~0 4294967296))) (or (forall ((aux_div_v_main_~x~0_443_32 Int)) (or (< (+ aux_mod_aux_mod_v_main_~y~0_489_47_124 main_~y~0 main_~x~0 (* 4294967296 aux_div_aux_mod_v_main_~y~0_489_47_124)) (+ main_~n~0 (* 4294967296 aux_div_v_main_~x~0_443_32))) (< (+ main_~n~0 (* 4294967296 aux_div_v_main_~x~0_443_32)) (+ aux_mod_aux_mod_v_main_~y~0_489_47_124 main_~y~0 main_~x~0 (* 4294967296 aux_div_aux_mod_v_main_~y~0_489_47_124))))) (exists ((v_it_34 Int)) (and (not (< 0 (mod (+ main_~x~0 (* 4294967295 v_it_34)) 4294967296))) (<= (+ aux_mod_aux_mod_v_main_~y~0_489_47_124 main_~y~0 v_it_34 (* 4294967296 aux_div_aux_mod_v_main_~y~0_489_47_124) 1) main_~n~0) (<= 1 v_it_34))) (not (< (+ aux_mod_aux_mod_v_main_~y~0_489_47_124 main_~y~0 (* 4294967296 aux_div_aux_mod_v_main_~y~0_489_47_124)) main_~n~0)) (not (< 0 (mod main_~x~0 4294967296))))) (<= aux_mod_aux_mod_v_main_~y~0_489_47_124 0) (< (+ main_~n~0 4294967293) (+ (* 4294967296 aux_div_v_main_~y~0_489_47) aux_mod_aux_mod_v_main_~y~0_489_47_124 (* 4294967296 aux_div_aux_mod_v_main_~y~0_489_47_124))) (<= 4294967296 aux_mod_aux_mod_v_main_~y~0_489_47_124) (< (+ (* 4294967296 aux_div_v_main_~y~0_489_47) aux_mod_aux_mod_v_main_~y~0_489_47_124 (* 4294967296 aux_div_aux_mod_v_main_~y~0_489_47_124)) (+ main_~n~0 4294967293))))} is VALID [2022-04-28 03:54:41,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {28251#true} call #t~ret17 := main(); {28251#true} is VALID [2022-04-28 03:54:41,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28251#true} {28251#true} #94#return; {28251#true} is VALID [2022-04-28 03:54:41,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {28251#true} assume true; {28251#true} is VALID [2022-04-28 03:54:41,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {28251#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28251#true} is VALID [2022-04-28 03:54:41,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {28251#true} call ULTIMATE.init(); {28251#true} is VALID [2022-04-28 03:54:41,414 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:54:41,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622655405] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:54:41,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:54:41,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19, 19] total 41 [2022-04-28 03:55:06,472 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:55:06,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [625475172] [2022-04-28 03:55:06,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [625475172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:55:06,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:55:06,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 03:55:06,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854102787] [2022-04-28 03:55:06,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:55:06,472 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-28 03:55:06,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:55:06,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:06,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:55:06,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 03:55:06,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:06,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 03:55:06,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1539, Unknown=62, NotChecked=0, Total=1892 [2022-04-28 03:55:06,522 INFO L87 Difference]: Start difference. First operand 140 states and 182 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:12,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:12,210 INFO L93 Difference]: Finished difference Result 149 states and 190 transitions. [2022-04-28 03:55:12,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 03:55:12,210 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-28 03:55:12,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:55:12,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:12,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 49 transitions. [2022-04-28 03:55:12,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:12,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 49 transitions. [2022-04-28 03:55:12,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 49 transitions. [2022-04-28 03:55:14,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 48 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:55:14,307 INFO L225 Difference]: With dead ends: 149 [2022-04-28 03:55:14,307 INFO L226 Difference]: Without dead ends: 123 [2022-04-28 03:55:14,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 215.4s TimeCoverageRelationStatistics Valid=362, Invalid=2331, Unknown=63, NotChecked=0, Total=2756 [2022-04-28 03:55:14,308 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:55:14,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 65 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 204 Invalid, 0 Unknown, 36 Unchecked, 0.5s Time] [2022-04-28 03:55:14,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-04-28 03:55:15,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-04-28 03:55:15,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:55:15,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand has 123 states, 118 states have (on average 1.347457627118644) internal successors, (159), 118 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:15,425 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand has 123 states, 118 states have (on average 1.347457627118644) internal successors, (159), 118 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:15,425 INFO L87 Difference]: Start difference. First operand 123 states. Second operand has 123 states, 118 states have (on average 1.347457627118644) internal successors, (159), 118 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:15,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:15,426 INFO L93 Difference]: Finished difference Result 123 states and 163 transitions. [2022-04-28 03:55:15,426 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 163 transitions. [2022-04-28 03:55:15,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:55:15,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:55:15,426 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 118 states have (on average 1.347457627118644) internal successors, (159), 118 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 123 states. [2022-04-28 03:55:15,426 INFO L87 Difference]: Start difference. First operand has 123 states, 118 states have (on average 1.347457627118644) internal successors, (159), 118 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 123 states. [2022-04-28 03:55:15,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:15,427 INFO L93 Difference]: Finished difference Result 123 states and 163 transitions. [2022-04-28 03:55:15,427 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 163 transitions. [2022-04-28 03:55:15,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:55:15,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:55:15,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:55:15,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:55:15,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 118 states have (on average 1.347457627118644) internal successors, (159), 118 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:15,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 163 transitions. [2022-04-28 03:55:15,429 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 163 transitions. Word has length 35 [2022-04-28 03:55:15,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:55:15,429 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 163 transitions. [2022-04-28 03:55:15,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:15,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 163 transitions. [2022-04-28 03:55:29,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 159 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 03:55:29,060 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 163 transitions. [2022-04-28 03:55:29,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 03:55:29,060 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:55:29,060 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:55:29,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-04-28 03:55:29,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:55:29,261 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:55:29,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:55:29,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1025143931, now seen corresponding path program 11 times [2022-04-28 03:55:29,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:29,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1919296404] [2022-04-28 03:55:29,602 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:55:29,603 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:55:29,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1093866695, now seen corresponding path program 1 times [2022-04-28 03:55:29,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:55:29,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430399134] [2022-04-28 03:55:29,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:29,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:55:29,616 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_35.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:55:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:29,625 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_35.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:55:29,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:55:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:29,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {29316#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29303#true} is VALID [2022-04-28 03:55:29,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {29303#true} assume true; {29303#true} is VALID [2022-04-28 03:55:29,921 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29303#true} {29303#true} #94#return; {29303#true} is VALID [2022-04-28 03:55:29,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {29303#true} call ULTIMATE.init(); {29316#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:55:29,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {29316#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29303#true} is VALID [2022-04-28 03:55:29,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {29303#true} assume true; {29303#true} is VALID [2022-04-28 03:55:29,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29303#true} {29303#true} #94#return; {29303#true} is VALID [2022-04-28 03:55:29,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {29303#true} call #t~ret17 := main(); {29303#true} is VALID [2022-04-28 03:55:29,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {29303#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29303#true} is VALID [2022-04-28 03:55:29,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {29303#true} [166] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_496 v_main_~y~0_495)) (.cse1 (= |v_main_#t~post5_178| |v_main_#t~post5_177|)) (.cse2 (= |v_main_#t~post6_178| |v_main_#t~post6_177|)) (.cse3 (mod v_main_~x~0_450 4294967296))) (or (and .cse0 .cse1 (= v_main_~x~0_450 v_main_~x~0_449) .cse2) (and .cse0 (= v_main_~x~0_449 v_main_~x~0_450) .cse1 (<= .cse3 0) .cse2) (and (= v_main_~x~0_449 (+ v_main_~x~0_450 (* (- 1) v_main_~y~0_495) v_main_~y~0_496)) (forall ((v_it_35 Int)) (or (not (<= (+ v_main_~y~0_496 v_it_35 1) v_main_~y~0_495)) (< 0 (mod (+ v_main_~x~0_450 (* 4294967295 v_it_35)) 4294967296)) (not (<= 1 v_it_35)))) (< 0 .cse3) (< v_main_~y~0_496 v_main_~y~0_495)))) InVars {main_~y~0=v_main_~y~0_496, main_#t~post5=|v_main_#t~post5_178|, main_~x~0=v_main_~x~0_450, main_#t~post6=|v_main_#t~post6_178|} OutVars{main_~y~0=v_main_~y~0_495, main_#t~post5=|v_main_#t~post5_177|, main_~x~0=v_main_~x~0_449, main_#t~post6=|v_main_#t~post6_177|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {29303#true} is VALID [2022-04-28 03:55:29,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {29303#true} [165] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {29308#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:55:29,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {29308#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {29308#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:55:29,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {29308#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29309#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:55:29,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {29309#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29310#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:29,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {29310#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29311#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:29,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {29311#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29312#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:29,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {29312#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29313#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:55:29,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {29313#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29314#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:29,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {29314#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {29314#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:29,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {29314#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29314#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:29,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {29314#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29314#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:29,930 INFO L290 TraceCheckUtils]: 18: Hoare triple {29314#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29314#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:29,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {29314#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29314#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:29,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {29314#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29314#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:29,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {29314#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {29314#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:29,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {29314#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {29315#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:55:29,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {29315#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {29304#false} is VALID [2022-04-28 03:55:29,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {29304#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {29304#false} is VALID [2022-04-28 03:55:29,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {29304#false} assume !(~z~0 % 4294967296 > 0); {29304#false} is VALID [2022-04-28 03:55:29,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {29304#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {29304#false} is VALID [2022-04-28 03:55:29,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {29304#false} assume !(~y~0 % 4294967296 > 0); {29304#false} is VALID [2022-04-28 03:55:29,933 INFO L272 TraceCheckUtils]: 28: Hoare triple {29304#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29304#false} is VALID [2022-04-28 03:55:29,933 INFO L290 TraceCheckUtils]: 29: Hoare triple {29304#false} ~cond := #in~cond; {29304#false} is VALID [2022-04-28 03:55:29,933 INFO L290 TraceCheckUtils]: 30: Hoare triple {29304#false} assume 0 == ~cond; {29304#false} is VALID [2022-04-28 03:55:29,934 INFO L290 TraceCheckUtils]: 31: Hoare triple {29304#false} assume !false; {29304#false} is VALID [2022-04-28 03:55:29,934 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-28 03:55:29,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:55:29,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430399134] [2022-04-28 03:55:29,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430399134] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:55:29,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947771644] [2022-04-28 03:55:29,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:29,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:55:29,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:55:29,935 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:55:29,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-28 03:55:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:29,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 03:55:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:29,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:55:30,846 INFO L272 TraceCheckUtils]: 0: Hoare triple {29303#true} call ULTIMATE.init(); {29303#true} is VALID [2022-04-28 03:55:30,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {29303#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29303#true} is VALID [2022-04-28 03:55:30,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {29303#true} assume true; {29303#true} is VALID [2022-04-28 03:55:30,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29303#true} {29303#true} #94#return; {29303#true} is VALID [2022-04-28 03:55:30,847 INFO L272 TraceCheckUtils]: 4: Hoare triple {29303#true} call #t~ret17 := main(); {29303#true} is VALID [2022-04-28 03:55:30,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {29303#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29303#true} is VALID [2022-04-28 03:55:30,847 INFO L290 TraceCheckUtils]: 6: Hoare triple {29303#true} [166] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_496 v_main_~y~0_495)) (.cse1 (= |v_main_#t~post5_178| |v_main_#t~post5_177|)) (.cse2 (= |v_main_#t~post6_178| |v_main_#t~post6_177|)) (.cse3 (mod v_main_~x~0_450 4294967296))) (or (and .cse0 .cse1 (= v_main_~x~0_450 v_main_~x~0_449) .cse2) (and .cse0 (= v_main_~x~0_449 v_main_~x~0_450) .cse1 (<= .cse3 0) .cse2) (and (= v_main_~x~0_449 (+ v_main_~x~0_450 (* (- 1) v_main_~y~0_495) v_main_~y~0_496)) (forall ((v_it_35 Int)) (or (not (<= (+ v_main_~y~0_496 v_it_35 1) v_main_~y~0_495)) (< 0 (mod (+ v_main_~x~0_450 (* 4294967295 v_it_35)) 4294967296)) (not (<= 1 v_it_35)))) (< 0 .cse3) (< v_main_~y~0_496 v_main_~y~0_495)))) InVars {main_~y~0=v_main_~y~0_496, main_#t~post5=|v_main_#t~post5_178|, main_~x~0=v_main_~x~0_450, main_#t~post6=|v_main_#t~post6_178|} OutVars{main_~y~0=v_main_~y~0_495, main_#t~post5=|v_main_#t~post5_177|, main_~x~0=v_main_~x~0_449, main_#t~post6=|v_main_#t~post6_177|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {29303#true} is VALID [2022-04-28 03:55:30,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {29303#true} [165] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {29303#true} is VALID [2022-04-28 03:55:30,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {29303#true} ~z~0 := ~y~0; {29344#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:55:30,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {29344#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29348#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:55:30,848 INFO L290 TraceCheckUtils]: 10: Hoare triple {29348#(= main_~y~0 (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29352#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:55:30,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {29352#(= main_~y~0 (+ main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29356#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-28 03:55:30,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {29356#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29360#(= (+ main_~y~0 (- 3)) (+ main_~z~0 1))} is VALID [2022-04-28 03:55:30,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {29360#(= (+ main_~y~0 (- 3)) (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29364#(= (+ main_~y~0 (- 4)) (+ main_~z~0 1))} is VALID [2022-04-28 03:55:30,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {29364#(= (+ main_~y~0 (- 4)) (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29368#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 03:55:30,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {29368#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {29368#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 03:55:30,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {29368#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29375#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:55:30,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {29375#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29379#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:55:30,855 INFO L290 TraceCheckUtils]: 18: Hoare triple {29379#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29383#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:55:30,856 INFO L290 TraceCheckUtils]: 19: Hoare triple {29383#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29387#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:55:30,857 INFO L290 TraceCheckUtils]: 20: Hoare triple {29387#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29391#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:55:30,857 INFO L290 TraceCheckUtils]: 21: Hoare triple {29391#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {29304#false} is VALID [2022-04-28 03:55:30,858 INFO L290 TraceCheckUtils]: 22: Hoare triple {29304#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {29304#false} is VALID [2022-04-28 03:55:30,858 INFO L290 TraceCheckUtils]: 23: Hoare triple {29304#false} assume !(~x~0 % 4294967296 > 0); {29304#false} is VALID [2022-04-28 03:55:30,858 INFO L290 TraceCheckUtils]: 24: Hoare triple {29304#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {29304#false} is VALID [2022-04-28 03:55:30,858 INFO L290 TraceCheckUtils]: 25: Hoare triple {29304#false} assume !(~z~0 % 4294967296 > 0); {29304#false} is VALID [2022-04-28 03:55:30,858 INFO L290 TraceCheckUtils]: 26: Hoare triple {29304#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {29304#false} is VALID [2022-04-28 03:55:30,858 INFO L290 TraceCheckUtils]: 27: Hoare triple {29304#false} assume !(~y~0 % 4294967296 > 0); {29304#false} is VALID [2022-04-28 03:55:30,858 INFO L272 TraceCheckUtils]: 28: Hoare triple {29304#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29304#false} is VALID [2022-04-28 03:55:30,858 INFO L290 TraceCheckUtils]: 29: Hoare triple {29304#false} ~cond := #in~cond; {29304#false} is VALID [2022-04-28 03:55:30,858 INFO L290 TraceCheckUtils]: 30: Hoare triple {29304#false} assume 0 == ~cond; {29304#false} is VALID [2022-04-28 03:55:30,858 INFO L290 TraceCheckUtils]: 31: Hoare triple {29304#false} assume !false; {29304#false} is VALID [2022-04-28 03:55:30,858 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:55:30,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:55:31,707 INFO L290 TraceCheckUtils]: 31: Hoare triple {29304#false} assume !false; {29304#false} is VALID [2022-04-28 03:55:31,708 INFO L290 TraceCheckUtils]: 30: Hoare triple {29304#false} assume 0 == ~cond; {29304#false} is VALID [2022-04-28 03:55:31,708 INFO L290 TraceCheckUtils]: 29: Hoare triple {29304#false} ~cond := #in~cond; {29304#false} is VALID [2022-04-28 03:55:31,708 INFO L272 TraceCheckUtils]: 28: Hoare triple {29304#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29304#false} is VALID [2022-04-28 03:55:31,708 INFO L290 TraceCheckUtils]: 27: Hoare triple {29304#false} assume !(~y~0 % 4294967296 > 0); {29304#false} is VALID [2022-04-28 03:55:31,708 INFO L290 TraceCheckUtils]: 26: Hoare triple {29304#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {29304#false} is VALID [2022-04-28 03:55:31,708 INFO L290 TraceCheckUtils]: 25: Hoare triple {29304#false} assume !(~z~0 % 4294967296 > 0); {29304#false} is VALID [2022-04-28 03:55:31,708 INFO L290 TraceCheckUtils]: 24: Hoare triple {29304#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {29304#false} is VALID [2022-04-28 03:55:31,708 INFO L290 TraceCheckUtils]: 23: Hoare triple {29304#false} assume !(~x~0 % 4294967296 > 0); {29304#false} is VALID [2022-04-28 03:55:31,708 INFO L290 TraceCheckUtils]: 22: Hoare triple {29304#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {29304#false} is VALID [2022-04-28 03:55:31,708 INFO L290 TraceCheckUtils]: 21: Hoare triple {29391#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {29304#false} is VALID [2022-04-28 03:55:31,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {29387#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29391#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:55:31,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {29383#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29387#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:55:31,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {29379#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29383#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:55:31,713 INFO L290 TraceCheckUtils]: 17: Hoare triple {29375#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29379#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:55:31,714 INFO L290 TraceCheckUtils]: 16: Hoare triple {29368#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29375#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:55:31,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {29368#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {29368#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 03:55:31,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {29476#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29368#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 03:55:31,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {29480#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29476#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:55:31,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {29484#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29480#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:55:31,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {29488#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29484#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 03:55:31,720 INFO L290 TraceCheckUtils]: 10: Hoare triple {29492#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29488#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:55:31,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {29496#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29492#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-28 03:55:31,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {29303#true} ~z~0 := ~y~0; {29496#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-28 03:55:31,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {29303#true} [165] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {29303#true} is VALID [2022-04-28 03:55:31,722 INFO L290 TraceCheckUtils]: 6: Hoare triple {29303#true} [166] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_496 v_main_~y~0_495)) (.cse1 (= |v_main_#t~post5_178| |v_main_#t~post5_177|)) (.cse2 (= |v_main_#t~post6_178| |v_main_#t~post6_177|)) (.cse3 (mod v_main_~x~0_450 4294967296))) (or (and .cse0 .cse1 (= v_main_~x~0_450 v_main_~x~0_449) .cse2) (and .cse0 (= v_main_~x~0_449 v_main_~x~0_450) .cse1 (<= .cse3 0) .cse2) (and (= v_main_~x~0_449 (+ v_main_~x~0_450 (* (- 1) v_main_~y~0_495) v_main_~y~0_496)) (forall ((v_it_35 Int)) (or (not (<= (+ v_main_~y~0_496 v_it_35 1) v_main_~y~0_495)) (< 0 (mod (+ v_main_~x~0_450 (* 4294967295 v_it_35)) 4294967296)) (not (<= 1 v_it_35)))) (< 0 .cse3) (< v_main_~y~0_496 v_main_~y~0_495)))) InVars {main_~y~0=v_main_~y~0_496, main_#t~post5=|v_main_#t~post5_178|, main_~x~0=v_main_~x~0_450, main_#t~post6=|v_main_#t~post6_178|} OutVars{main_~y~0=v_main_~y~0_495, main_#t~post5=|v_main_#t~post5_177|, main_~x~0=v_main_~x~0_449, main_#t~post6=|v_main_#t~post6_177|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {29303#true} is VALID [2022-04-28 03:55:31,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {29303#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29303#true} is VALID [2022-04-28 03:55:31,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {29303#true} call #t~ret17 := main(); {29303#true} is VALID [2022-04-28 03:55:31,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29303#true} {29303#true} #94#return; {29303#true} is VALID [2022-04-28 03:55:31,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {29303#true} assume true; {29303#true} is VALID [2022-04-28 03:55:31,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {29303#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29303#true} is VALID [2022-04-28 03:55:31,722 INFO L272 TraceCheckUtils]: 0: Hoare triple {29303#true} call ULTIMATE.init(); {29303#true} is VALID [2022-04-28 03:55:31,722 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:55:31,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947771644] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:55:31,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:55:31,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 29 [2022-04-28 03:55:32,365 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:55:32,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1919296404] [2022-04-28 03:55:32,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1919296404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:55:32,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:55:32,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 03:55:32,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331753930] [2022-04-28 03:55:32,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:55:32,366 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 14 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-28 03:55:32,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:55:32,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.8) internal successors, (27), 14 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:32,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:55:32,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 03:55:32,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:32,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 03:55:32,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=945, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 03:55:32,399 INFO L87 Difference]: Start difference. First operand 123 states and 163 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 14 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)