/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-de52.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 06:40:46,446 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:40:46,448 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:40:46,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:40:46,512 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:40:46,513 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:40:46,516 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:40:46,518 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:40:46,520 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:40:46,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:40:46,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:40:46,526 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:40:46,526 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:40:46,527 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:40:46,528 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:40:46,528 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:40:46,529 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:40:46,529 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:40:46,530 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:40:46,532 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:40:46,533 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:40:46,539 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:40:46,540 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:40:46,541 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:40:46,542 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:40:46,548 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:40:46,548 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:40:46,549 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:40:46,549 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:40:46,550 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:40:46,550 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:40:46,550 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:40:46,551 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:40:46,551 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:40:46,552 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:40:46,553 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:40:46,553 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:40:46,553 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:40:46,554 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:40:46,554 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:40:46,554 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:40:46,556 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:40:46,557 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 06:40:46,564 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:40:46,565 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:40:46,566 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:40:46,566 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:40:46,566 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:40:46,566 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:40:46,566 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:40:46,566 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:40:46,567 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:40:46,567 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:40:46,567 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:40:46,567 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:40:46,567 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:40:46,567 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:40:46,567 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:40:46,568 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:40:46,568 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:40:46,568 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:40:46,568 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:40:46,568 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:40:46,568 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:40:46,568 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:40:46,568 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:40:46,569 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:40:46,569 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:40:46,569 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-15 06:40:46,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:40:46,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:40:46,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:40:46,804 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:40:46,804 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:40:46,805 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de52.c [2022-04-15 06:40:46,863 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d858a8b9/1da6c6d11fe74694a80e082c3c36343d/FLAG818afade5 [2022-04-15 06:40:47,172 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:40:47,172 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de52.c [2022-04-15 06:40:47,178 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d858a8b9/1da6c6d11fe74694a80e082c3c36343d/FLAG818afade5 [2022-04-15 06:40:47,597 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d858a8b9/1da6c6d11fe74694a80e082c3c36343d [2022-04-15 06:40:47,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:40:47,600 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:40:47,603 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:40:47,603 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:40:47,610 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:40:47,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:40:47" (1/1) ... [2022-04-15 06:40:47,611 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f46eaa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:40:47, skipping insertion in model container [2022-04-15 06:40:47,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:40:47" (1/1) ... [2022-04-15 06:40:47,617 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:40:47,629 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:40:47,740 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-de52.c[368,381] [2022-04-15 06:40:47,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:40:47,773 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:40:47,783 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-de52.c[368,381] [2022-04-15 06:40:47,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:40:47,798 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:40:47,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:40:47 WrapperNode [2022-04-15 06:40:47,799 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:40:47,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:40:47,800 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:40:47,800 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:40:47,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:40:47" (1/1) ... [2022-04-15 06:40:47,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:40:47" (1/1) ... [2022-04-15 06:40:47,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:40:47" (1/1) ... [2022-04-15 06:40:47,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:40:47" (1/1) ... [2022-04-15 06:40:47,816 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:40:47" (1/1) ... [2022-04-15 06:40:47,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:40:47" (1/1) ... [2022-04-15 06:40:47,824 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:40:47" (1/1) ... [2022-04-15 06:40:47,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:40:47,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:40:47,836 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:40:47,836 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:40:47,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:40:47" (1/1) ... [2022-04-15 06:40:47,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:40:47,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:40:47,865 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-15 06:40:47,866 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-15 06:40:47,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:40:47,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:40:47,902 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:40:47,902 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:40:47,902 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:40:47,902 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:40:47,903 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:40:47,903 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:40:47,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:40:47,903 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 06:40:47,903 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:40:47,903 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:40:47,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:40:47,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:40:47,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:40:47,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:40:47,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:40:47,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:40:47,949 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:40:47,950 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:40:48,100 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:40:48,106 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:40:48,106 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-15 06:40:48,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:40:48 BoogieIcfgContainer [2022-04-15 06:40:48,107 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:40:48,109 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:40:48,109 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:40:48,111 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:40:48,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:40:47" (1/3) ... [2022-04-15 06:40:48,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c68e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:40:48, skipping insertion in model container [2022-04-15 06:40:48,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:40:47" (2/3) ... [2022-04-15 06:40:48,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c68e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:40:48, skipping insertion in model container [2022-04-15 06:40:48,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:40:48" (3/3) ... [2022-04-15 06:40:48,114 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de52.c [2022-04-15 06:40:48,117 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:40:48,117 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:40:48,160 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:40:48,166 INFO L340 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 [2022-04-15 06:40:48,166 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:40:48,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:40:48,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 06:40:48,195 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:48,195 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:40:48,196 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:48,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:48,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1060076674, now seen corresponding path program 1 times [2022-04-15 06:40:48,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:48,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1410092500] [2022-04-15 06:40:48,238 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:40:48,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1060076674, now seen corresponding path program 2 times [2022-04-15 06:40:48,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:48,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293653426] [2022-04-15 06:40:48,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:48,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:48,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:48,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:48,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-15 06:40:48,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 06:40:48,452 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #83#return; {27#true} is VALID [2022-04-15 06:40:48,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:48,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-15 06:40:48,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 06:40:48,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #83#return; {27#true} is VALID [2022-04-15 06:40:48,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret15 := main(); {27#true} is VALID [2022-04-15 06:40:48,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27#true} is VALID [2022-04-15 06:40:48,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !(~x~0 % 4294967296 > 0); {27#true} is VALID [2022-04-15 06:40:48,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#true} ~z~0 := ~y~0; {27#true} is VALID [2022-04-15 06:40:48,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#true} assume !(~z~0 % 4294967296 > 0); {27#true} is VALID [2022-04-15 06:40:48,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#true} assume !(~y~0 % 4294967296 > 0); {27#true} is VALID [2022-04-15 06:40:48,459 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-04-15 06:40:48,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !(~z~0 % 4294967296 > 0); {28#false} is VALID [2022-04-15 06:40:48,459 INFO L272 TraceCheckUtils]: 12: Hoare triple {28#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {28#false} is VALID [2022-04-15 06:40:48,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-15 06:40:48,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-15 06:40:48,461 INFO L290 TraceCheckUtils]: 15: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-15 06:40:48,461 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-15 06:40:48,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:48,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293653426] [2022-04-15 06:40:48,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293653426] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:48,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:48,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:40:48,468 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:40:48,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1410092500] [2022-04-15 06:40:48,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1410092500] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:48,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:48,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:40:48,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126969578] [2022-04-15 06:40:48,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:40:48,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 06:40:48,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:40:48,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:48,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:48,506 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 06:40:48,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:48,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 06:40:48,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:40:48,536 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:48,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:48,648 INFO L93 Difference]: Finished difference Result 41 states and 60 transitions. [2022-04-15 06:40:48,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 06:40:48,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 06:40:48,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:40:48,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:48,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-15 06:40:48,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:48,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-15 06:40:48,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2022-04-15 06:40:48,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:48,757 INFO L225 Difference]: With dead ends: 41 [2022-04-15 06:40:48,757 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 06:40:48,759 INFO L912 BasicCegarLoop]: 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-15 06:40:48,762 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:40:48,764 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:40:48,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 06:40:48,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 06:40:48,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:40:48,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:48,797 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:48,797 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:48,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:48,801 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-04-15 06:40:48,802 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-15 06:40:48,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:48,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:48,803 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 06:40:48,803 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 06:40:48,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:48,804 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-04-15 06:40:48,805 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-15 06:40:48,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:48,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:48,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:40:48,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:40:48,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:48,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-04-15 06:40:48,807 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 16 [2022-04-15 06:40:48,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:40:48,807 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-04-15 06:40:48,807 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:48,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 21 transitions. [2022-04-15 06:40:48,859 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-15 06:40:48,859 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-15 06:40:48,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 06:40:48,860 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:48,860 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:40:48,860 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:40:48,861 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:48,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:48,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1174593278, now seen corresponding path program 1 times [2022-04-15 06:40:48,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:48,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [285688883] [2022-04-15 06:40:48,863 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:40:48,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1174593278, now seen corresponding path program 2 times [2022-04-15 06:40:48,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:48,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898944976] [2022-04-15 06:40:48,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:48,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:49,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:49,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {185#true} is VALID [2022-04-15 06:40:49,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {185#true} assume true; {185#true} is VALID [2022-04-15 06:40:49,023 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {185#true} {185#true} #83#return; {185#true} is VALID [2022-04-15 06:40:49,024 INFO L272 TraceCheckUtils]: 0: Hoare triple {185#true} call ULTIMATE.init(); {193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:49,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {185#true} is VALID [2022-04-15 06:40:49,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {185#true} assume true; {185#true} is VALID [2022-04-15 06:40:49,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {185#true} {185#true} #83#return; {185#true} is VALID [2022-04-15 06:40:49,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {185#true} call #t~ret15 := main(); {185#true} is VALID [2022-04-15 06:40:49,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {185#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {185#true} is VALID [2022-04-15 06:40:49,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {185#true} assume !(~x~0 % 4294967296 > 0); {185#true} is VALID [2022-04-15 06:40:49,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {185#true} ~z~0 := ~y~0; {185#true} is VALID [2022-04-15 06:40:49,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {185#true} assume !(~z~0 % 4294967296 > 0); {185#true} is VALID [2022-04-15 06:40:49,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {185#true} assume !(~y~0 % 4294967296 > 0); {190#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} is VALID [2022-04-15 06:40:49,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {190#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} assume !(~x~0 % 4294967296 > 0); {190#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} is VALID [2022-04-15 06:40:49,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {190#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} assume !(~z~0 % 4294967296 > 0); {190#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} is VALID [2022-04-15 06:40:49,029 INFO L272 TraceCheckUtils]: 12: Hoare triple {190#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {191#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:40:49,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {191#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {192#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:40:49,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {192#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {186#false} is VALID [2022-04-15 06:40:49,031 INFO L290 TraceCheckUtils]: 15: Hoare triple {186#false} assume !false; {186#false} is VALID [2022-04-15 06:40:49,031 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-15 06:40:49,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:49,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898944976] [2022-04-15 06:40:49,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898944976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:49,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:49,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:40:49,033 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:40:49,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [285688883] [2022-04-15 06:40:49,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [285688883] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:49,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:49,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:40:49,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739929385] [2022-04-15 06:40:49,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:40:49,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 06:40:49,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:40:49,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:49,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:49,050 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:40:49,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:49,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:40:49,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:40:49,051 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:49,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:49,241 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-15 06:40:49,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:40:49,242 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 06:40:49,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:40:49,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:49,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-15 06:40:49,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:49,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-15 06:40:49,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-15 06:40:49,293 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-15 06:40:49,295 INFO L225 Difference]: With dead ends: 34 [2022-04-15 06:40:49,295 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 06:40:49,296 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:40:49,300 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:40:49,301 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 32 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:40:49,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 06:40:49,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 06:40:49,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:40:49,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:49,317 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:49,318 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:49,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:49,320 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2022-04-15 06:40:49,320 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-04-15 06:40:49,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:49,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:49,322 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 06:40:49,322 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 06:40:49,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:49,324 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2022-04-15 06:40:49,325 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-04-15 06:40:49,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:49,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:49,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:40:49,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:40:49,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:49,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2022-04-15 06:40:49,329 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 16 [2022-04-15 06:40:49,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:40:49,329 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2022-04-15 06:40:49,330 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:49,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 30 transitions. [2022-04-15 06:40:49,361 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-15 06:40:49,362 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-04-15 06:40:49,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 06:40:49,362 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:49,363 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:40:49,363 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:40:49,363 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:49,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:49,364 INFO L85 PathProgramCache]: Analyzing trace with hash -2018158143, now seen corresponding path program 1 times [2022-04-15 06:40:49,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:49,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [643902534] [2022-04-15 06:40:49,365 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:40:49,365 INFO L85 PathProgramCache]: Analyzing trace with hash -2018158143, now seen corresponding path program 2 times [2022-04-15 06:40:49,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:49,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153485302] [2022-04-15 06:40:49,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:49,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:49,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:49,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {369#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {363#true} is VALID [2022-04-15 06:40:49,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {363#true} assume true; {363#true} is VALID [2022-04-15 06:40:49,438 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {363#true} {363#true} #83#return; {363#true} is VALID [2022-04-15 06:40:49,439 INFO L272 TraceCheckUtils]: 0: Hoare triple {363#true} call ULTIMATE.init(); {369#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:49,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {369#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {363#true} is VALID [2022-04-15 06:40:49,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {363#true} assume true; {363#true} is VALID [2022-04-15 06:40:49,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {363#true} {363#true} #83#return; {363#true} is VALID [2022-04-15 06:40:49,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {363#true} call #t~ret15 := main(); {363#true} is VALID [2022-04-15 06:40:49,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {363#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {363#true} is VALID [2022-04-15 06:40:49,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {363#true} assume !(~x~0 % 4294967296 > 0); {363#true} is VALID [2022-04-15 06:40:49,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {363#true} ~z~0 := ~y~0; {363#true} is VALID [2022-04-15 06:40:49,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {363#true} assume !(~z~0 % 4294967296 > 0); {368#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 06:40:49,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {368#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {368#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 06:40:49,442 INFO L290 TraceCheckUtils]: 10: Hoare triple {368#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {368#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 06:40:49,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {368#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {364#false} is VALID [2022-04-15 06:40:49,443 INFO L290 TraceCheckUtils]: 12: Hoare triple {364#false} assume !(~z~0 % 4294967296 > 0); {364#false} is VALID [2022-04-15 06:40:49,443 INFO L272 TraceCheckUtils]: 13: Hoare triple {364#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {364#false} is VALID [2022-04-15 06:40:49,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {364#false} ~cond := #in~cond; {364#false} is VALID [2022-04-15 06:40:49,443 INFO L290 TraceCheckUtils]: 15: Hoare triple {364#false} assume 0 == ~cond; {364#false} is VALID [2022-04-15 06:40:49,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {364#false} assume !false; {364#false} is VALID [2022-04-15 06:40:49,444 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-15 06:40:49,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:49,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153485302] [2022-04-15 06:40:49,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153485302] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:49,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:49,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:40:49,445 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:40:49,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [643902534] [2022-04-15 06:40:49,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [643902534] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:49,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:49,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:40:49,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135209430] [2022-04-15 06:40:49,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:40:49,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:40:49,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:40:49,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:49,459 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-15 06:40:49,460 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 06:40:49,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:49,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 06:40:49,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 06:40:49,461 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:49,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:49,566 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-15 06:40:49,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 06:40:49,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:40:49,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:40:49,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:49,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-15 06:40:49,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:49,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-15 06:40:49,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2022-04-15 06:40:49,604 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-15 06:40:49,605 INFO L225 Difference]: With dead ends: 34 [2022-04-15 06:40:49,605 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 06:40:49,606 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 06:40:49,607 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:40:49,607 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 26 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:40:49,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 06:40:49,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 06:40:49,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:40:49,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 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-15 06:40:49,631 INFO L74 IsIncluded]: Start isIncluded. First operand 27 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-15 06:40:49,632 INFO L87 Difference]: Start difference. First operand 27 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-15 06:40:49,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:49,634 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-04-15 06:40:49,634 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-04-15 06:40:49,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:49,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:49,635 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 27 states. [2022-04-15 06:40:49,637 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 27 states. [2022-04-15 06:40:49,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:49,639 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-04-15 06:40:49,639 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-04-15 06:40:49,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:49,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:49,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:40:49,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:40:49,640 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-15 06:40:49,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2022-04-15 06:40:49,645 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 17 [2022-04-15 06:40:49,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:40:49,646 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-04-15 06:40:49,646 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:49,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 36 transitions. [2022-04-15 06:40:49,693 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-15 06:40:49,694 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-04-15 06:40:49,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 06:40:49,694 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:49,694 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:40:49,695 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 06:40:49,695 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:49,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:49,695 INFO L85 PathProgramCache]: Analyzing trace with hash -615329744, now seen corresponding path program 1 times [2022-04-15 06:40:49,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:49,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1328227732] [2022-04-15 06:40:49,696 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:40:49,696 INFO L85 PathProgramCache]: Analyzing trace with hash -615329744, now seen corresponding path program 2 times [2022-04-15 06:40:49,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:49,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661831700] [2022-04-15 06:40:49,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:49,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:49,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:49,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:49,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {550#true} is VALID [2022-04-15 06:40:49,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {550#true} assume true; {550#true} is VALID [2022-04-15 06:40:49,745 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {550#true} {550#true} #83#return; {550#true} is VALID [2022-04-15 06:40:49,746 INFO L272 TraceCheckUtils]: 0: Hoare triple {550#true} call ULTIMATE.init(); {556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:49,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {550#true} is VALID [2022-04-15 06:40:49,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {550#true} assume true; {550#true} is VALID [2022-04-15 06:40:49,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {550#true} {550#true} #83#return; {550#true} is VALID [2022-04-15 06:40:49,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {550#true} call #t~ret15 := main(); {550#true} is VALID [2022-04-15 06:40:49,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {550#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {550#true} is VALID [2022-04-15 06:40:49,747 INFO L290 TraceCheckUtils]: 6: Hoare triple {550#true} assume !(~x~0 % 4294967296 > 0); {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:49,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:49,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:49,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:49,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {555#(<= 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; {551#false} is VALID [2022-04-15 06:40:49,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {551#false} assume !(~x~0 % 4294967296 > 0); {551#false} is VALID [2022-04-15 06:40:49,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {551#false} assume !(~z~0 % 4294967296 > 0); {551#false} is VALID [2022-04-15 06:40:49,750 INFO L272 TraceCheckUtils]: 13: Hoare triple {551#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {551#false} is VALID [2022-04-15 06:40:49,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {551#false} ~cond := #in~cond; {551#false} is VALID [2022-04-15 06:40:49,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {551#false} assume 0 == ~cond; {551#false} is VALID [2022-04-15 06:40:49,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {551#false} assume !false; {551#false} is VALID [2022-04-15 06:40:49,751 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-15 06:40:49,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:49,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661831700] [2022-04-15 06:40:49,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661831700] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:49,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:49,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:40:49,752 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:40:49,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1328227732] [2022-04-15 06:40:49,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1328227732] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:49,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:49,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:40:49,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934833243] [2022-04-15 06:40:49,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:40:49,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:40:49,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:40:49,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:49,767 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-15 06:40:49,767 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 06:40:49,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:49,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 06:40:49,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 06:40:49,768 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:49,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:49,853 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2022-04-15 06:40:49,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 06:40:49,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:40:49,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:40:49,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:49,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-04-15 06:40:49,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:49,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-04-15 06:40:49,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 35 transitions. [2022-04-15 06:40:49,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:49,891 INFO L225 Difference]: With dead ends: 43 [2022-04-15 06:40:49,891 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 06:40:49,891 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 06:40:49,892 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:40:49,892 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 27 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:40:49,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 06:40:49,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 06:40:49,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:40:49,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:49,911 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:49,911 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:49,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:49,912 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-04-15 06:40:49,913 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-04-15 06:40:49,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:49,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:49,913 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-15 06:40:49,913 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-15 06:40:49,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:49,915 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-04-15 06:40:49,915 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-04-15 06:40:49,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:49,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:49,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:40:49,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:40:49,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:49,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2022-04-15 06:40:49,917 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 17 [2022-04-15 06:40:49,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:40:49,917 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2022-04-15 06:40:49,917 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:49,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 43 transitions. [2022-04-15 06:40:49,966 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-15 06:40:49,966 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-04-15 06:40:49,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 06:40:49,967 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:49,967 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:40:49,967 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 06:40:49,967 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:49,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:49,968 INFO L85 PathProgramCache]: Analyzing trace with hash 669375650, now seen corresponding path program 1 times [2022-04-15 06:40:49,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:49,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [372187362] [2022-04-15 06:40:50,307 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-15 06:40:50,310 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:40:50,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1460958083, now seen corresponding path program 1 times [2022-04-15 06:40:50,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:50,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654254119] [2022-04-15 06:40:50,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:50,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:50,328 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-15 06:40:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:50,361 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-15 06:40:50,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:50,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {784#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {775#true} is VALID [2022-04-15 06:40:50,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {775#true} assume true; {775#true} is VALID [2022-04-15 06:40:50,453 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {775#true} {775#true} #83#return; {775#true} is VALID [2022-04-15 06:40:50,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {775#true} call ULTIMATE.init(); {784#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:50,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {784#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {775#true} is VALID [2022-04-15 06:40:50,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {775#true} assume true; {775#true} is VALID [2022-04-15 06:40:50,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {775#true} {775#true} #83#return; {775#true} is VALID [2022-04-15 06:40:50,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {775#true} call #t~ret15 := main(); {775#true} is VALID [2022-04-15 06:40:50,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {775#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {780#(= main_~y~0 0)} is VALID [2022-04-15 06:40:50,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {780#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {781#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-15 06:40:50,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {781#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {782#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 06:40:50,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {782#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [87] L23-2-->L29-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_11 v_main_~x~0_10)) (.cse1 (= |v_main_#t~post7_4| |v_main_#t~post7_3|)) (.cse2 (= |v_main_#t~post8_4| |v_main_#t~post8_3|)) (.cse3 (= v_main_~z~0_12 v_main_~z~0_11)) (.cse4 (mod v_main_~z~0_12 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_11 v_main_~z~0_12 (* (- 1) v_main_~z~0_11)) v_main_~x~0_10) (< v_main_~z~0_11 v_main_~z~0_12) (< 0 .cse4) (forall ((v_it_1 Int)) (or (not (<= (+ v_main_~z~0_11 v_it_1 1) v_main_~z~0_12)) (< 0 (mod (+ v_main_~z~0_12 (* v_it_1 4294967295)) 4294967296)) (not (<= 1 v_it_1))))))) InVars {main_~x~0=v_main_~x~0_11, main_#t~post8=|v_main_#t~post8_4|, main_~z~0=v_main_~z~0_12, main_#t~post7=|v_main_#t~post7_4|} OutVars{main_~x~0=v_main_~x~0_10, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_11, main_#t~post7=|v_main_#t~post7_3|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {783#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:50,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {783#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [86] L29-1_primed-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_5 4294967296))) InVars {main_~z~0=v_main_~z~0_5} OutVars{main_~z~0=v_main_~z~0_5} AuxVars[] AssignedVars[] {783#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:50,459 INFO L290 TraceCheckUtils]: 10: Hoare triple {783#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {783#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:50,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {783#(<= 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; {776#false} is VALID [2022-04-15 06:40:50,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {776#false} assume !(~x~0 % 4294967296 > 0); {776#false} is VALID [2022-04-15 06:40:50,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {776#false} assume !(~z~0 % 4294967296 > 0); {776#false} is VALID [2022-04-15 06:40:50,460 INFO L272 TraceCheckUtils]: 14: Hoare triple {776#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {776#false} is VALID [2022-04-15 06:40:50,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {776#false} ~cond := #in~cond; {776#false} is VALID [2022-04-15 06:40:50,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {776#false} assume 0 == ~cond; {776#false} is VALID [2022-04-15 06:40:50,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {776#false} assume !false; {776#false} is VALID [2022-04-15 06:40:50,461 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-15 06:40:50,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:50,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654254119] [2022-04-15 06:40:50,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654254119] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:50,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:50,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:40:50,497 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:40:50,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [372187362] [2022-04-15 06:40:50,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [372187362] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:50,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:50,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:40:50,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733704744] [2022-04-15 06:40:50,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:40:50,498 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 06:40:50,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:40:50,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:50,513 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-15 06:40:50,514 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 06:40:50,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:50,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 06:40:50,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:40:50,515 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:50,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:50,739 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-04-15 06:40:50,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:40:50,739 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 06:40:50,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:40:50,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:50,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-04-15 06:40:50,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:50,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-04-15 06:40:50,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 40 transitions. [2022-04-15 06:40:50,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:50,789 INFO L225 Difference]: With dead ends: 40 [2022-04-15 06:40:50,789 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 06:40:50,790 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-15 06:40:50,790 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 29 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:40:50,791 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 34 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:40:50,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 06:40:50,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-15 06:40:50,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:40:50,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 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-15 06:40:50,811 INFO L74 IsIncluded]: Start isIncluded. First operand 28 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-15 06:40:50,812 INFO L87 Difference]: Start difference. First operand 28 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-15 06:40:50,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:50,813 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-04-15 06:40:50,813 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-04-15 06:40:50,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:50,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:50,814 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 28 states. [2022-04-15 06:40:50,814 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 28 states. [2022-04-15 06:40:50,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:50,815 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-04-15 06:40:50,815 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-04-15 06:40:50,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:50,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:50,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:40:50,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:40:50,816 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-15 06:40:50,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-04-15 06:40:50,817 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 18 [2022-04-15 06:40:50,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:40:50,817 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-04-15 06:40:50,817 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:50,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 37 transitions. [2022-04-15 06:40:50,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:50,861 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-04-15 06:40:50,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 06:40:50,861 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:50,861 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:40:50,862 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 06:40:50,862 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:50,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:50,862 INFO L85 PathProgramCache]: Analyzing trace with hash 735022287, now seen corresponding path program 1 times [2022-04-15 06:40:50,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:50,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1829145379] [2022-04-15 06:40:51,167 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-15 06:40:51,169 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:40:51,172 INFO L85 PathProgramCache]: Analyzing trace with hash 932024430, now seen corresponding path program 1 times [2022-04-15 06:40:51,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:51,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146483236] [2022-04-15 06:40:51,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:51,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:51,184 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-15 06:40:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:51,198 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-15 06:40:51,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:51,257 INFO L290 TraceCheckUtils]: 0: Hoare triple {994#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {987#true} is VALID [2022-04-15 06:40:51,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {987#true} assume true; {987#true} is VALID [2022-04-15 06:40:51,258 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {987#true} {987#true} #83#return; {987#true} is VALID [2022-04-15 06:40:51,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {987#true} call ULTIMATE.init(); {994#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:51,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {994#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {987#true} is VALID [2022-04-15 06:40:51,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {987#true} assume true; {987#true} is VALID [2022-04-15 06:40:51,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {987#true} {987#true} #83#return; {987#true} is VALID [2022-04-15 06:40:51,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {987#true} call #t~ret15 := main(); {987#true} is VALID [2022-04-15 06:40:51,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {987#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {987#true} is VALID [2022-04-15 06:40:51,259 INFO L290 TraceCheckUtils]: 6: Hoare triple {987#true} [89] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_4| |v_main_#t~post6_3|)) (.cse1 (= v_main_~x~0_19 v_main_~x~0_18)) (.cse2 (= |v_main_#t~post5_4| |v_main_#t~post5_3|)) (.cse3 (= v_main_~y~0_16 v_main_~y~0_15)) (.cse4 (mod v_main_~x~0_19 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3) (and (< v_main_~y~0_16 v_main_~y~0_15) (< 0 .cse4) (= v_main_~x~0_18 (+ v_main_~x~0_19 v_main_~y~0_16 (* (- 1) v_main_~y~0_15))) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (< 0 (mod (+ v_main_~x~0_19 (* v_it_2 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_16 v_it_2 1) v_main_~y~0_15))))))) InVars {main_~y~0=v_main_~y~0_16, main_#t~post5=|v_main_#t~post5_4|, main_~x~0=v_main_~x~0_19, main_#t~post6=|v_main_#t~post6_4|} OutVars{main_~y~0=v_main_~y~0_15, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_18, main_#t~post6=|v_main_#t~post6_3|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {987#true} is VALID [2022-04-15 06:40:51,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {987#true} [88] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {987#true} is VALID [2022-04-15 06:40:51,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {987#true} ~z~0 := ~y~0; {992#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:40:51,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {992#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !(~z~0 % 4294967296 > 0); {993#(and (= main_~z~0 main_~y~0) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:51,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {993#(and (= main_~z~0 main_~y~0) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {988#false} is VALID [2022-04-15 06:40:51,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {988#false} assume !(~y~0 % 4294967296 > 0); {988#false} is VALID [2022-04-15 06:40:51,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {988#false} assume !(~x~0 % 4294967296 > 0); {988#false} is VALID [2022-04-15 06:40:51,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {988#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {988#false} is VALID [2022-04-15 06:40:51,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {988#false} assume !(~z~0 % 4294967296 > 0); {988#false} is VALID [2022-04-15 06:40:51,263 INFO L272 TraceCheckUtils]: 15: Hoare triple {988#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {988#false} is VALID [2022-04-15 06:40:51,263 INFO L290 TraceCheckUtils]: 16: Hoare triple {988#false} ~cond := #in~cond; {988#false} is VALID [2022-04-15 06:40:51,263 INFO L290 TraceCheckUtils]: 17: Hoare triple {988#false} assume 0 == ~cond; {988#false} is VALID [2022-04-15 06:40:51,263 INFO L290 TraceCheckUtils]: 18: Hoare triple {988#false} assume !false; {988#false} is VALID [2022-04-15 06:40:51,263 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-15 06:40:51,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:51,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146483236] [2022-04-15 06:40:51,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146483236] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:51,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:51,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:40:51,335 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:40:51,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1829145379] [2022-04-15 06:40:51,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1829145379] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:51,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:51,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:40:51,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159682421] [2022-04-15 06:40:51,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:40:51,337 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 06:40:51,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:40:51,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:51,350 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-15 06:40:51,351 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:40:51,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:51,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:40:51,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:40:51,352 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:51,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:51,547 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-15 06:40:51,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:40:51,548 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 06:40:51,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:40:51,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:51,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-15 06:40:51,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:51,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-15 06:40:51,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2022-04-15 06:40:51,586 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-15 06:40:51,587 INFO L225 Difference]: With dead ends: 35 [2022-04-15 06:40:51,587 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 06:40:51,587 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:40:51,588 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:40:51,588 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:40:51,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 06:40:51,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-15 06:40:51,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:40:51,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:51,606 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:51,606 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:51,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:51,607 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-04-15 06:40:51,608 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-15 06:40:51,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:51,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:51,608 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 06:40:51,608 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 06:40:51,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:51,609 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-04-15 06:40:51,609 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-15 06:40:51,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:51,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:51,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:40:51,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:40:51,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:51,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-04-15 06:40:51,611 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 19 [2022-04-15 06:40:51,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:40:51,611 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-04-15 06:40:51,611 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:51,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 32 transitions. [2022-04-15 06:40:51,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:51,648 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-15 06:40:51,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 06:40:51,648 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:51,649 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:40:51,649 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 06:40:51,649 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:51,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:51,649 INFO L85 PathProgramCache]: Analyzing trace with hash -528072081, now seen corresponding path program 1 times [2022-04-15 06:40:51,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:51,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1840610065] [2022-04-15 06:40:51,870 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-15 06:40:51,872 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:40:51,875 INFO L85 PathProgramCache]: Analyzing trace with hash -659710514, now seen corresponding path program 1 times [2022-04-15 06:40:51,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:51,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527794710] [2022-04-15 06:40:51,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:51,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:51,887 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-15 06:40:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:51,924 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-15 06:40:52,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:52,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {1183#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1175#true} is VALID [2022-04-15 06:40:52,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {1175#true} assume true; {1175#true} is VALID [2022-04-15 06:40:52,035 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1175#true} {1175#true} #83#return; {1175#true} is VALID [2022-04-15 06:40:52,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {1175#true} call ULTIMATE.init(); {1183#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:52,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {1183#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1175#true} is VALID [2022-04-15 06:40:52,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {1175#true} assume true; {1175#true} is VALID [2022-04-15 06:40:52,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1175#true} {1175#true} #83#return; {1175#true} is VALID [2022-04-15 06:40:52,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {1175#true} call #t~ret15 := main(); {1175#true} is VALID [2022-04-15 06:40:52,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {1175#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1175#true} is VALID [2022-04-15 06:40:52,038 INFO L290 TraceCheckUtils]: 6: Hoare triple {1175#true} [91] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_26 v_main_~x~0_25)) (.cse2 (= v_main_~y~0_24 v_main_~y~0_23)) (.cse3 (= |v_main_#t~post6_9| |v_main_#t~post6_8|)) (.cse4 (= |v_main_#t~post5_9| |v_main_#t~post5_8|)) (.cse0 (mod v_main_~x~0_26 4294967296))) (or (and (= v_main_~y~0_23 (+ v_main_~x~0_26 v_main_~y~0_24 (* (- 1) v_main_~x~0_25))) (forall ((v_it_3 Int)) (or (< 0 (mod (+ v_main_~x~0_26 (* v_it_3 4294967295)) 4294967296)) (not (<= 1 v_it_3)) (not (<= (+ v_main_~x~0_25 v_it_3 1) v_main_~x~0_26)))) (< 0 .cse0) (< v_main_~x~0_25 v_main_~x~0_26)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)))) InVars {main_~y~0=v_main_~y~0_24, main_#t~post5=|v_main_#t~post5_9|, main_~x~0=v_main_~x~0_26, main_#t~post6=|v_main_#t~post6_9|} OutVars{main_~y~0=v_main_~y~0_23, main_#t~post5=|v_main_#t~post5_8|, main_~x~0=v_main_~x~0_25, main_#t~post6=|v_main_#t~post6_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1175#true} is VALID [2022-04-15 06:40:52,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {1175#true} [90] 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[] {1175#true} is VALID [2022-04-15 06:40:52,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {1175#true} ~z~0 := ~y~0; {1180#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:40:52,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {1180#(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; {1181#(and (or (not (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296))) (<= main_~y~0 (+ main_~z~0 1))) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:40:52,040 INFO L290 TraceCheckUtils]: 10: Hoare triple {1181#(and (or (not (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296))) (<= main_~y~0 (+ main_~z~0 1))) (<= (+ main_~z~0 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {1182#(and (not (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296))) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-15 06:40:52,041 INFO L290 TraceCheckUtils]: 11: Hoare triple {1182#(and (not (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296))) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~y~0))} assume !(~y~0 % 4294967296 > 0); {1176#false} is VALID [2022-04-15 06:40:52,041 INFO L290 TraceCheckUtils]: 12: Hoare triple {1176#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; {1176#false} is VALID [2022-04-15 06:40:52,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {1176#false} assume !(~x~0 % 4294967296 > 0); {1176#false} is VALID [2022-04-15 06:40:52,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {1176#false} assume !(~z~0 % 4294967296 > 0); {1176#false} is VALID [2022-04-15 06:40:52,041 INFO L272 TraceCheckUtils]: 15: Hoare triple {1176#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1176#false} is VALID [2022-04-15 06:40:52,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {1176#false} ~cond := #in~cond; {1176#false} is VALID [2022-04-15 06:40:52,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {1176#false} assume 0 == ~cond; {1176#false} is VALID [2022-04-15 06:40:52,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {1176#false} assume !false; {1176#false} is VALID [2022-04-15 06:40:52,042 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-15 06:40:52,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:52,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527794710] [2022-04-15 06:40:52,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527794710] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:40:52,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668055821] [2022-04-15 06:40:52,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:52,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:40:52,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:40:52,047 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-15 06:40:52,069 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-15 06:40:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:52,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:40:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:52,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:40:52,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {1175#true} call ULTIMATE.init(); {1175#true} is VALID [2022-04-15 06:40:52,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {1175#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1175#true} is VALID [2022-04-15 06:40:52,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {1175#true} assume true; {1175#true} is VALID [2022-04-15 06:40:52,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1175#true} {1175#true} #83#return; {1175#true} is VALID [2022-04-15 06:40:52,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {1175#true} call #t~ret15 := main(); {1175#true} is VALID [2022-04-15 06:40:52,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {1175#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1175#true} is VALID [2022-04-15 06:40:52,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {1175#true} [91] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_26 v_main_~x~0_25)) (.cse2 (= v_main_~y~0_24 v_main_~y~0_23)) (.cse3 (= |v_main_#t~post6_9| |v_main_#t~post6_8|)) (.cse4 (= |v_main_#t~post5_9| |v_main_#t~post5_8|)) (.cse0 (mod v_main_~x~0_26 4294967296))) (or (and (= v_main_~y~0_23 (+ v_main_~x~0_26 v_main_~y~0_24 (* (- 1) v_main_~x~0_25))) (forall ((v_it_3 Int)) (or (< 0 (mod (+ v_main_~x~0_26 (* v_it_3 4294967295)) 4294967296)) (not (<= 1 v_it_3)) (not (<= (+ v_main_~x~0_25 v_it_3 1) v_main_~x~0_26)))) (< 0 .cse0) (< v_main_~x~0_25 v_main_~x~0_26)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)))) InVars {main_~y~0=v_main_~y~0_24, main_#t~post5=|v_main_#t~post5_9|, main_~x~0=v_main_~x~0_26, main_#t~post6=|v_main_#t~post6_9|} OutVars{main_~y~0=v_main_~y~0_23, main_#t~post5=|v_main_#t~post5_8|, main_~x~0=v_main_~x~0_25, main_#t~post6=|v_main_#t~post6_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1175#true} is VALID [2022-04-15 06:40:52,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {1175#true} [90] 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[] {1175#true} is VALID [2022-04-15 06:40:52,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {1175#true} ~z~0 := ~y~0; {1180#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:40:52,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {1180#(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; {1214#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} is VALID [2022-04-15 06:40:52,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {1214#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {1214#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} is VALID [2022-04-15 06:40:52,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {1214#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {1176#false} is VALID [2022-04-15 06:40:52,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {1176#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; {1176#false} is VALID [2022-04-15 06:40:52,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {1176#false} assume !(~x~0 % 4294967296 > 0); {1176#false} is VALID [2022-04-15 06:40:52,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {1176#false} assume !(~z~0 % 4294967296 > 0); {1176#false} is VALID [2022-04-15 06:40:52,843 INFO L272 TraceCheckUtils]: 15: Hoare triple {1176#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1176#false} is VALID [2022-04-15 06:40:52,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {1176#false} ~cond := #in~cond; {1176#false} is VALID [2022-04-15 06:40:52,843 INFO L290 TraceCheckUtils]: 17: Hoare triple {1176#false} assume 0 == ~cond; {1176#false} is VALID [2022-04-15 06:40:52,843 INFO L290 TraceCheckUtils]: 18: Hoare triple {1176#false} assume !false; {1176#false} is VALID [2022-04-15 06:40:52,843 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-15 06:40:52,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:40:53,332 INFO L290 TraceCheckUtils]: 18: Hoare triple {1176#false} assume !false; {1176#false} is VALID [2022-04-15 06:40:53,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {1176#false} assume 0 == ~cond; {1176#false} is VALID [2022-04-15 06:40:53,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {1176#false} ~cond := #in~cond; {1176#false} is VALID [2022-04-15 06:40:53,333 INFO L272 TraceCheckUtils]: 15: Hoare triple {1176#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1176#false} is VALID [2022-04-15 06:40:53,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {1176#false} assume !(~z~0 % 4294967296 > 0); {1176#false} is VALID [2022-04-15 06:40:53,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {1176#false} assume !(~x~0 % 4294967296 > 0); {1176#false} is VALID [2022-04-15 06:40:53,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {1176#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; {1176#false} is VALID [2022-04-15 06:40:53,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {1214#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {1176#false} is VALID [2022-04-15 06:40:53,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {1214#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {1214#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} is VALID [2022-04-15 06:40:53,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {1269#(or (not (< 0 (mod main_~z~0 4294967296))) (< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~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; {1214#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} is VALID [2022-04-15 06:40:53,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {1175#true} ~z~0 := ~y~0; {1269#(or (not (< 0 (mod main_~z~0 4294967296))) (< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1)))} is VALID [2022-04-15 06:40:53,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {1175#true} [90] 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[] {1175#true} is VALID [2022-04-15 06:40:53,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {1175#true} [91] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_26 v_main_~x~0_25)) (.cse2 (= v_main_~y~0_24 v_main_~y~0_23)) (.cse3 (= |v_main_#t~post6_9| |v_main_#t~post6_8|)) (.cse4 (= |v_main_#t~post5_9| |v_main_#t~post5_8|)) (.cse0 (mod v_main_~x~0_26 4294967296))) (or (and (= v_main_~y~0_23 (+ v_main_~x~0_26 v_main_~y~0_24 (* (- 1) v_main_~x~0_25))) (forall ((v_it_3 Int)) (or (< 0 (mod (+ v_main_~x~0_26 (* v_it_3 4294967295)) 4294967296)) (not (<= 1 v_it_3)) (not (<= (+ v_main_~x~0_25 v_it_3 1) v_main_~x~0_26)))) (< 0 .cse0) (< v_main_~x~0_25 v_main_~x~0_26)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)))) InVars {main_~y~0=v_main_~y~0_24, main_#t~post5=|v_main_#t~post5_9|, main_~x~0=v_main_~x~0_26, main_#t~post6=|v_main_#t~post6_9|} OutVars{main_~y~0=v_main_~y~0_23, main_#t~post5=|v_main_#t~post5_8|, main_~x~0=v_main_~x~0_25, main_#t~post6=|v_main_#t~post6_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1175#true} is VALID [2022-04-15 06:40:53,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {1175#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1175#true} is VALID [2022-04-15 06:40:53,337 INFO L272 TraceCheckUtils]: 4: Hoare triple {1175#true} call #t~ret15 := main(); {1175#true} is VALID [2022-04-15 06:40:53,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1175#true} {1175#true} #83#return; {1175#true} is VALID [2022-04-15 06:40:53,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {1175#true} assume true; {1175#true} is VALID [2022-04-15 06:40:53,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {1175#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1175#true} is VALID [2022-04-15 06:40:53,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {1175#true} call ULTIMATE.init(); {1175#true} is VALID [2022-04-15 06:40:53,338 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-15 06:40:53,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668055821] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 06:40:53,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 06:40:53,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2022-04-15 06:40:53,367 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:40:53,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1840610065] [2022-04-15 06:40:53,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1840610065] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:53,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:53,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:40:53,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426675495] [2022-04-15 06:40:53,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:40:53,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 06:40:53,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:40:53,369 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), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:53,389 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-15 06:40:53,389 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 06:40:53,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:53,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 06:40:53,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:40:53,390 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:53,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:53,519 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-15 06:40:53,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 06:40:53,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 06:40:53,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:40:53,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:53,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-04-15 06:40:53,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:53,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-04-15 06:40:53,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 34 transitions. [2022-04-15 06:40:53,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:53,554 INFO L225 Difference]: With dead ends: 30 [2022-04-15 06:40:53,554 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 06:40:53,554 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-15 06:40:53,555 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:40:53,555 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 39 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:40:53,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 06:40:53,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-15 06:40:53,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:40:53,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:53,574 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:53,574 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:53,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:53,575 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-15 06:40:53,575 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-15 06:40:53,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:53,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:53,575 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 06:40:53,575 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 06:40:53,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:53,576 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-15 06:40:53,576 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-15 06:40:53,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:53,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:53,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:40:53,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:40:53,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:53,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-04-15 06:40:53,577 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 19 [2022-04-15 06:40:53,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:40:53,578 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-04-15 06:40:53,578 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:53,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 27 transitions. [2022-04-15 06:40:53,610 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-15 06:40:53,610 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-15 06:40:53,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 06:40:53,610 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:53,610 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:40:53,630 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-15 06:40:53,811 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:40:53,811 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:53,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:53,812 INFO L85 PathProgramCache]: Analyzing trace with hash 342490275, now seen corresponding path program 1 times [2022-04-15 06:40:53,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:53,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2044652192] [2022-04-15 06:40:54,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-15 06:40:54,156 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:40:54,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1041257116, now seen corresponding path program 1 times [2022-04-15 06:40:54,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:54,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177688675] [2022-04-15 06:40:54,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:54,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:54,167 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-15 06:40:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:54,201 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-15 06:40:54,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:54,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {1457#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1450#true} is VALID [2022-04-15 06:40:54,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {1450#true} assume true; {1450#true} is VALID [2022-04-15 06:40:54,243 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1450#true} {1450#true} #83#return; {1450#true} is VALID [2022-04-15 06:40:54,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {1450#true} call ULTIMATE.init(); {1457#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:54,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {1457#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1450#true} is VALID [2022-04-15 06:40:54,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {1450#true} assume true; {1450#true} is VALID [2022-04-15 06:40:54,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1450#true} {1450#true} #83#return; {1450#true} is VALID [2022-04-15 06:40:54,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {1450#true} call #t~ret15 := main(); {1450#true} is VALID [2022-04-15 06:40:54,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {1450#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1450#true} is VALID [2022-04-15 06:40:54,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {1450#true} [93] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse1 (= v_main_~x~0_35 v_main_~x~0_34)) (.cse2 (= |v_main_#t~post5_14| |v_main_#t~post5_13|)) (.cse3 (= v_main_~y~0_32 v_main_~y~0_31)) (.cse4 (mod v_main_~x~0_35 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3) (and (forall ((v_it_4 Int)) (or (not (<= 1 v_it_4)) (not (<= (+ v_main_~x~0_34 v_it_4 1) v_main_~x~0_35)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_35) 4294967296)))) (< 0 .cse4) (= v_main_~y~0_31 (+ v_main_~x~0_35 v_main_~y~0_32 (* (- 1) v_main_~x~0_34))) (< v_main_~x~0_34 v_main_~x~0_35)))) InVars {main_~y~0=v_main_~y~0_32, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_35, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_31, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_34, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1450#true} is VALID [2022-04-15 06:40:54,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {1450#true} [92] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1455#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:54,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {1455#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1455#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:54,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {1455#(<= 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; {1456#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:40:54,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {1456#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1456#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:40:54,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {1456#(<= (+ (* 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; {1456#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:40:54,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {1456#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1456#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:40:54,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {1456#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1451#false} is VALID [2022-04-15 06:40:54,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {1451#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1451#false} is VALID [2022-04-15 06:40:54,249 INFO L290 TraceCheckUtils]: 15: Hoare triple {1451#false} assume !(~z~0 % 4294967296 > 0); {1451#false} is VALID [2022-04-15 06:40:54,249 INFO L272 TraceCheckUtils]: 16: Hoare triple {1451#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1451#false} is VALID [2022-04-15 06:40:54,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {1451#false} ~cond := #in~cond; {1451#false} is VALID [2022-04-15 06:40:54,249 INFO L290 TraceCheckUtils]: 18: Hoare triple {1451#false} assume 0 == ~cond; {1451#false} is VALID [2022-04-15 06:40:54,249 INFO L290 TraceCheckUtils]: 19: Hoare triple {1451#false} assume !false; {1451#false} is VALID [2022-04-15 06:40:54,250 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-15 06:40:54,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:54,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177688675] [2022-04-15 06:40:54,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177688675] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:40:54,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467190343] [2022-04-15 06:40:54,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:54,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:40:54,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:40:54,251 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-15 06:40:54,253 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-15 06:40:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:54,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:40:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:54,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:40:54,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {1450#true} call ULTIMATE.init(); {1450#true} is VALID [2022-04-15 06:40:54,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {1450#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1450#true} is VALID [2022-04-15 06:40:54,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {1450#true} assume true; {1450#true} is VALID [2022-04-15 06:40:54,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1450#true} {1450#true} #83#return; {1450#true} is VALID [2022-04-15 06:40:54,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {1450#true} call #t~ret15 := main(); {1450#true} is VALID [2022-04-15 06:40:54,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {1450#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1450#true} is VALID [2022-04-15 06:40:54,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {1450#true} [93] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse1 (= v_main_~x~0_35 v_main_~x~0_34)) (.cse2 (= |v_main_#t~post5_14| |v_main_#t~post5_13|)) (.cse3 (= v_main_~y~0_32 v_main_~y~0_31)) (.cse4 (mod v_main_~x~0_35 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3) (and (forall ((v_it_4 Int)) (or (not (<= 1 v_it_4)) (not (<= (+ v_main_~x~0_34 v_it_4 1) v_main_~x~0_35)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_35) 4294967296)))) (< 0 .cse4) (= v_main_~y~0_31 (+ v_main_~x~0_35 v_main_~y~0_32 (* (- 1) v_main_~x~0_34))) (< v_main_~x~0_34 v_main_~x~0_35)))) InVars {main_~y~0=v_main_~y~0_32, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_35, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_31, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_34, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1450#true} is VALID [2022-04-15 06:40:54,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {1450#true} [92] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1455#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:54,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {1455#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1455#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:54,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {1455#(<= 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; {1488#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:40:54,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {1488#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {1488#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:40:54,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {1488#(<= 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; {1488#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:40:54,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {1488#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {1488#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:40:54,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {1488#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~x~0 % 4294967296 > 0); {1451#false} is VALID [2022-04-15 06:40:54,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {1451#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1451#false} is VALID [2022-04-15 06:40:54,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {1451#false} assume !(~z~0 % 4294967296 > 0); {1451#false} is VALID [2022-04-15 06:40:54,603 INFO L272 TraceCheckUtils]: 16: Hoare triple {1451#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1451#false} is VALID [2022-04-15 06:40:54,603 INFO L290 TraceCheckUtils]: 17: Hoare triple {1451#false} ~cond := #in~cond; {1451#false} is VALID [2022-04-15 06:40:54,603 INFO L290 TraceCheckUtils]: 18: Hoare triple {1451#false} assume 0 == ~cond; {1451#false} is VALID [2022-04-15 06:40:54,603 INFO L290 TraceCheckUtils]: 19: Hoare triple {1451#false} assume !false; {1451#false} is VALID [2022-04-15 06:40:54,603 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-15 06:40:54,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:40:54,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {1451#false} assume !false; {1451#false} is VALID [2022-04-15 06:40:54,832 INFO L290 TraceCheckUtils]: 18: Hoare triple {1451#false} assume 0 == ~cond; {1451#false} is VALID [2022-04-15 06:40:54,832 INFO L290 TraceCheckUtils]: 17: Hoare triple {1451#false} ~cond := #in~cond; {1451#false} is VALID [2022-04-15 06:40:54,832 INFO L272 TraceCheckUtils]: 16: Hoare triple {1451#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1451#false} is VALID [2022-04-15 06:40:54,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {1451#false} assume !(~z~0 % 4294967296 > 0); {1451#false} is VALID [2022-04-15 06:40:54,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {1451#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1451#false} is VALID [2022-04-15 06:40:54,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {1456#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1451#false} is VALID [2022-04-15 06:40:54,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {1456#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1456#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:40:54,834 INFO L290 TraceCheckUtils]: 11: Hoare triple {1456#(<= (+ (* 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; {1456#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:40:54,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {1456#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1456#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:40:54,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {1549#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1456#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:40:54,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {1549#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {1549#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-15 06:40:54,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {1450#true} [92] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1549#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-15 06:40:54,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {1450#true} [93] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse1 (= v_main_~x~0_35 v_main_~x~0_34)) (.cse2 (= |v_main_#t~post5_14| |v_main_#t~post5_13|)) (.cse3 (= v_main_~y~0_32 v_main_~y~0_31)) (.cse4 (mod v_main_~x~0_35 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3) (and (forall ((v_it_4 Int)) (or (not (<= 1 v_it_4)) (not (<= (+ v_main_~x~0_34 v_it_4 1) v_main_~x~0_35)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_35) 4294967296)))) (< 0 .cse4) (= v_main_~y~0_31 (+ v_main_~x~0_35 v_main_~y~0_32 (* (- 1) v_main_~x~0_34))) (< v_main_~x~0_34 v_main_~x~0_35)))) InVars {main_~y~0=v_main_~y~0_32, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_35, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_31, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_34, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1450#true} is VALID [2022-04-15 06:40:54,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {1450#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1450#true} is VALID [2022-04-15 06:40:54,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {1450#true} call #t~ret15 := main(); {1450#true} is VALID [2022-04-15 06:40:54,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1450#true} {1450#true} #83#return; {1450#true} is VALID [2022-04-15 06:40:54,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {1450#true} assume true; {1450#true} is VALID [2022-04-15 06:40:54,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {1450#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1450#true} is VALID [2022-04-15 06:40:54,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {1450#true} call ULTIMATE.init(); {1450#true} is VALID [2022-04-15 06:40:54,838 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-15 06:40:54,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467190343] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:40:54,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:40:54,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-15 06:40:54,915 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:40:54,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2044652192] [2022-04-15 06:40:54,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2044652192] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:54,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:54,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:40:54,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142431345] [2022-04-15 06:40:54,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:40:54,916 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-15 06:40:54,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:40:54,916 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-15 06:40:54,935 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-15 06:40:54,936 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:40:54,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:54,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:40:54,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:40:54,936 INFO L87 Difference]: Start difference. First operand 22 states and 27 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-15 06:40:55,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:55,159 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2022-04-15 06:40:55,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:40:55,160 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-15 06:40:55,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:40:55,160 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-15 06:40:55,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-04-15 06:40:55,161 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-15 06:40:55,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-04-15 06:40:55,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 43 transitions. [2022-04-15 06:40:55,211 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-15 06:40:55,212 INFO L225 Difference]: With dead ends: 37 [2022-04-15 06:40:55,212 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 06:40:55,213 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-15 06:40:55,213 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 32 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:40:55,213 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 29 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:40:55,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 06:40:55,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-04-15 06:40:55,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:40:55,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:55,248 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:55,249 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:55,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:55,250 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-04-15 06:40:55,250 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-04-15 06:40:55,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:55,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:55,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-15 06:40:55,251 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-15 06:40:55,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:55,253 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-04-15 06:40:55,253 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-04-15 06:40:55,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:55,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:55,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:40:55,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:40:55,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:55,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-04-15 06:40:55,254 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 20 [2022-04-15 06:40:55,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:40:55,254 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-04-15 06:40:55,255 INFO L479 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-15 06:40:55,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 35 transitions. [2022-04-15 06:40:55,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:55,302 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-04-15 06:40:55,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 06:40:55,302 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:55,303 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:40:55,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 06:40:55,503 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-15 06:40:55,503 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:55,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:55,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1745318674, now seen corresponding path program 1 times [2022-04-15 06:40:55,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:55,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1393684665] [2022-04-15 06:40:55,746 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-15 06:40:55,752 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:40:55,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1236351981, now seen corresponding path program 1 times [2022-04-15 06:40:55,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:55,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151276820] [2022-04-15 06:40:55,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:55,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:55,769 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-15 06:40:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:55,797 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:40:55,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:55,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {1782#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1775#true} is VALID [2022-04-15 06:40:55,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-15 06:40:55,854 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1775#true} {1775#true} #83#return; {1775#true} is VALID [2022-04-15 06:40:55,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {1775#true} call ULTIMATE.init(); {1782#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:55,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {1782#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1775#true} is VALID [2022-04-15 06:40:55,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-15 06:40:55,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1775#true} {1775#true} #83#return; {1775#true} is VALID [2022-04-15 06:40:55,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {1775#true} call #t~ret15 := main(); {1775#true} is VALID [2022-04-15 06:40:55,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {1775#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1775#true} is VALID [2022-04-15 06:40:55,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {1775#true} [95] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_41 v_main_~y~0_40)) (.cse4 (mod v_main_~x~0_44 4294967296)) (.cse1 (= v_main_~x~0_44 v_main_~x~0_43)) (.cse2 (= |v_main_#t~post6_19| |v_main_#t~post6_18|)) (.cse3 (= |v_main_#t~post5_19| |v_main_#t~post5_18|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= v_main_~x~0_43 (+ v_main_~x~0_44 v_main_~y~0_41 (* (- 1) v_main_~y~0_40))) (forall ((v_it_5 Int)) (or (< 0 (mod (+ v_main_~x~0_44 (* v_it_5 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_41 v_it_5 1) v_main_~y~0_40)) (not (<= 1 v_it_5)))) (< 0 .cse4) (< v_main_~y~0_41 v_main_~y~0_40)) (and .cse0 (<= .cse4 0) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_41, main_#t~post5=|v_main_#t~post5_19|, main_~x~0=v_main_~x~0_44, main_#t~post6=|v_main_#t~post6_19|} OutVars{main_~y~0=v_main_~y~0_40, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_43, main_#t~post6=|v_main_#t~post6_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1775#true} is VALID [2022-04-15 06:40:55,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {1775#true} [94] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1775#true} is VALID [2022-04-15 06:40:55,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {1775#true} ~z~0 := ~y~0; {1775#true} is VALID [2022-04-15 06:40:55,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {1775#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; {1780#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:55,870 INFO L290 TraceCheckUtils]: 10: Hoare triple {1780#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1780#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:55,871 INFO L290 TraceCheckUtils]: 11: Hoare triple {1780#(<= 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; {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:40:55,871 INFO L290 TraceCheckUtils]: 12: Hoare triple {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:40:55,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {1781#(<= (+ (* (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; {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:40:55,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:40:55,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {1776#false} is VALID [2022-04-15 06:40:55,873 INFO L272 TraceCheckUtils]: 16: Hoare triple {1776#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1776#false} is VALID [2022-04-15 06:40:55,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {1776#false} ~cond := #in~cond; {1776#false} is VALID [2022-04-15 06:40:55,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {1776#false} assume 0 == ~cond; {1776#false} is VALID [2022-04-15 06:40:55,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {1776#false} assume !false; {1776#false} is VALID [2022-04-15 06:40:55,873 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-15 06:40:55,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:55,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151276820] [2022-04-15 06:40:55,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151276820] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:40:55,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553149512] [2022-04-15 06:40:55,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:55,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:40:55,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:40:55,875 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-15 06:40:55,891 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-15 06:40:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:55,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:40:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:55,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:40:56,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {1775#true} call ULTIMATE.init(); {1775#true} is VALID [2022-04-15 06:40:56,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {1775#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1775#true} is VALID [2022-04-15 06:40:56,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-15 06:40:56,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1775#true} {1775#true} #83#return; {1775#true} is VALID [2022-04-15 06:40:56,199 INFO L272 TraceCheckUtils]: 4: Hoare triple {1775#true} call #t~ret15 := main(); {1775#true} is VALID [2022-04-15 06:40:56,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {1775#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1775#true} is VALID [2022-04-15 06:40:56,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {1775#true} [95] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_41 v_main_~y~0_40)) (.cse4 (mod v_main_~x~0_44 4294967296)) (.cse1 (= v_main_~x~0_44 v_main_~x~0_43)) (.cse2 (= |v_main_#t~post6_19| |v_main_#t~post6_18|)) (.cse3 (= |v_main_#t~post5_19| |v_main_#t~post5_18|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= v_main_~x~0_43 (+ v_main_~x~0_44 v_main_~y~0_41 (* (- 1) v_main_~y~0_40))) (forall ((v_it_5 Int)) (or (< 0 (mod (+ v_main_~x~0_44 (* v_it_5 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_41 v_it_5 1) v_main_~y~0_40)) (not (<= 1 v_it_5)))) (< 0 .cse4) (< v_main_~y~0_41 v_main_~y~0_40)) (and .cse0 (<= .cse4 0) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_41, main_#t~post5=|v_main_#t~post5_19|, main_~x~0=v_main_~x~0_44, main_#t~post6=|v_main_#t~post6_19|} OutVars{main_~y~0=v_main_~y~0_40, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_43, main_#t~post6=|v_main_#t~post6_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1775#true} is VALID [2022-04-15 06:40:56,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {1775#true} [94] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1775#true} is VALID [2022-04-15 06:40:56,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {1775#true} ~z~0 := ~y~0; {1775#true} is VALID [2022-04-15 06:40:56,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {1775#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; {1780#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:56,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {1780#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1780#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:56,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {1780#(<= 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; {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:40:56,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:40:56,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {1781#(<= (+ (* (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; {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:40:56,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:40:56,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {1776#false} is VALID [2022-04-15 06:40:56,204 INFO L272 TraceCheckUtils]: 16: Hoare triple {1776#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1776#false} is VALID [2022-04-15 06:40:56,205 INFO L290 TraceCheckUtils]: 17: Hoare triple {1776#false} ~cond := #in~cond; {1776#false} is VALID [2022-04-15 06:40:56,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {1776#false} assume 0 == ~cond; {1776#false} is VALID [2022-04-15 06:40:56,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {1776#false} assume !false; {1776#false} is VALID [2022-04-15 06:40:56,205 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-15 06:40:56,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:40:56,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {1776#false} assume !false; {1776#false} is VALID [2022-04-15 06:40:56,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {1776#false} assume 0 == ~cond; {1776#false} is VALID [2022-04-15 06:40:56,288 INFO L290 TraceCheckUtils]: 17: Hoare triple {1776#false} ~cond := #in~cond; {1776#false} is VALID [2022-04-15 06:40:56,288 INFO L272 TraceCheckUtils]: 16: Hoare triple {1776#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1776#false} is VALID [2022-04-15 06:40:56,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {1776#false} is VALID [2022-04-15 06:40:56,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:40:56,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {1781#(<= (+ (* (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; {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:40:56,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:40:56,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {1780#(<= 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; {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:40:56,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {1780#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1780#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:56,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {1775#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; {1780#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:56,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {1775#true} ~z~0 := ~y~0; {1775#true} is VALID [2022-04-15 06:40:56,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {1775#true} [94] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1775#true} is VALID [2022-04-15 06:40:56,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {1775#true} [95] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_41 v_main_~y~0_40)) (.cse4 (mod v_main_~x~0_44 4294967296)) (.cse1 (= v_main_~x~0_44 v_main_~x~0_43)) (.cse2 (= |v_main_#t~post6_19| |v_main_#t~post6_18|)) (.cse3 (= |v_main_#t~post5_19| |v_main_#t~post5_18|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= v_main_~x~0_43 (+ v_main_~x~0_44 v_main_~y~0_41 (* (- 1) v_main_~y~0_40))) (forall ((v_it_5 Int)) (or (< 0 (mod (+ v_main_~x~0_44 (* v_it_5 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_41 v_it_5 1) v_main_~y~0_40)) (not (<= 1 v_it_5)))) (< 0 .cse4) (< v_main_~y~0_41 v_main_~y~0_40)) (and .cse0 (<= .cse4 0) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_41, main_#t~post5=|v_main_#t~post5_19|, main_~x~0=v_main_~x~0_44, main_#t~post6=|v_main_#t~post6_19|} OutVars{main_~y~0=v_main_~y~0_40, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_43, main_#t~post6=|v_main_#t~post6_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1775#true} is VALID [2022-04-15 06:40:56,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {1775#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1775#true} is VALID [2022-04-15 06:40:56,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {1775#true} call #t~ret15 := main(); {1775#true} is VALID [2022-04-15 06:40:56,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1775#true} {1775#true} #83#return; {1775#true} is VALID [2022-04-15 06:40:56,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-15 06:40:56,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {1775#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1775#true} is VALID [2022-04-15 06:40:56,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {1775#true} call ULTIMATE.init(); {1775#true} is VALID [2022-04-15 06:40:56,295 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-15 06:40:56,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553149512] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:40:56,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:40:56,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-15 06:40:56,356 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:40:56,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1393684665] [2022-04-15 06:40:56,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1393684665] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:56,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:56,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:40:56,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108907279] [2022-04-15 06:40:56,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:40:56,357 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-15 06:40:56,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:40:56,358 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-15 06:40:56,374 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-15 06:40:56,374 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:40:56,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:56,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:40:56,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:40:56,375 INFO L87 Difference]: Start difference. First operand 27 states and 35 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-15 06:40:56,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:56,652 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-15 06:40:56,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:40:56,652 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-15 06:40:56,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:40:56,652 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-15 06:40:56,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-15 06:40:56,654 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-15 06:40:56,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-15 06:40:56,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2022-04-15 06:40:56,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:56,703 INFO L225 Difference]: With dead ends: 40 [2022-04-15 06:40:56,703 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 06:40:56,704 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-15 06:40:56,704 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:40:56,704 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 31 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:40:56,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 06:40:56,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-04-15 06:40:56,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:40:56,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:56,743 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:56,743 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:56,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:56,744 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2022-04-15 06:40:56,744 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2022-04-15 06:40:56,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:56,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:56,744 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 06:40:56,745 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 06:40:56,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:56,746 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2022-04-15 06:40:56,746 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2022-04-15 06:40:56,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:56,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:56,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:40:56,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:40:56,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:56,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2022-04-15 06:40:56,747 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 20 [2022-04-15 06:40:56,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:40:56,748 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2022-04-15 06:40:56,748 INFO L479 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-15 06:40:56,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 42 transitions. [2022-04-15 06:40:56,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:56,813 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2022-04-15 06:40:56,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 06:40:56,814 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:56,814 INFO L499 BasicCegarLoop]: 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-15 06:40:56,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 06:40:57,014 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:40:57,015 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:57,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:57,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1695200847, now seen corresponding path program 1 times [2022-04-15 06:40:57,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:57,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [373607373] [2022-04-15 06:40:57,237 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:40:57,240 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:40:57,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1928691568, now seen corresponding path program 1 times [2022-04-15 06:40:57,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:57,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658164521] [2022-04-15 06:40:57,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:57,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:57,258 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-15 06:40:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:57,272 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:40:57,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:57,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {2138#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2126#true} is VALID [2022-04-15 06:40:57,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {2126#true} assume true; {2126#true} is VALID [2022-04-15 06:40:57,381 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2126#true} {2126#true} #83#return; {2126#true} is VALID [2022-04-15 06:40:57,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {2126#true} call ULTIMATE.init(); {2138#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:57,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {2138#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2126#true} is VALID [2022-04-15 06:40:57,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {2126#true} assume true; {2126#true} is VALID [2022-04-15 06:40:57,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2126#true} {2126#true} #83#return; {2126#true} is VALID [2022-04-15 06:40:57,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {2126#true} call #t~ret15 := main(); {2126#true} is VALID [2022-04-15 06:40:57,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {2126#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2126#true} is VALID [2022-04-15 06:40:57,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {2126#true} [97] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_53 v_main_~x~0_52)) (.cse2 (= v_main_~y~0_50 v_main_~y~0_49)) (.cse0 (mod v_main_~x~0_53 4294967296)) (.cse3 (= |v_main_#t~post5_24| |v_main_#t~post5_23|)) (.cse4 (= |v_main_#t~post6_24| |v_main_#t~post6_23|))) (or (and (< 0 .cse0) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~y~0_50 v_it_6 1) v_main_~y~0_49)) (< 0 (mod (+ v_main_~x~0_53 (* v_it_6 4294967295)) 4294967296)) (not (<= 1 v_it_6)))) (< v_main_~y~0_50 v_main_~y~0_49) (= (+ v_main_~x~0_53 v_main_~y~0_50 (* (- 1) v_main_~y~0_49)) v_main_~x~0_52)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_50, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_53, main_#t~post6=|v_main_#t~post6_24|} OutVars{main_~y~0=v_main_~y~0_49, main_#t~post5=|v_main_#t~post5_23|, main_~x~0=v_main_~x~0_52, main_#t~post6=|v_main_#t~post6_23|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2126#true} is VALID [2022-04-15 06:40:57,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {2126#true} [96] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2126#true} is VALID [2022-04-15 06:40:57,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {2126#true} ~z~0 := ~y~0; {2131#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:40:57,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {2131#(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; {2132#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:40:57,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {2132#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {2133#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 1)) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-15 06:40:57,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {2133#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 1)) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2134#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:40:57,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {2134#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {2134#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:40:57,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {2134#(<= 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; {2135#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:40:57,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {2135#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !(~x~0 % 4294967296 > 0); {2135#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:40:57,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {2135#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2134#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:40:57,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {2134#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2134#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:40:57,389 INFO L272 TraceCheckUtils]: 17: Hoare triple {2134#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2136#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:40:57,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {2136#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2137#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:40:57,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {2137#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2127#false} is VALID [2022-04-15 06:40:57,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {2127#false} assume !false; {2127#false} is VALID [2022-04-15 06:40:57,390 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-15 06:40:57,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:57,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658164521] [2022-04-15 06:40:57,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658164521] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:40:57,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583940724] [2022-04-15 06:40:57,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:57,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:40:57,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:40:57,392 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-15 06:40:57,422 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-15 06:40:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:57,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 06:40:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:57,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:40:57,683 INFO L272 TraceCheckUtils]: 0: Hoare triple {2126#true} call ULTIMATE.init(); {2126#true} is VALID [2022-04-15 06:40:57,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {2126#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2126#true} is VALID [2022-04-15 06:40:57,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {2126#true} assume true; {2126#true} is VALID [2022-04-15 06:40:57,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2126#true} {2126#true} #83#return; {2126#true} is VALID [2022-04-15 06:40:57,684 INFO L272 TraceCheckUtils]: 4: Hoare triple {2126#true} call #t~ret15 := main(); {2126#true} is VALID [2022-04-15 06:40:57,684 INFO L290 TraceCheckUtils]: 5: Hoare triple {2126#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2126#true} is VALID [2022-04-15 06:40:57,684 INFO L290 TraceCheckUtils]: 6: Hoare triple {2126#true} [97] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_53 v_main_~x~0_52)) (.cse2 (= v_main_~y~0_50 v_main_~y~0_49)) (.cse0 (mod v_main_~x~0_53 4294967296)) (.cse3 (= |v_main_#t~post5_24| |v_main_#t~post5_23|)) (.cse4 (= |v_main_#t~post6_24| |v_main_#t~post6_23|))) (or (and (< 0 .cse0) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~y~0_50 v_it_6 1) v_main_~y~0_49)) (< 0 (mod (+ v_main_~x~0_53 (* v_it_6 4294967295)) 4294967296)) (not (<= 1 v_it_6)))) (< v_main_~y~0_50 v_main_~y~0_49) (= (+ v_main_~x~0_53 v_main_~y~0_50 (* (- 1) v_main_~y~0_49)) v_main_~x~0_52)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_50, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_53, main_#t~post6=|v_main_#t~post6_24|} OutVars{main_~y~0=v_main_~y~0_49, main_#t~post5=|v_main_#t~post5_23|, main_~x~0=v_main_~x~0_52, main_#t~post6=|v_main_#t~post6_23|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2126#true} is VALID [2022-04-15 06:40:57,684 INFO L290 TraceCheckUtils]: 7: Hoare triple {2126#true} [96] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2126#true} is VALID [2022-04-15 06:40:57,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {2126#true} ~z~0 := ~y~0; {2131#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:40:57,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {2131#(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; {2126#true} is VALID [2022-04-15 06:40:57,692 INFO L290 TraceCheckUtils]: 10: Hoare triple {2126#true} assume !(~z~0 % 4294967296 > 0); {2126#true} is VALID [2022-04-15 06:40:57,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {2126#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; {2126#true} is VALID [2022-04-15 06:40:57,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {2126#true} assume !(~y~0 % 4294967296 > 0); {2134#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:40:57,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {2134#(<= 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; {2135#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:40:57,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {2135#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !(~x~0 % 4294967296 > 0); {2135#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:40:57,696 INFO L290 TraceCheckUtils]: 15: Hoare triple {2135#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2134#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:40:57,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {2134#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2134#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:40:57,697 INFO L272 TraceCheckUtils]: 17: Hoare triple {2134#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2193#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:40:57,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {2193#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2197#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:40:57,698 INFO L290 TraceCheckUtils]: 19: Hoare triple {2197#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2127#false} is VALID [2022-04-15 06:40:57,699 INFO L290 TraceCheckUtils]: 20: Hoare triple {2127#false} assume !false; {2127#false} is VALID [2022-04-15 06:40:57,699 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-15 06:40:57,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:40:57,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {2127#false} assume !false; {2127#false} is VALID [2022-04-15 06:40:57,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {2197#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2127#false} is VALID [2022-04-15 06:40:57,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {2193#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2197#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:40:57,825 INFO L272 TraceCheckUtils]: 17: Hoare triple {2134#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2193#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:40:57,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {2134#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2134#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:40:57,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {2135#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2134#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:40:57,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {2135#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !(~x~0 % 4294967296 > 0); {2135#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:40:57,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {2134#(<= 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; {2135#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:40:57,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {2126#true} assume !(~y~0 % 4294967296 > 0); {2134#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:40:57,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {2126#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; {2126#true} is VALID [2022-04-15 06:40:57,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {2126#true} assume !(~z~0 % 4294967296 > 0); {2126#true} is VALID [2022-04-15 06:40:57,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {2126#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; {2126#true} is VALID [2022-04-15 06:40:57,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {2126#true} ~z~0 := ~y~0; {2126#true} is VALID [2022-04-15 06:40:57,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {2126#true} [96] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2126#true} is VALID [2022-04-15 06:40:57,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {2126#true} [97] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_53 v_main_~x~0_52)) (.cse2 (= v_main_~y~0_50 v_main_~y~0_49)) (.cse0 (mod v_main_~x~0_53 4294967296)) (.cse3 (= |v_main_#t~post5_24| |v_main_#t~post5_23|)) (.cse4 (= |v_main_#t~post6_24| |v_main_#t~post6_23|))) (or (and (< 0 .cse0) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~y~0_50 v_it_6 1) v_main_~y~0_49)) (< 0 (mod (+ v_main_~x~0_53 (* v_it_6 4294967295)) 4294967296)) (not (<= 1 v_it_6)))) (< v_main_~y~0_50 v_main_~y~0_49) (= (+ v_main_~x~0_53 v_main_~y~0_50 (* (- 1) v_main_~y~0_49)) v_main_~x~0_52)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_50, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_53, main_#t~post6=|v_main_#t~post6_24|} OutVars{main_~y~0=v_main_~y~0_49, main_#t~post5=|v_main_#t~post5_23|, main_~x~0=v_main_~x~0_52, main_#t~post6=|v_main_#t~post6_23|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2126#true} is VALID [2022-04-15 06:40:57,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {2126#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2126#true} is VALID [2022-04-15 06:40:57,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {2126#true} call #t~ret15 := main(); {2126#true} is VALID [2022-04-15 06:40:57,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2126#true} {2126#true} #83#return; {2126#true} is VALID [2022-04-15 06:40:57,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {2126#true} assume true; {2126#true} is VALID [2022-04-15 06:40:57,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {2126#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2126#true} is VALID [2022-04-15 06:40:57,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {2126#true} call ULTIMATE.init(); {2126#true} is VALID [2022-04-15 06:40:57,831 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-15 06:40:57,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583940724] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:40:57,831 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:40:57,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 6] total 12 [2022-04-15 06:40:57,860 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:40:57,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [373607373] [2022-04-15 06:40:57,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [373607373] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:57,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:57,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 06:40:57,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698482261] [2022-04-15 06:40:57,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:40:57,861 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 06:40:57,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:40:57,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:57,879 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-15 06:40:57,879 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 06:40:57,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:57,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 06:40:57,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-04-15 06:40:57,880 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:58,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:58,533 INFO L93 Difference]: Finished difference Result 68 states and 96 transitions. [2022-04-15 06:40:58,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 06:40:58,534 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 06:40:58,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:40:58,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:58,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-04-15 06:40:58,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:58,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-04-15 06:40:58,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 58 transitions. [2022-04-15 06:40:58,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:58,599 INFO L225 Difference]: With dead ends: 68 [2022-04-15 06:40:58,599 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 06:40:58,600 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2022-04-15 06:40:58,600 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:40:58,601 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 50 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:40:58,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 06:40:58,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-04-15 06:40:58,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:40:58,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 42 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 37 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:58,684 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 42 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 37 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:58,684 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 42 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 37 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:58,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:58,685 INFO L93 Difference]: Finished difference Result 45 states and 61 transitions. [2022-04-15 06:40:58,685 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2022-04-15 06:40:58,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:58,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:58,686 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 37 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-15 06:40:58,686 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 37 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-15 06:40:58,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:58,687 INFO L93 Difference]: Finished difference Result 45 states and 61 transitions. [2022-04-15 06:40:58,687 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2022-04-15 06:40:58,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:58,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:58,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:40:58,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:40:58,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 37 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:58,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2022-04-15 06:40:58,689 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 21 [2022-04-15 06:40:58,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:40:58,689 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2022-04-15 06:40:58,689 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:58,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 58 transitions. [2022-04-15 06:40:58,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:58,789 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2022-04-15 06:40:58,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 06:40:58,790 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:58,790 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:40:58,815 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-15 06:40:58,990 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:40:58,990 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:58,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:58,991 INFO L85 PathProgramCache]: Analyzing trace with hash -977123598, now seen corresponding path program 2 times [2022-04-15 06:40:58,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:58,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [292062787] [2022-04-15 06:40:59,205 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-15 06:40:59,207 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:40:59,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1926333389, now seen corresponding path program 1 times [2022-04-15 06:40:59,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:59,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064660629] [2022-04-15 06:40:59,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:59,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:59,226 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-15 06:40:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:59,259 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_7.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:40:59,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:59,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {2611#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2600#true} is VALID [2022-04-15 06:40:59,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {2600#true} assume true; {2600#true} is VALID [2022-04-15 06:40:59,425 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2600#true} {2600#true} #83#return; {2600#true} is VALID [2022-04-15 06:40:59,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {2600#true} call ULTIMATE.init(); {2611#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:59,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {2611#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2600#true} is VALID [2022-04-15 06:40:59,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {2600#true} assume true; {2600#true} is VALID [2022-04-15 06:40:59,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2600#true} {2600#true} #83#return; {2600#true} is VALID [2022-04-15 06:40:59,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {2600#true} call #t~ret15 := main(); {2600#true} is VALID [2022-04-15 06:40:59,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {2600#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2605#(= main_~y~0 0)} is VALID [2022-04-15 06:40:59,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {2605#(= main_~y~0 0)} [99] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_61 v_main_~x~0_60)) (.cse0 (mod v_main_~x~0_61 4294967296)) (.cse2 (= v_main_~y~0_62 v_main_~y~0_61)) (.cse3 (= |v_main_#t~post5_29| |v_main_#t~post5_28|))) (or (and (= v_main_~x~0_60 (+ v_main_~x~0_61 v_main_~y~0_62 (* (- 1) v_main_~y~0_61))) (forall ((v_it_7 Int)) (or (< 0 (mod (+ v_main_~x~0_61 (* v_it_7 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_62 v_it_7 1) v_main_~y~0_61)) (not (<= 1 v_it_7)))) (< 0 .cse0) (< v_main_~y~0_62 v_main_~y~0_61)) (and (= |v_main_#t~post6_29| |v_main_#t~post6_28|) .cse1 .cse2 .cse3) (and (= |v_main_#t~post6_28| |v_main_#t~post6_29|) .cse1 (<= .cse0 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_62, main_#t~post5=|v_main_#t~post5_29|, main_~x~0=v_main_~x~0_61, main_#t~post6=|v_main_#t~post6_29|} OutVars{main_~y~0=v_main_~y~0_61, main_#t~post5=|v_main_#t~post5_28|, main_~x~0=v_main_~x~0_60, main_#t~post6=|v_main_#t~post6_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2606#(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-15 06:40:59,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {2606#(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)))} [98] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2607#(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-15 06:40:59,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {2607#(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; {2608#(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-15 06:40:59,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {2608#(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; {2600#true} is VALID [2022-04-15 06:40:59,439 INFO L290 TraceCheckUtils]: 10: Hoare triple {2600#true} assume !(~z~0 % 4294967296 > 0); {2609#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0)} is VALID [2022-04-15 06:40:59,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {2609#(<= (* (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; {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:40:59,440 INFO L290 TraceCheckUtils]: 12: Hoare triple {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:40:59,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {2610#(<= (+ (* (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; {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:40:59,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:40:59,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2609#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0)} is VALID [2022-04-15 06:40:59,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {2609#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2601#false} is VALID [2022-04-15 06:40:59,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {2601#false} assume !(~z~0 % 4294967296 > 0); {2601#false} is VALID [2022-04-15 06:40:59,443 INFO L272 TraceCheckUtils]: 18: Hoare triple {2601#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2601#false} is VALID [2022-04-15 06:40:59,443 INFO L290 TraceCheckUtils]: 19: Hoare triple {2601#false} ~cond := #in~cond; {2601#false} is VALID [2022-04-15 06:40:59,443 INFO L290 TraceCheckUtils]: 20: Hoare triple {2601#false} assume 0 == ~cond; {2601#false} is VALID [2022-04-15 06:40:59,443 INFO L290 TraceCheckUtils]: 21: Hoare triple {2601#false} assume !false; {2601#false} is VALID [2022-04-15 06:40:59,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:40:59,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:59,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064660629] [2022-04-15 06:40:59,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064660629] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:40:59,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740438689] [2022-04-15 06:40:59,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:59,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:40:59,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:40:59,446 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-15 06:40:59,447 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-15 06:40:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:59,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 06:40:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:59,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:40:59,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {2600#true} call ULTIMATE.init(); {2600#true} is VALID [2022-04-15 06:40:59,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {2600#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2600#true} is VALID [2022-04-15 06:40:59,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {2600#true} assume true; {2600#true} is VALID [2022-04-15 06:40:59,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2600#true} {2600#true} #83#return; {2600#true} is VALID [2022-04-15 06:40:59,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {2600#true} call #t~ret15 := main(); {2600#true} is VALID [2022-04-15 06:40:59,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {2600#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2600#true} is VALID [2022-04-15 06:40:59,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {2600#true} [99] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_61 v_main_~x~0_60)) (.cse0 (mod v_main_~x~0_61 4294967296)) (.cse2 (= v_main_~y~0_62 v_main_~y~0_61)) (.cse3 (= |v_main_#t~post5_29| |v_main_#t~post5_28|))) (or (and (= v_main_~x~0_60 (+ v_main_~x~0_61 v_main_~y~0_62 (* (- 1) v_main_~y~0_61))) (forall ((v_it_7 Int)) (or (< 0 (mod (+ v_main_~x~0_61 (* v_it_7 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_62 v_it_7 1) v_main_~y~0_61)) (not (<= 1 v_it_7)))) (< 0 .cse0) (< v_main_~y~0_62 v_main_~y~0_61)) (and (= |v_main_#t~post6_29| |v_main_#t~post6_28|) .cse1 .cse2 .cse3) (and (= |v_main_#t~post6_28| |v_main_#t~post6_29|) .cse1 (<= .cse0 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_62, main_#t~post5=|v_main_#t~post5_29|, main_~x~0=v_main_~x~0_61, main_#t~post6=|v_main_#t~post6_29|} OutVars{main_~y~0=v_main_~y~0_61, main_#t~post5=|v_main_#t~post5_28|, main_~x~0=v_main_~x~0_60, main_#t~post6=|v_main_#t~post6_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2600#true} is VALID [2022-04-15 06:40:59,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {2600#true} [98] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2600#true} is VALID [2022-04-15 06:40:59,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {2600#true} ~z~0 := ~y~0; {2639#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:40:59,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {2639#(= 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; {2643#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:40:59,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {2643#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {2643#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:40:59,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {2643#(= 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; {2650#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-15 06:40:59,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {2650#(= main_~z~0 (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:40:59,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {2610#(<= (+ (* (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; {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:40:59,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:40:59,747 INFO L290 TraceCheckUtils]: 15: Hoare triple {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2609#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0)} is VALID [2022-04-15 06:40:59,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {2609#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2601#false} is VALID [2022-04-15 06:40:59,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {2601#false} assume !(~z~0 % 4294967296 > 0); {2601#false} is VALID [2022-04-15 06:40:59,748 INFO L272 TraceCheckUtils]: 18: Hoare triple {2601#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2601#false} is VALID [2022-04-15 06:40:59,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {2601#false} ~cond := #in~cond; {2601#false} is VALID [2022-04-15 06:40:59,748 INFO L290 TraceCheckUtils]: 20: Hoare triple {2601#false} assume 0 == ~cond; {2601#false} is VALID [2022-04-15 06:40:59,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {2601#false} assume !false; {2601#false} is VALID [2022-04-15 06:40:59,749 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:40:59,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:41:00,102 INFO L290 TraceCheckUtils]: 21: Hoare triple {2601#false} assume !false; {2601#false} is VALID [2022-04-15 06:41:00,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {2601#false} assume 0 == ~cond; {2601#false} is VALID [2022-04-15 06:41:00,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {2601#false} ~cond := #in~cond; {2601#false} is VALID [2022-04-15 06:41:00,102 INFO L272 TraceCheckUtils]: 18: Hoare triple {2601#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2601#false} is VALID [2022-04-15 06:41:00,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {2601#false} assume !(~z~0 % 4294967296 > 0); {2601#false} is VALID [2022-04-15 06:41:00,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {2609#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2601#false} is VALID [2022-04-15 06:41:00,106 INFO L290 TraceCheckUtils]: 15: Hoare triple {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2609#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0)} is VALID [2022-04-15 06:41:00,106 INFO L290 TraceCheckUtils]: 14: Hoare triple {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:41:00,107 INFO L290 TraceCheckUtils]: 13: Hoare triple {2610#(<= (+ (* (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; {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:41:00,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {2708#(or (<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:41:00,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {2712#(or (<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0) (< 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; {2708#(or (<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:41:00,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {2712#(or (<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2712#(or (<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:41:00,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {2719#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2712#(or (<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:41:00,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {2600#true} ~z~0 := ~y~0; {2719#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0))} is VALID [2022-04-15 06:41:00,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {2600#true} [98] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2600#true} is VALID [2022-04-15 06:41:00,110 INFO L290 TraceCheckUtils]: 6: Hoare triple {2600#true} [99] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_61 v_main_~x~0_60)) (.cse0 (mod v_main_~x~0_61 4294967296)) (.cse2 (= v_main_~y~0_62 v_main_~y~0_61)) (.cse3 (= |v_main_#t~post5_29| |v_main_#t~post5_28|))) (or (and (= v_main_~x~0_60 (+ v_main_~x~0_61 v_main_~y~0_62 (* (- 1) v_main_~y~0_61))) (forall ((v_it_7 Int)) (or (< 0 (mod (+ v_main_~x~0_61 (* v_it_7 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_62 v_it_7 1) v_main_~y~0_61)) (not (<= 1 v_it_7)))) (< 0 .cse0) (< v_main_~y~0_62 v_main_~y~0_61)) (and (= |v_main_#t~post6_29| |v_main_#t~post6_28|) .cse1 .cse2 .cse3) (and (= |v_main_#t~post6_28| |v_main_#t~post6_29|) .cse1 (<= .cse0 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_62, main_#t~post5=|v_main_#t~post5_29|, main_~x~0=v_main_~x~0_61, main_#t~post6=|v_main_#t~post6_29|} OutVars{main_~y~0=v_main_~y~0_61, main_#t~post5=|v_main_#t~post5_28|, main_~x~0=v_main_~x~0_60, main_#t~post6=|v_main_#t~post6_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2600#true} is VALID [2022-04-15 06:41:00,110 INFO L290 TraceCheckUtils]: 5: Hoare triple {2600#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2600#true} is VALID [2022-04-15 06:41:00,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {2600#true} call #t~ret15 := main(); {2600#true} is VALID [2022-04-15 06:41:00,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2600#true} {2600#true} #83#return; {2600#true} is VALID [2022-04-15 06:41:00,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {2600#true} assume true; {2600#true} is VALID [2022-04-15 06:41:00,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {2600#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2600#true} is VALID [2022-04-15 06:41:00,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {2600#true} call ULTIMATE.init(); {2600#true} is VALID [2022-04-15 06:41:00,111 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:41:00,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740438689] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:41:00,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:41:00,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2022-04-15 06:41:00,697 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:00,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [292062787] [2022-04-15 06:41:00,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [292062787] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:00,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:00,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:41:00,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157486102] [2022-04-15 06:41:00,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:00,698 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-15 06:41:00,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:00,698 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-15 06:41:00,757 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-15 06:41:00,757 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 06:41:00,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:00,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 06:41:00,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-15 06:41:00,758 INFO L87 Difference]: Start difference. First operand 42 states and 58 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-15 06:41:01,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:01,421 INFO L93 Difference]: Finished difference Result 61 states and 85 transitions. [2022-04-15 06:41:01,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 06:41:01,421 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-15 06:41:01,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:01,422 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-15 06:41:01,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 44 transitions. [2022-04-15 06:41:01,423 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-15 06:41:01,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 44 transitions. [2022-04-15 06:41:01,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 44 transitions. [2022-04-15 06:41:01,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:01,605 INFO L225 Difference]: With dead ends: 61 [2022-04-15 06:41:01,605 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 06:41:01,606 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2022-04-15 06:41:01,606 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 27 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:01,606 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 42 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 65 Invalid, 0 Unknown, 24 Unchecked, 0.1s Time] [2022-04-15 06:41:01,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 06:41:01,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2022-04-15 06:41:01,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:01,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 43 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:01,739 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 43 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:01,739 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 43 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:01,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:01,740 INFO L93 Difference]: Finished difference Result 53 states and 75 transitions. [2022-04-15 06:41:01,740 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2022-04-15 06:41:01,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:01,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:01,741 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 3 states have call successors, (3), 3 states 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-15 06:41:01,741 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 3 states have call successors, (3), 3 states 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-15 06:41:01,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:01,742 INFO L93 Difference]: Finished difference Result 53 states and 75 transitions. [2022-04-15 06:41:01,742 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2022-04-15 06:41:01,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:01,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:01,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:01,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:01,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:01,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2022-04-15 06:41:01,744 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 22 [2022-04-15 06:41:01,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:01,744 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2022-04-15 06:41:01,744 INFO L479 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-15 06:41:01,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 58 transitions. [2022-04-15 06:41:04,247 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-15 06:41:04,247 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2022-04-15 06:41:04,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 06:41:04,248 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:04,248 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:41:04,264 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-15 06:41:04,451 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-15 06:41:04,452 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:04,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:04,452 INFO L85 PathProgramCache]: Analyzing trace with hash -439116189, now seen corresponding path program 3 times [2022-04-15 06:41:04,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:04,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [155410953] [2022-04-15 06:41:04,665 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-15 06:41:04,667 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:41:04,670 INFO L85 PathProgramCache]: Analyzing trace with hash 605709284, now seen corresponding path program 1 times [2022-04-15 06:41:04,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:04,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169780309] [2022-04-15 06:41:04,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:04,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:04,683 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-15 06:41:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:04,703 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-15 06:41:04,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:04,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {3089#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3082#true} is VALID [2022-04-15 06:41:04,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {3082#true} assume true; {3082#true} is VALID [2022-04-15 06:41:04,754 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3082#true} {3082#true} #83#return; {3082#true} is VALID [2022-04-15 06:41:04,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {3082#true} call ULTIMATE.init(); {3089#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:04,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {3089#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3082#true} is VALID [2022-04-15 06:41:04,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {3082#true} assume true; {3082#true} is VALID [2022-04-15 06:41:04,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3082#true} {3082#true} #83#return; {3082#true} is VALID [2022-04-15 06:41:04,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {3082#true} call #t~ret15 := main(); {3082#true} is VALID [2022-04-15 06:41:04,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {3082#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3082#true} is VALID [2022-04-15 06:41:04,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {3082#true} [101] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_70 4294967296)) (.cse1 (= v_main_~y~0_75 v_main_~y~0_74)) (.cse2 (= |v_main_#t~post5_34| |v_main_#t~post5_33|)) (.cse3 (= |v_main_#t~post6_34| |v_main_#t~post6_33|))) (or (and (< 0 .cse0) (forall ((v_it_8 Int)) (or (not (<= (+ v_main_~x~0_69 v_it_8 1) v_main_~x~0_70)) (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_70) 4294967296)) (not (<= 1 v_it_8)))) (< v_main_~x~0_69 v_main_~x~0_70) (= v_main_~y~0_74 (+ v_main_~x~0_70 v_main_~y~0_75 (* (- 1) v_main_~x~0_69)))) (and (= v_main_~x~0_70 v_main_~x~0_69) .cse1 .cse2 .cse3) (and (<= .cse0 0) (= v_main_~x~0_69 v_main_~x~0_70) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_75, main_#t~post5=|v_main_#t~post5_34|, main_~x~0=v_main_~x~0_70, main_#t~post6=|v_main_#t~post6_34|} OutVars{main_~y~0=v_main_~y~0_74, main_#t~post5=|v_main_#t~post5_33|, main_~x~0=v_main_~x~0_69, main_#t~post6=|v_main_#t~post6_33|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3082#true} is VALID [2022-04-15 06:41:04,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {3082#true} [100] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3087#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:04,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {3087#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3087#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:04,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {3087#(<= 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; {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:04,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:04,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {3088#(<= 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; {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:04,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:04,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {3088#(<= 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; {3087#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:04,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {3087#(<= 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; {3083#false} is VALID [2022-04-15 06:41:04,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {3083#false} assume !(~x~0 % 4294967296 > 0); {3083#false} is VALID [2022-04-15 06:41:04,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {3083#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3083#false} is VALID [2022-04-15 06:41:04,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {3083#false} assume !(~z~0 % 4294967296 > 0); {3083#false} is VALID [2022-04-15 06:41:04,761 INFO L272 TraceCheckUtils]: 18: Hoare triple {3083#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3083#false} is VALID [2022-04-15 06:41:04,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {3083#false} ~cond := #in~cond; {3083#false} is VALID [2022-04-15 06:41:04,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {3083#false} assume 0 == ~cond; {3083#false} is VALID [2022-04-15 06:41:04,761 INFO L290 TraceCheckUtils]: 21: Hoare triple {3083#false} assume !false; {3083#false} is VALID [2022-04-15 06:41:04,761 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-15 06:41:04,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:04,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169780309] [2022-04-15 06:41:04,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169780309] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:41:04,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790671570] [2022-04-15 06:41:04,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:04,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:41:04,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:41:04,764 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-15 06:41:04,791 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-15 06:41:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:04,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:41:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:04,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:41:05,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {3082#true} call ULTIMATE.init(); {3082#true} is VALID [2022-04-15 06:41:05,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {3082#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3082#true} is VALID [2022-04-15 06:41:05,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {3082#true} assume true; {3082#true} is VALID [2022-04-15 06:41:05,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3082#true} {3082#true} #83#return; {3082#true} is VALID [2022-04-15 06:41:05,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {3082#true} call #t~ret15 := main(); {3082#true} is VALID [2022-04-15 06:41:05,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {3082#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3082#true} is VALID [2022-04-15 06:41:05,021 INFO L290 TraceCheckUtils]: 6: Hoare triple {3082#true} [101] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_70 4294967296)) (.cse1 (= v_main_~y~0_75 v_main_~y~0_74)) (.cse2 (= |v_main_#t~post5_34| |v_main_#t~post5_33|)) (.cse3 (= |v_main_#t~post6_34| |v_main_#t~post6_33|))) (or (and (< 0 .cse0) (forall ((v_it_8 Int)) (or (not (<= (+ v_main_~x~0_69 v_it_8 1) v_main_~x~0_70)) (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_70) 4294967296)) (not (<= 1 v_it_8)))) (< v_main_~x~0_69 v_main_~x~0_70) (= v_main_~y~0_74 (+ v_main_~x~0_70 v_main_~y~0_75 (* (- 1) v_main_~x~0_69)))) (and (= v_main_~x~0_70 v_main_~x~0_69) .cse1 .cse2 .cse3) (and (<= .cse0 0) (= v_main_~x~0_69 v_main_~x~0_70) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_75, main_#t~post5=|v_main_#t~post5_34|, main_~x~0=v_main_~x~0_70, main_#t~post6=|v_main_#t~post6_34|} OutVars{main_~y~0=v_main_~y~0_74, main_#t~post5=|v_main_#t~post5_33|, main_~x~0=v_main_~x~0_69, main_#t~post6=|v_main_#t~post6_33|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3082#true} is VALID [2022-04-15 06:41:05,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {3082#true} [100] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3087#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:05,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {3087#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3087#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:05,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {3087#(<= 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; {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:05,025 INFO L290 TraceCheckUtils]: 10: Hoare triple {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:05,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {3088#(<= 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; {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:05,025 INFO L290 TraceCheckUtils]: 12: Hoare triple {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:05,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {3088#(<= 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; {3087#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:05,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {3087#(<= 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; {3083#false} is VALID [2022-04-15 06:41:05,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {3083#false} assume !(~x~0 % 4294967296 > 0); {3083#false} is VALID [2022-04-15 06:41:05,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {3083#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3083#false} is VALID [2022-04-15 06:41:05,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {3083#false} assume !(~z~0 % 4294967296 > 0); {3083#false} is VALID [2022-04-15 06:41:05,027 INFO L272 TraceCheckUtils]: 18: Hoare triple {3083#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3083#false} is VALID [2022-04-15 06:41:05,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {3083#false} ~cond := #in~cond; {3083#false} is VALID [2022-04-15 06:41:05,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {3083#false} assume 0 == ~cond; {3083#false} is VALID [2022-04-15 06:41:05,027 INFO L290 TraceCheckUtils]: 21: Hoare triple {3083#false} assume !false; {3083#false} is VALID [2022-04-15 06:41:05,028 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-15 06:41:05,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:41:05,237 INFO L290 TraceCheckUtils]: 21: Hoare triple {3083#false} assume !false; {3083#false} is VALID [2022-04-15 06:41:05,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {3083#false} assume 0 == ~cond; {3083#false} is VALID [2022-04-15 06:41:05,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {3083#false} ~cond := #in~cond; {3083#false} is VALID [2022-04-15 06:41:05,237 INFO L272 TraceCheckUtils]: 18: Hoare triple {3083#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3083#false} is VALID [2022-04-15 06:41:05,237 INFO L290 TraceCheckUtils]: 17: Hoare triple {3083#false} assume !(~z~0 % 4294967296 > 0); {3083#false} is VALID [2022-04-15 06:41:05,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {3083#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3083#false} is VALID [2022-04-15 06:41:05,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {3083#false} assume !(~x~0 % 4294967296 > 0); {3083#false} is VALID [2022-04-15 06:41:05,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {3087#(<= 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; {3083#false} is VALID [2022-04-15 06:41:05,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {3088#(<= 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; {3087#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:05,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:05,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {3088#(<= 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; {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:05,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:05,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {3087#(<= 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; {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:05,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {3087#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3087#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:05,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {3082#true} [100] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3087#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:05,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {3082#true} [101] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_70 4294967296)) (.cse1 (= v_main_~y~0_75 v_main_~y~0_74)) (.cse2 (= |v_main_#t~post5_34| |v_main_#t~post5_33|)) (.cse3 (= |v_main_#t~post6_34| |v_main_#t~post6_33|))) (or (and (< 0 .cse0) (forall ((v_it_8 Int)) (or (not (<= (+ v_main_~x~0_69 v_it_8 1) v_main_~x~0_70)) (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_70) 4294967296)) (not (<= 1 v_it_8)))) (< v_main_~x~0_69 v_main_~x~0_70) (= v_main_~y~0_74 (+ v_main_~x~0_70 v_main_~y~0_75 (* (- 1) v_main_~x~0_69)))) (and (= v_main_~x~0_70 v_main_~x~0_69) .cse1 .cse2 .cse3) (and (<= .cse0 0) (= v_main_~x~0_69 v_main_~x~0_70) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_75, main_#t~post5=|v_main_#t~post5_34|, main_~x~0=v_main_~x~0_70, main_#t~post6=|v_main_#t~post6_34|} OutVars{main_~y~0=v_main_~y~0_74, main_#t~post5=|v_main_#t~post5_33|, main_~x~0=v_main_~x~0_69, main_#t~post6=|v_main_#t~post6_33|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3082#true} is VALID [2022-04-15 06:41:05,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {3082#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3082#true} is VALID [2022-04-15 06:41:05,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {3082#true} call #t~ret15 := main(); {3082#true} is VALID [2022-04-15 06:41:05,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3082#true} {3082#true} #83#return; {3082#true} is VALID [2022-04-15 06:41:05,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {3082#true} assume true; {3082#true} is VALID [2022-04-15 06:41:05,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {3082#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3082#true} is VALID [2022-04-15 06:41:05,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {3082#true} call ULTIMATE.init(); {3082#true} is VALID [2022-04-15 06:41:05,244 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-15 06:41:05,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790671570] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:41:05,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:41:05,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-15 06:41:05,319 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:05,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [155410953] [2022-04-15 06:41:05,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [155410953] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:05,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:05,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:41:05,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096705995] [2022-04-15 06:41:05,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:05,320 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 06:41:05,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:05,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:05,339 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-15 06:41:05,339 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:41:05,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:05,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:41:05,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:41:05,340 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:05,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:05,667 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2022-04-15 06:41:05,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:41:05,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 06:41:05,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:05,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:05,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-15 06:41:05,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:05,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-15 06:41:05,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2022-04-15 06:41:05,718 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-15 06:41:05,719 INFO L225 Difference]: With dead ends: 53 [2022-04-15 06:41:05,720 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 06:41:05,720 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 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-15 06:41:05,720 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 31 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:05,721 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 35 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:41:05,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 06:41:05,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-15 06:41:05,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:05,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 33 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:05,838 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 33 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:05,838 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 33 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:05,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:05,839 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2022-04-15 06:41:05,839 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2022-04-15 06:41:05,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:05,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:05,840 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 33 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-15 06:41:05,840 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 33 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-15 06:41:05,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:05,841 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2022-04-15 06:41:05,841 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2022-04-15 06:41:05,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:05,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:05,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:05,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:05,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 33 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:05,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2022-04-15 06:41:05,842 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 22 [2022-04-15 06:41:05,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:05,843 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2022-04-15 06:41:05,843 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:05,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 51 transitions. [2022-04-15 06:41:06,263 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-15 06:41:06,264 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2022-04-15 06:41:06,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 06:41:06,264 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:06,264 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:41:06,291 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-15 06:41:06,465 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:41:06,465 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:06,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:06,465 INFO L85 PathProgramCache]: Analyzing trace with hash -6760208, now seen corresponding path program 2 times [2022-04-15 06:41:06,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:06,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [364159496] [2022-04-15 06:41:09,572 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-15 06:41:09,573 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:41:09,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1316259996, now seen corresponding path program 1 times [2022-04-15 06:41:09,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:09,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857122673] [2022-04-15 06:41:09,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:09,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:09,585 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-15 06:41:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:09,598 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-15 06:41:09,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:09,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {3495#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3486#true} is VALID [2022-04-15 06:41:09,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {3486#true} assume true; {3486#true} is VALID [2022-04-15 06:41:09,674 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3486#true} {3486#true} #83#return; {3486#true} is VALID [2022-04-15 06:41:09,675 INFO L272 TraceCheckUtils]: 0: Hoare triple {3486#true} call ULTIMATE.init(); {3495#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:09,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {3495#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3486#true} is VALID [2022-04-15 06:41:09,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {3486#true} assume true; {3486#true} is VALID [2022-04-15 06:41:09,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3486#true} {3486#true} #83#return; {3486#true} is VALID [2022-04-15 06:41:09,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {3486#true} call #t~ret15 := main(); {3486#true} is VALID [2022-04-15 06:41:09,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {3486#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3486#true} is VALID [2022-04-15 06:41:09,675 INFO L290 TraceCheckUtils]: 6: Hoare triple {3486#true} [103] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_39| |v_main_#t~post6_38|)) (.cse2 (= v_main_~y~0_87 v_main_~y~0_86)) (.cse3 (= v_main_~x~0_83 v_main_~x~0_82)) (.cse0 (mod v_main_~x~0_83 4294967296))) (or (and (= |v_main_#t~post5_38| |v_main_#t~post5_39|) (<= .cse0 0) .cse1 .cse2 .cse3) (and .cse1 .cse2 (= |v_main_#t~post5_39| |v_main_#t~post5_38|) .cse3) (and (= v_main_~x~0_82 (+ v_main_~x~0_83 v_main_~y~0_87 (* (- 1) v_main_~y~0_86))) (< v_main_~y~0_87 v_main_~y~0_86) (< 0 .cse0) (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (not (<= (+ v_main_~y~0_87 v_it_9 1) v_main_~y~0_86)) (< 0 (mod (+ v_main_~x~0_83 (* v_it_9 4294967295)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_87, main_#t~post5=|v_main_#t~post5_39|, main_~x~0=v_main_~x~0_83, main_#t~post6=|v_main_#t~post6_39|} OutVars{main_~y~0=v_main_~y~0_86, main_#t~post5=|v_main_#t~post5_38|, main_~x~0=v_main_~x~0_82, main_#t~post6=|v_main_#t~post6_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3486#true} is VALID [2022-04-15 06:41:09,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {3486#true} [102] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3491#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:09,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {3491#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3491#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:09,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {3491#(<= 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; {3492#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:09,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {3492#(<= 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; {3493#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:09,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {3493#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3493#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:09,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {3493#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3493#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:09,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {3493#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3493#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:09,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {3493#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {3493#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:09,682 INFO L290 TraceCheckUtils]: 15: Hoare triple {3493#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3494#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:41:09,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {3494#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {3487#false} is VALID [2022-04-15 06:41:09,683 INFO L290 TraceCheckUtils]: 17: Hoare triple {3487#false} assume !(~z~0 % 4294967296 > 0); {3487#false} is VALID [2022-04-15 06:41:09,683 INFO L272 TraceCheckUtils]: 18: Hoare triple {3487#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3487#false} is VALID [2022-04-15 06:41:09,683 INFO L290 TraceCheckUtils]: 19: Hoare triple {3487#false} ~cond := #in~cond; {3487#false} is VALID [2022-04-15 06:41:09,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {3487#false} assume 0 == ~cond; {3487#false} is VALID [2022-04-15 06:41:09,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {3487#false} assume !false; {3487#false} is VALID [2022-04-15 06:41:09,683 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 06:41:09,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:09,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857122673] [2022-04-15 06:41:09,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857122673] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:41:09,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422072155] [2022-04-15 06:41:09,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:09,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:41:09,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:41:09,688 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-15 06:41:09,712 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-15 06:41:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:09,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 06:41:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:09,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:41:09,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {3486#true} call ULTIMATE.init(); {3486#true} is VALID [2022-04-15 06:41:09,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {3486#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3486#true} is VALID [2022-04-15 06:41:09,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {3486#true} assume true; {3486#true} is VALID [2022-04-15 06:41:09,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3486#true} {3486#true} #83#return; {3486#true} is VALID [2022-04-15 06:41:09,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {3486#true} call #t~ret15 := main(); {3486#true} is VALID [2022-04-15 06:41:09,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {3486#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3486#true} is VALID [2022-04-15 06:41:09,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {3486#true} [103] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_39| |v_main_#t~post6_38|)) (.cse2 (= v_main_~y~0_87 v_main_~y~0_86)) (.cse3 (= v_main_~x~0_83 v_main_~x~0_82)) (.cse0 (mod v_main_~x~0_83 4294967296))) (or (and (= |v_main_#t~post5_38| |v_main_#t~post5_39|) (<= .cse0 0) .cse1 .cse2 .cse3) (and .cse1 .cse2 (= |v_main_#t~post5_39| |v_main_#t~post5_38|) .cse3) (and (= v_main_~x~0_82 (+ v_main_~x~0_83 v_main_~y~0_87 (* (- 1) v_main_~y~0_86))) (< v_main_~y~0_87 v_main_~y~0_86) (< 0 .cse0) (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (not (<= (+ v_main_~y~0_87 v_it_9 1) v_main_~y~0_86)) (< 0 (mod (+ v_main_~x~0_83 (* v_it_9 4294967295)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_87, main_#t~post5=|v_main_#t~post5_39|, main_~x~0=v_main_~x~0_83, main_#t~post6=|v_main_#t~post6_39|} OutVars{main_~y~0=v_main_~y~0_86, main_#t~post5=|v_main_#t~post5_38|, main_~x~0=v_main_~x~0_82, main_#t~post6=|v_main_#t~post6_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3486#true} is VALID [2022-04-15 06:41:09,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {3486#true} [102] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3486#true} is VALID [2022-04-15 06:41:09,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {3486#true} ~z~0 := ~y~0; {3486#true} is VALID [2022-04-15 06:41:09,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {3486#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; {3526#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:41:09,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {3526#(< 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; {3530#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:41:09,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {3530#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !(~z~0 % 4294967296 > 0); {3530#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:41:09,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {3530#(< 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; {3526#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:41:09,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {3526#(< 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; {3540#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:41:09,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {3540#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {3540#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:41:09,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {3540#(< 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; {3540#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:41:09,857 INFO L290 TraceCheckUtils]: 16: Hoare triple {3540#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {3540#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:41:09,857 INFO L290 TraceCheckUtils]: 17: Hoare triple {3540#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3487#false} is VALID [2022-04-15 06:41:09,857 INFO L272 TraceCheckUtils]: 18: Hoare triple {3487#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3487#false} is VALID [2022-04-15 06:41:09,857 INFO L290 TraceCheckUtils]: 19: Hoare triple {3487#false} ~cond := #in~cond; {3487#false} is VALID [2022-04-15 06:41:09,857 INFO L290 TraceCheckUtils]: 20: Hoare triple {3487#false} assume 0 == ~cond; {3487#false} is VALID [2022-04-15 06:41:09,857 INFO L290 TraceCheckUtils]: 21: Hoare triple {3487#false} assume !false; {3487#false} is VALID [2022-04-15 06:41:09,857 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:41:09,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:41:09,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {3487#false} assume !false; {3487#false} is VALID [2022-04-15 06:41:09,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {3487#false} assume 0 == ~cond; {3487#false} is VALID [2022-04-15 06:41:09,938 INFO L290 TraceCheckUtils]: 19: Hoare triple {3487#false} ~cond := #in~cond; {3487#false} is VALID [2022-04-15 06:41:09,939 INFO L272 TraceCheckUtils]: 18: Hoare triple {3487#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3487#false} is VALID [2022-04-15 06:41:09,939 INFO L290 TraceCheckUtils]: 17: Hoare triple {3540#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3487#false} is VALID [2022-04-15 06:41:09,939 INFO L290 TraceCheckUtils]: 16: Hoare triple {3540#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {3540#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:41:09,940 INFO L290 TraceCheckUtils]: 15: Hoare triple {3540#(< 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; {3540#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:41:09,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {3540#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {3540#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:41:09,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {3526#(< 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; {3540#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:41:09,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {3530#(< 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; {3526#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:41:09,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {3530#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !(~z~0 % 4294967296 > 0); {3530#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:41:09,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {3526#(< 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; {3530#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:41:09,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {3486#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; {3526#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:41:09,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {3486#true} ~z~0 := ~y~0; {3486#true} is VALID [2022-04-15 06:41:09,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {3486#true} [102] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3486#true} is VALID [2022-04-15 06:41:09,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {3486#true} [103] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_39| |v_main_#t~post6_38|)) (.cse2 (= v_main_~y~0_87 v_main_~y~0_86)) (.cse3 (= v_main_~x~0_83 v_main_~x~0_82)) (.cse0 (mod v_main_~x~0_83 4294967296))) (or (and (= |v_main_#t~post5_38| |v_main_#t~post5_39|) (<= .cse0 0) .cse1 .cse2 .cse3) (and .cse1 .cse2 (= |v_main_#t~post5_39| |v_main_#t~post5_38|) .cse3) (and (= v_main_~x~0_82 (+ v_main_~x~0_83 v_main_~y~0_87 (* (- 1) v_main_~y~0_86))) (< v_main_~y~0_87 v_main_~y~0_86) (< 0 .cse0) (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (not (<= (+ v_main_~y~0_87 v_it_9 1) v_main_~y~0_86)) (< 0 (mod (+ v_main_~x~0_83 (* v_it_9 4294967295)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_87, main_#t~post5=|v_main_#t~post5_39|, main_~x~0=v_main_~x~0_83, main_#t~post6=|v_main_#t~post6_39|} OutVars{main_~y~0=v_main_~y~0_86, main_#t~post5=|v_main_#t~post5_38|, main_~x~0=v_main_~x~0_82, main_#t~post6=|v_main_#t~post6_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3486#true} is VALID [2022-04-15 06:41:09,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {3486#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3486#true} is VALID [2022-04-15 06:41:09,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {3486#true} call #t~ret15 := main(); {3486#true} is VALID [2022-04-15 06:41:09,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3486#true} {3486#true} #83#return; {3486#true} is VALID [2022-04-15 06:41:09,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {3486#true} assume true; {3486#true} is VALID [2022-04-15 06:41:09,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {3486#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3486#true} is VALID [2022-04-15 06:41:09,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {3486#true} call ULTIMATE.init(); {3486#true} is VALID [2022-04-15 06:41:09,944 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:41:09,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422072155] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:41:09,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:41:09,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2022-04-15 06:41:10,019 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:10,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [364159496] [2022-04-15 06:41:10,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [364159496] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:10,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:10,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:41:10,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717405858] [2022-04-15 06:41:10,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:10,019 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 23 [2022-04-15 06:41:10,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:10,020 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-15 06:41:10,037 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-15 06:41:10,037 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 06:41:10,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:10,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 06:41:10,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-15 06:41:10,038 INFO L87 Difference]: Start difference. First operand 38 states and 51 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-15 06:41:10,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:10,789 INFO L93 Difference]: Finished difference Result 74 states and 109 transitions. [2022-04-15 06:41:10,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 06:41:10,790 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 23 [2022-04-15 06:41:10,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:10,790 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-15 06:41:10,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-15 06:41:10,791 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-15 06:41:10,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-15 06:41:10,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 64 transitions. [2022-04-15 06:41:10,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:10,880 INFO L225 Difference]: With dead ends: 74 [2022-04-15 06:41:10,880 INFO L226 Difference]: Without dead ends: 62 [2022-04-15 06:41:10,881 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2022-04-15 06:41:10,881 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 63 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:10,881 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 34 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:41:10,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-15 06:41:11,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2022-04-15 06:41:11,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:11,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 50 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 45 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:11,042 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 50 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 45 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:11,042 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 50 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 45 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:11,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:11,043 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2022-04-15 06:41:11,043 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 85 transitions. [2022-04-15 06:41:11,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:11,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:11,044 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 45 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 62 states. [2022-04-15 06:41:11,044 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 45 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 62 states. [2022-04-15 06:41:11,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:11,045 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2022-04-15 06:41:11,045 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 85 transitions. [2022-04-15 06:41:11,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:11,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:11,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:11,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:11,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 45 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:11,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2022-04-15 06:41:11,047 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 23 [2022-04-15 06:41:11,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:11,047 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2022-04-15 06:41:11,047 INFO L479 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-15 06:41:11,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 68 transitions. [2022-04-15 06:41:13,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 67 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:13,611 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-04-15 06:41:13,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 06:41:13,611 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:13,611 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:41:13,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-15 06:41:13,815 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:41:13,815 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:13,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:13,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1804115870, now seen corresponding path program 4 times [2022-04-15 06:41:13,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:13,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1177671772] [2022-04-15 06:41:14,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-15 06:41:14,072 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:41:14,074 INFO L85 PathProgramCache]: Analyzing trace with hash -2058352594, now seen corresponding path program 1 times [2022-04-15 06:41:14,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:14,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95185063] [2022-04-15 06:41:14,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:14,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:14,083 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-15 06:41:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:14,099 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_10.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:41:14,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:14,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {4029#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4020#true} is VALID [2022-04-15 06:41:14,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {4020#true} assume true; {4020#true} is VALID [2022-04-15 06:41:14,181 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4020#true} {4020#true} #83#return; {4020#true} is VALID [2022-04-15 06:41:14,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {4020#true} call ULTIMATE.init(); {4029#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:14,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {4029#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4020#true} is VALID [2022-04-15 06:41:14,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {4020#true} assume true; {4020#true} is VALID [2022-04-15 06:41:14,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4020#true} {4020#true} #83#return; {4020#true} is VALID [2022-04-15 06:41:14,182 INFO L272 TraceCheckUtils]: 4: Hoare triple {4020#true} call #t~ret15 := main(); {4020#true} is VALID [2022-04-15 06:41:14,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {4020#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4020#true} is VALID [2022-04-15 06:41:14,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {4020#true} [105] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_94 4294967296)) (.cse1 (= |v_main_#t~post6_44| |v_main_#t~post6_43|)) (.cse2 (= v_main_~y~0_98 v_main_~y~0_97)) (.cse3 (= |v_main_#t~post5_44| |v_main_#t~post5_43|)) (.cse4 (= v_main_~x~0_94 v_main_~x~0_93))) (or (and (= v_main_~x~0_93 (+ v_main_~x~0_94 v_main_~y~0_98 (* (- 1) v_main_~y~0_97))) (< 0 .cse0) (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (not (<= (+ v_main_~y~0_98 v_it_10 1) v_main_~y~0_97)) (< 0 (mod (+ v_main_~x~0_94 (* 4294967295 v_it_10)) 4294967296)))) (< v_main_~y~0_98 v_main_~y~0_97)) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_98, main_#t~post5=|v_main_#t~post5_44|, main_~x~0=v_main_~x~0_94, main_#t~post6=|v_main_#t~post6_44|} OutVars{main_~y~0=v_main_~y~0_97, main_#t~post5=|v_main_#t~post5_43|, main_~x~0=v_main_~x~0_93, main_#t~post6=|v_main_#t~post6_43|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4020#true} is VALID [2022-04-15 06:41:14,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {4020#true} [104] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4020#true} is VALID [2022-04-15 06:41:14,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {4020#true} ~z~0 := ~y~0; {4025#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:41:14,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {4025#(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; {4026#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:41:14,185 INFO L290 TraceCheckUtils]: 10: Hoare triple {4026#(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; {4027#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:41:14,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {4027#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4027#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:41:14,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {4027#(<= 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; {4028#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:41:14,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {4028#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4021#false} is VALID [2022-04-15 06:41:14,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {4021#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; {4021#false} is VALID [2022-04-15 06:41:14,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {4021#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; {4021#false} is VALID [2022-04-15 06:41:14,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {4021#false} assume !(~x~0 % 4294967296 > 0); {4021#false} is VALID [2022-04-15 06:41:14,187 INFO L290 TraceCheckUtils]: 17: Hoare triple {4021#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4021#false} is VALID [2022-04-15 06:41:14,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {4021#false} assume !(~z~0 % 4294967296 > 0); {4021#false} is VALID [2022-04-15 06:41:14,188 INFO L272 TraceCheckUtils]: 19: Hoare triple {4021#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4021#false} is VALID [2022-04-15 06:41:14,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {4021#false} ~cond := #in~cond; {4021#false} is VALID [2022-04-15 06:41:14,188 INFO L290 TraceCheckUtils]: 21: Hoare triple {4021#false} assume 0 == ~cond; {4021#false} is VALID [2022-04-15 06:41:14,188 INFO L290 TraceCheckUtils]: 22: Hoare triple {4021#false} assume !false; {4021#false} is VALID [2022-04-15 06:41:14,188 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 06:41:14,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:14,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95185063] [2022-04-15 06:41:14,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95185063] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:41:14,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225841666] [2022-04-15 06:41:14,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:14,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:41:14,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:41:14,190 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-15 06:41:14,191 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-15 06:41:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:14,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:41:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:14,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:41:14,654 INFO L272 TraceCheckUtils]: 0: Hoare triple {4020#true} call ULTIMATE.init(); {4020#true} is VALID [2022-04-15 06:41:14,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {4020#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4020#true} is VALID [2022-04-15 06:41:14,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {4020#true} assume true; {4020#true} is VALID [2022-04-15 06:41:14,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4020#true} {4020#true} #83#return; {4020#true} is VALID [2022-04-15 06:41:14,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {4020#true} call #t~ret15 := main(); {4020#true} is VALID [2022-04-15 06:41:14,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {4020#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4020#true} is VALID [2022-04-15 06:41:14,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {4020#true} [105] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_94 4294967296)) (.cse1 (= |v_main_#t~post6_44| |v_main_#t~post6_43|)) (.cse2 (= v_main_~y~0_98 v_main_~y~0_97)) (.cse3 (= |v_main_#t~post5_44| |v_main_#t~post5_43|)) (.cse4 (= v_main_~x~0_94 v_main_~x~0_93))) (or (and (= v_main_~x~0_93 (+ v_main_~x~0_94 v_main_~y~0_98 (* (- 1) v_main_~y~0_97))) (< 0 .cse0) (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (not (<= (+ v_main_~y~0_98 v_it_10 1) v_main_~y~0_97)) (< 0 (mod (+ v_main_~x~0_94 (* 4294967295 v_it_10)) 4294967296)))) (< v_main_~y~0_98 v_main_~y~0_97)) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_98, main_#t~post5=|v_main_#t~post5_44|, main_~x~0=v_main_~x~0_94, main_#t~post6=|v_main_#t~post6_44|} OutVars{main_~y~0=v_main_~y~0_97, main_#t~post5=|v_main_#t~post5_43|, main_~x~0=v_main_~x~0_93, main_#t~post6=|v_main_#t~post6_43|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4020#true} is VALID [2022-04-15 06:41:14,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {4020#true} [104] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4020#true} is VALID [2022-04-15 06:41:14,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {4020#true} ~z~0 := ~y~0; {4025#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:41:14,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {4025#(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; {4026#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:41:14,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {4026#(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; {4027#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:41:14,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {4027#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4027#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:41:14,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {4027#(<= 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; {4028#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:41:14,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {4028#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4021#false} is VALID [2022-04-15 06:41:14,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {4021#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; {4021#false} is VALID [2022-04-15 06:41:14,663 INFO L290 TraceCheckUtils]: 15: Hoare triple {4021#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; {4021#false} is VALID [2022-04-15 06:41:14,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {4021#false} assume !(~x~0 % 4294967296 > 0); {4021#false} is VALID [2022-04-15 06:41:14,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {4021#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4021#false} is VALID [2022-04-15 06:41:14,663 INFO L290 TraceCheckUtils]: 18: Hoare triple {4021#false} assume !(~z~0 % 4294967296 > 0); {4021#false} is VALID [2022-04-15 06:41:14,663 INFO L272 TraceCheckUtils]: 19: Hoare triple {4021#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4021#false} is VALID [2022-04-15 06:41:14,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {4021#false} ~cond := #in~cond; {4021#false} is VALID [2022-04-15 06:41:14,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {4021#false} assume 0 == ~cond; {4021#false} is VALID [2022-04-15 06:41:14,663 INFO L290 TraceCheckUtils]: 22: Hoare triple {4021#false} assume !false; {4021#false} is VALID [2022-04-15 06:41:14,663 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 06:41:14,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:41:14,954 INFO L290 TraceCheckUtils]: 22: Hoare triple {4021#false} assume !false; {4021#false} is VALID [2022-04-15 06:41:14,954 INFO L290 TraceCheckUtils]: 21: Hoare triple {4021#false} assume 0 == ~cond; {4021#false} is VALID [2022-04-15 06:41:14,954 INFO L290 TraceCheckUtils]: 20: Hoare triple {4021#false} ~cond := #in~cond; {4021#false} is VALID [2022-04-15 06:41:14,954 INFO L272 TraceCheckUtils]: 19: Hoare triple {4021#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4021#false} is VALID [2022-04-15 06:41:14,954 INFO L290 TraceCheckUtils]: 18: Hoare triple {4021#false} assume !(~z~0 % 4294967296 > 0); {4021#false} is VALID [2022-04-15 06:41:14,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {4021#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4021#false} is VALID [2022-04-15 06:41:14,955 INFO L290 TraceCheckUtils]: 16: Hoare triple {4021#false} assume !(~x~0 % 4294967296 > 0); {4021#false} is VALID [2022-04-15 06:41:14,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {4021#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; {4021#false} is VALID [2022-04-15 06:41:14,955 INFO L290 TraceCheckUtils]: 14: Hoare triple {4021#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; {4021#false} is VALID [2022-04-15 06:41:14,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {4028#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4021#false} is VALID [2022-04-15 06:41:14,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {4027#(<= 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; {4028#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:41:14,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {4027#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4027#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:41:14,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {4135#(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; {4027#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:41:14,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {4139#(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; {4135#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 06:41:14,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {4020#true} ~z~0 := ~y~0; {4139#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:14,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {4020#true} [104] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4020#true} is VALID [2022-04-15 06:41:14,960 INFO L290 TraceCheckUtils]: 6: Hoare triple {4020#true} [105] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_94 4294967296)) (.cse1 (= |v_main_#t~post6_44| |v_main_#t~post6_43|)) (.cse2 (= v_main_~y~0_98 v_main_~y~0_97)) (.cse3 (= |v_main_#t~post5_44| |v_main_#t~post5_43|)) (.cse4 (= v_main_~x~0_94 v_main_~x~0_93))) (or (and (= v_main_~x~0_93 (+ v_main_~x~0_94 v_main_~y~0_98 (* (- 1) v_main_~y~0_97))) (< 0 .cse0) (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (not (<= (+ v_main_~y~0_98 v_it_10 1) v_main_~y~0_97)) (< 0 (mod (+ v_main_~x~0_94 (* 4294967295 v_it_10)) 4294967296)))) (< v_main_~y~0_98 v_main_~y~0_97)) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_98, main_#t~post5=|v_main_#t~post5_44|, main_~x~0=v_main_~x~0_94, main_#t~post6=|v_main_#t~post6_44|} OutVars{main_~y~0=v_main_~y~0_97, main_#t~post5=|v_main_#t~post5_43|, main_~x~0=v_main_~x~0_93, main_#t~post6=|v_main_#t~post6_43|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4020#true} is VALID [2022-04-15 06:41:14,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {4020#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4020#true} is VALID [2022-04-15 06:41:14,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {4020#true} call #t~ret15 := main(); {4020#true} is VALID [2022-04-15 06:41:14,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4020#true} {4020#true} #83#return; {4020#true} is VALID [2022-04-15 06:41:14,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {4020#true} assume true; {4020#true} is VALID [2022-04-15 06:41:14,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {4020#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4020#true} is VALID [2022-04-15 06:41:14,961 INFO L272 TraceCheckUtils]: 0: Hoare triple {4020#true} call ULTIMATE.init(); {4020#true} is VALID [2022-04-15 06:41:14,961 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 06:41:14,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225841666] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:41:14,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:41:14,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-15 06:41:15,067 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:15,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1177671772] [2022-04-15 06:41:15,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1177671772] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:15,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:15,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:41:15,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351019519] [2022-04-15 06:41:15,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:15,068 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-15 06:41:15,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:15,068 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-15 06:41:15,092 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-15 06:41:15,092 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 06:41:15,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:15,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 06:41:15,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-15 06:41:15,093 INFO L87 Difference]: Start difference. First operand 50 states and 68 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-15 06:41:15,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:15,798 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2022-04-15 06:41:15,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 06:41:15,798 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-15 06:41:15,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:15,799 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-15 06:41:15,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2022-04-15 06:41:15,800 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-15 06:41:15,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2022-04-15 06:41:15,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 44 transitions. [2022-04-15 06:41:15,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:15,856 INFO L225 Difference]: With dead ends: 58 [2022-04-15 06:41:15,856 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 06:41:15,856 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2022-04-15 06:41:15,857 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 31 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:15,857 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 46 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:41:15,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 06:41:15,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2022-04-15 06:41:15,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:15,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 41 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:15,985 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 41 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:15,986 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 41 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:15,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:15,987 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-15 06:41:15,987 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-15 06:41:15,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:15,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:15,987 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-15 06:41:15,987 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-15 06:41:15,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:15,988 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-15 06:41:15,988 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-15 06:41:15,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:15,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:15,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:15,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:15,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:15,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2022-04-15 06:41:15,990 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 54 transitions. Word has length 24 [2022-04-15 06:41:15,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:15,990 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 54 transitions. [2022-04-15 06:41:15,990 INFO L479 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-15 06:41:15,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 54 transitions. [2022-04-15 06:41:18,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 53 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:18,327 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2022-04-15 06:41:18,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 06:41:18,328 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:18,328 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:41:18,344 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-15 06:41:18,531 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-15 06:41:18,531 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:18,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:18,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1227757058, now seen corresponding path program 3 times [2022-04-15 06:41:18,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:18,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1057942104] [2022-04-15 06:41:18,843 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-15 06:41:18,844 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:41:18,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1635895922, now seen corresponding path program 1 times [2022-04-15 06:41:18,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:18,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728923194] [2022-04-15 06:41:18,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:18,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:18,858 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-15 06:41:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:18,889 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-15 06:41:18,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:18,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {4486#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4477#true} is VALID [2022-04-15 06:41:18,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {4477#true} assume true; {4477#true} is VALID [2022-04-15 06:41:18,959 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4477#true} {4477#true} #83#return; {4477#true} is VALID [2022-04-15 06:41:18,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {4477#true} call ULTIMATE.init(); {4486#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:18,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {4486#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4477#true} is VALID [2022-04-15 06:41:18,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {4477#true} assume true; {4477#true} is VALID [2022-04-15 06:41:18,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4477#true} {4477#true} #83#return; {4477#true} is VALID [2022-04-15 06:41:18,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {4477#true} call #t~ret15 := main(); {4477#true} is VALID [2022-04-15 06:41:18,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {4477#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4477#true} is VALID [2022-04-15 06:41:18,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {4477#true} [107] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_106 v_main_~x~0_105)) (.cse1 (= |v_main_#t~post5_49| |v_main_#t~post5_48|)) (.cse4 (mod v_main_~x~0_106 4294967296)) (.cse2 (= v_main_~y~0_111 v_main_~y~0_110)) (.cse3 (= |v_main_#t~post6_49| |v_main_#t~post6_48|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ v_main_~x~0_105 v_it_11 1) v_main_~x~0_106)) (< 0 (mod (+ v_main_~x~0_106 (* 4294967295 v_it_11)) 4294967296)))) (< v_main_~x~0_105 v_main_~x~0_106) (< 0 .cse4) (= v_main_~y~0_110 (+ v_main_~x~0_106 (* v_main_~x~0_105 (- 1)) v_main_~y~0_111))) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_111, main_#t~post5=|v_main_#t~post5_49|, main_~x~0=v_main_~x~0_106, main_#t~post6=|v_main_#t~post6_49|} OutVars{main_~y~0=v_main_~y~0_110, main_#t~post5=|v_main_#t~post5_48|, main_~x~0=v_main_~x~0_105, main_#t~post6=|v_main_#t~post6_48|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4477#true} is VALID [2022-04-15 06:41:18,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {4477#true} [106] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4477#true} is VALID [2022-04-15 06:41:18,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {4477#true} ~z~0 := ~y~0; {4477#true} is VALID [2022-04-15 06:41:18,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {4477#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; {4482#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:18,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {4482#(<= 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; {4483#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 06:41:18,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {4483#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} assume !(~z~0 % 4294967296 > 0); {4483#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 06:41:18,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {4483#(<= 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; {4484#(<= main_~z~0 (+ 4294967294 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 06:41:18,966 INFO L290 TraceCheckUtils]: 13: Hoare triple {4484#(<= 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; {4485#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:41:18,966 INFO L290 TraceCheckUtils]: 14: Hoare triple {4485#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {4485#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:41:18,967 INFO L290 TraceCheckUtils]: 15: Hoare triple {4485#(<= (+ 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; {4485#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:41:18,967 INFO L290 TraceCheckUtils]: 16: Hoare triple {4485#(<= (+ 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; {4485#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:41:18,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {4485#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {4485#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:41:18,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {4485#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {4478#false} is VALID [2022-04-15 06:41:18,971 INFO L272 TraceCheckUtils]: 19: Hoare triple {4478#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4478#false} is VALID [2022-04-15 06:41:18,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {4478#false} ~cond := #in~cond; {4478#false} is VALID [2022-04-15 06:41:18,971 INFO L290 TraceCheckUtils]: 21: Hoare triple {4478#false} assume 0 == ~cond; {4478#false} is VALID [2022-04-15 06:41:18,971 INFO L290 TraceCheckUtils]: 22: Hoare triple {4478#false} assume !false; {4478#false} is VALID [2022-04-15 06:41:18,972 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-15 06:41:18,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:18,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728923194] [2022-04-15 06:41:18,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728923194] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:41:18,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123444488] [2022-04-15 06:41:18,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:18,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:41:18,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:41:18,973 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-15 06:41:18,989 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-15 06:41:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:19,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 06:41:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:19,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:41:19,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {4477#true} call ULTIMATE.init(); {4477#true} is VALID [2022-04-15 06:41:19,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {4477#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4477#true} is VALID [2022-04-15 06:41:19,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {4477#true} assume true; {4477#true} is VALID [2022-04-15 06:41:19,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4477#true} {4477#true} #83#return; {4477#true} is VALID [2022-04-15 06:41:19,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {4477#true} call #t~ret15 := main(); {4477#true} is VALID [2022-04-15 06:41:19,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {4477#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4477#true} is VALID [2022-04-15 06:41:19,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {4477#true} [107] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_106 v_main_~x~0_105)) (.cse1 (= |v_main_#t~post5_49| |v_main_#t~post5_48|)) (.cse4 (mod v_main_~x~0_106 4294967296)) (.cse2 (= v_main_~y~0_111 v_main_~y~0_110)) (.cse3 (= |v_main_#t~post6_49| |v_main_#t~post6_48|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ v_main_~x~0_105 v_it_11 1) v_main_~x~0_106)) (< 0 (mod (+ v_main_~x~0_106 (* 4294967295 v_it_11)) 4294967296)))) (< v_main_~x~0_105 v_main_~x~0_106) (< 0 .cse4) (= v_main_~y~0_110 (+ v_main_~x~0_106 (* v_main_~x~0_105 (- 1)) v_main_~y~0_111))) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_111, main_#t~post5=|v_main_#t~post5_49|, main_~x~0=v_main_~x~0_106, main_#t~post6=|v_main_#t~post6_49|} OutVars{main_~y~0=v_main_~y~0_110, main_#t~post5=|v_main_#t~post5_48|, main_~x~0=v_main_~x~0_105, main_#t~post6=|v_main_#t~post6_48|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4477#true} is VALID [2022-04-15 06:41:19,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {4477#true} [106] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4477#true} is VALID [2022-04-15 06:41:19,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {4477#true} ~z~0 := ~y~0; {4514#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:41:19,255 INFO L290 TraceCheckUtils]: 9: Hoare triple {4514#(= 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; {4518#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-15 06:41:19,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {4518#(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; {4522#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:41:19,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {4522#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4522#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:41:19,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {4522#(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; {4529#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= (+ main_~z~0 1) (+ main_~y~0 1)))} is VALID [2022-04-15 06:41:19,259 INFO L290 TraceCheckUtils]: 13: Hoare triple {4529#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= (+ 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; {4533#(and (= (+ (- 1) main_~z~0) (+ main_~y~0 1)) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 06:41:19,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {4533#(and (= (+ (- 1) main_~z~0) (+ main_~y~0 1)) (< 0 (mod main_~z~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4533#(and (= (+ (- 1) main_~z~0) (+ main_~y~0 1)) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 06:41:19,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {4533#(and (= (+ (- 1) main_~z~0) (+ main_~y~0 1)) (< 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; {4540#(and (< 0 (mod main_~z~0 4294967296)) (= main_~y~0 (+ (- 1) main_~z~0)))} is VALID [2022-04-15 06:41:19,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {4540#(and (< 0 (mod main_~z~0 4294967296)) (= 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; {4544#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:41:19,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {4544#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {4544#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:41:19,262 INFO L290 TraceCheckUtils]: 18: Hoare triple {4544#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4478#false} is VALID [2022-04-15 06:41:19,262 INFO L272 TraceCheckUtils]: 19: Hoare triple {4478#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4478#false} is VALID [2022-04-15 06:41:19,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {4478#false} ~cond := #in~cond; {4478#false} is VALID [2022-04-15 06:41:19,262 INFO L290 TraceCheckUtils]: 21: Hoare triple {4478#false} assume 0 == ~cond; {4478#false} is VALID [2022-04-15 06:41:19,262 INFO L290 TraceCheckUtils]: 22: Hoare triple {4478#false} assume !false; {4478#false} is VALID [2022-04-15 06:41:19,263 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-15 06:41:19,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:41:19,401 INFO L290 TraceCheckUtils]: 22: Hoare triple {4478#false} assume !false; {4478#false} is VALID [2022-04-15 06:41:19,401 INFO L290 TraceCheckUtils]: 21: Hoare triple {4478#false} assume 0 == ~cond; {4478#false} is VALID [2022-04-15 06:41:19,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {4478#false} ~cond := #in~cond; {4478#false} is VALID [2022-04-15 06:41:19,402 INFO L272 TraceCheckUtils]: 19: Hoare triple {4478#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4478#false} is VALID [2022-04-15 06:41:19,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {4544#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4478#false} is VALID [2022-04-15 06:41:19,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {4544#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {4544#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:41:19,403 INFO L290 TraceCheckUtils]: 16: Hoare triple {4544#(< 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; {4544#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:41:19,403 INFO L290 TraceCheckUtils]: 15: Hoare triple {4544#(< 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; {4544#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:41:19,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {4544#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {4544#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:41:19,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {4482#(<= 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; {4544#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:41:19,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {4593#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4482#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:19,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {4593#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} assume !(~z~0 % 4294967296 > 0); {4593#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 06:41:19,407 INFO L290 TraceCheckUtils]: 10: Hoare triple {4482#(<= 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; {4593#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 06:41:19,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {4477#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; {4482#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:19,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {4477#true} ~z~0 := ~y~0; {4477#true} is VALID [2022-04-15 06:41:19,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {4477#true} [106] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4477#true} is VALID [2022-04-15 06:41:19,409 INFO L290 TraceCheckUtils]: 6: Hoare triple {4477#true} [107] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_106 v_main_~x~0_105)) (.cse1 (= |v_main_#t~post5_49| |v_main_#t~post5_48|)) (.cse4 (mod v_main_~x~0_106 4294967296)) (.cse2 (= v_main_~y~0_111 v_main_~y~0_110)) (.cse3 (= |v_main_#t~post6_49| |v_main_#t~post6_48|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ v_main_~x~0_105 v_it_11 1) v_main_~x~0_106)) (< 0 (mod (+ v_main_~x~0_106 (* 4294967295 v_it_11)) 4294967296)))) (< v_main_~x~0_105 v_main_~x~0_106) (< 0 .cse4) (= v_main_~y~0_110 (+ v_main_~x~0_106 (* v_main_~x~0_105 (- 1)) v_main_~y~0_111))) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_111, main_#t~post5=|v_main_#t~post5_49|, main_~x~0=v_main_~x~0_106, main_#t~post6=|v_main_#t~post6_49|} OutVars{main_~y~0=v_main_~y~0_110, main_#t~post5=|v_main_#t~post5_48|, main_~x~0=v_main_~x~0_105, main_#t~post6=|v_main_#t~post6_48|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4477#true} is VALID [2022-04-15 06:41:19,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {4477#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4477#true} is VALID [2022-04-15 06:41:19,409 INFO L272 TraceCheckUtils]: 4: Hoare triple {4477#true} call #t~ret15 := main(); {4477#true} is VALID [2022-04-15 06:41:19,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4477#true} {4477#true} #83#return; {4477#true} is VALID [2022-04-15 06:41:19,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {4477#true} assume true; {4477#true} is VALID [2022-04-15 06:41:19,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {4477#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4477#true} is VALID [2022-04-15 06:41:19,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {4477#true} call ULTIMATE.init(); {4477#true} is VALID [2022-04-15 06:41:19,409 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 06:41:19,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123444488] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:41:19,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:41:19,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 5] total 15 [2022-04-15 06:41:19,530 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:19,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1057942104] [2022-04-15 06:41:19,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1057942104] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:19,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:19,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:41:19,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167488461] [2022-04-15 06:41:19,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:19,530 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-15 06:41:19,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:19,531 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-15 06:41:19,552 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-15 06:41:19,552 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 06:41:19,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:19,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 06:41:19,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-04-15 06:41:19,553 INFO L87 Difference]: Start difference. First operand 41 states and 54 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-15 06:41:20,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:20,426 INFO L93 Difference]: Finished difference Result 64 states and 87 transitions. [2022-04-15 06:41:20,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 06:41:20,426 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-15 06:41:20,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:20,427 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-15 06:41:20,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 51 transitions. [2022-04-15 06:41:20,427 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-15 06:41:20,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 51 transitions. [2022-04-15 06:41:20,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 51 transitions. [2022-04-15 06:41:20,490 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-15 06:41:20,490 INFO L225 Difference]: With dead ends: 64 [2022-04-15 06:41:20,490 INFO L226 Difference]: Without dead ends: 59 [2022-04-15 06:41:20,491 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2022-04-15 06:41:20,492 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 36 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:20,492 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 42 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:41:20,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-15 06:41:20,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2022-04-15 06:41:20,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:20,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 50 states, 45 states have (on average 1.4) internal successors, (63), 45 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:20,687 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 50 states, 45 states have (on average 1.4) internal successors, (63), 45 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:20,687 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 50 states, 45 states have (on average 1.4) internal successors, (63), 45 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:20,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:20,689 INFO L93 Difference]: Finished difference Result 59 states and 80 transitions. [2022-04-15 06:41:20,689 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 80 transitions. [2022-04-15 06:41:20,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:20,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:20,689 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.4) internal successors, (63), 45 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-15 06:41:20,689 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.4) internal successors, (63), 45 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-15 06:41:20,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:20,691 INFO L93 Difference]: Finished difference Result 59 states and 80 transitions. [2022-04-15 06:41:20,691 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 80 transitions. [2022-04-15 06:41:20,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:20,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:20,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:20,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:20,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.4) internal successors, (63), 45 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:20,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-04-15 06:41:20,692 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 24 [2022-04-15 06:41:20,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:20,692 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-04-15 06:41:20,692 INFO L479 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-15 06:41:20,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 67 transitions. [2022-04-15 06:41:22,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:22,489 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-15 06:41:22,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 06:41:22,489 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:22,489 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:41:22,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-15 06:41:22,691 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-15 06:41:22,692 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:22,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:22,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1822836127, now seen corresponding path program 4 times [2022-04-15 06:41:22,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:22,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1246501140] [2022-04-15 06:41:22,882 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-15 06:41:22,884 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:41:22,885 INFO L85 PathProgramCache]: Analyzing trace with hash 310709397, now seen corresponding path program 1 times [2022-04-15 06:41:22,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:22,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875676256] [2022-04-15 06:41:22,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:22,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:22,895 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-15 06:41:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:22,915 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_12.4))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:41:23,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:23,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {5017#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5003#true} is VALID [2022-04-15 06:41:23,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {5003#true} assume true; {5003#true} is VALID [2022-04-15 06:41:23,156 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5003#true} {5003#true} #83#return; {5003#true} is VALID [2022-04-15 06:41:23,157 INFO L272 TraceCheckUtils]: 0: Hoare triple {5003#true} call ULTIMATE.init(); {5017#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:23,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {5017#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5003#true} is VALID [2022-04-15 06:41:23,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {5003#true} assume true; {5003#true} is VALID [2022-04-15 06:41:23,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5003#true} {5003#true} #83#return; {5003#true} is VALID [2022-04-15 06:41:23,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {5003#true} call #t~ret15 := main(); {5003#true} is VALID [2022-04-15 06:41:23,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {5003#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5008#(= main_~y~0 0)} is VALID [2022-04-15 06:41:23,160 INFO L290 TraceCheckUtils]: 6: Hoare triple {5008#(= main_~y~0 0)} [109] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_118 4294967296)) (.cse1 (= v_main_~y~0_127 v_main_~y~0_126)) (.cse2 (= v_main_~x~0_118 v_main_~x~0_117)) (.cse3 (= |v_main_#t~post6_54| |v_main_#t~post6_53|)) (.cse4 (= |v_main_#t~post5_54| |v_main_#t~post5_53|))) (or (and (= v_main_~x~0_117 (+ v_main_~x~0_118 v_main_~y~0_127 (* (- 1) v_main_~y~0_126))) (forall ((v_it_12 Int)) (or (< 0 (mod (+ v_main_~x~0_118 (* 4294967295 v_it_12)) 4294967296)) (not (<= (+ v_main_~y~0_127 v_it_12 1) v_main_~y~0_126)) (not (<= 1 v_it_12)))) (< 0 .cse0) (< v_main_~y~0_127 v_main_~y~0_126)) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_127, main_#t~post5=|v_main_#t~post5_54|, main_~x~0=v_main_~x~0_118, main_#t~post6=|v_main_#t~post6_54|} OutVars{main_~y~0=v_main_~y~0_126, main_#t~post5=|v_main_#t~post5_53|, main_~x~0=v_main_~x~0_117, main_#t~post6=|v_main_#t~post6_53|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5009#(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-15 06:41:23,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {5009#(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)))} [108] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5010#(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-15 06:41:23,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {5010#(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; {5011#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (and (<= (+ (* (div (+ main_~y~0 (* (- 1) main_~z~0) 4294967295 (* (div (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296)) 4294967296) 4294967296) 1) (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~z~0 main_~y~0)))} is VALID [2022-04-15 06:41:23,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {5011#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (and (<= (+ (* (div (+ main_~y~0 (* (- 1) main_~z~0) 4294967295 (* (div (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296)) 4294967296) 4294967296) 1) (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= 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; {5012#(and (<= (+ main_~z~0 1) main_~y~0) (<= main_~z~0 (+ 4294967294 (* (div (+ main_~z~0 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0) 1) 4294967296) 4294967296))))} is VALID [2022-04-15 06:41:23,180 INFO L290 TraceCheckUtils]: 10: Hoare triple {5012#(and (<= (+ main_~z~0 1) main_~y~0) (<= main_~z~0 (+ 4294967294 (* (div (+ main_~z~0 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0) 1) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5013#(<= (+ main_~y~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:23,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {5013#(<= (+ main_~y~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {5014#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:23,182 INFO L290 TraceCheckUtils]: 12: Hoare triple {5014#(<= 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; {5015#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:41:23,183 INFO L290 TraceCheckUtils]: 13: Hoare triple {5015#(<= 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; {5016#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:41:23,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {5016#(<= 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; {5004#false} is VALID [2022-04-15 06:41:23,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {5004#false} assume !(~y~0 % 4294967296 > 0); {5004#false} is VALID [2022-04-15 06:41:23,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {5004#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; {5004#false} is VALID [2022-04-15 06:41:23,188 INFO L290 TraceCheckUtils]: 17: Hoare triple {5004#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; {5004#false} is VALID [2022-04-15 06:41:23,188 INFO L290 TraceCheckUtils]: 18: Hoare triple {5004#false} assume !(~x~0 % 4294967296 > 0); {5004#false} is VALID [2022-04-15 06:41:23,188 INFO L290 TraceCheckUtils]: 19: Hoare triple {5004#false} assume !(~z~0 % 4294967296 > 0); {5004#false} is VALID [2022-04-15 06:41:23,188 INFO L272 TraceCheckUtils]: 20: Hoare triple {5004#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {5004#false} is VALID [2022-04-15 06:41:23,188 INFO L290 TraceCheckUtils]: 21: Hoare triple {5004#false} ~cond := #in~cond; {5004#false} is VALID [2022-04-15 06:41:23,188 INFO L290 TraceCheckUtils]: 22: Hoare triple {5004#false} assume 0 == ~cond; {5004#false} is VALID [2022-04-15 06:41:23,188 INFO L290 TraceCheckUtils]: 23: Hoare triple {5004#false} assume !false; {5004#false} is VALID [2022-04-15 06:41:23,188 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-15 06:41:23,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:23,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875676256] [2022-04-15 06:41:23,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875676256] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:41:23,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604902175] [2022-04-15 06:41:23,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:23,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:41:23,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:41:23,189 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-15 06:41:23,190 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-15 06:41:23,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:23,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 06:41:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:23,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:41:23,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {5003#true} call ULTIMATE.init(); {5003#true} is VALID [2022-04-15 06:41:23,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {5003#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5003#true} is VALID [2022-04-15 06:41:23,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {5003#true} assume true; {5003#true} is VALID [2022-04-15 06:41:23,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5003#true} {5003#true} #83#return; {5003#true} is VALID [2022-04-15 06:41:23,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {5003#true} call #t~ret15 := main(); {5003#true} is VALID [2022-04-15 06:41:23,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {5003#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5003#true} is VALID [2022-04-15 06:41:23,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {5003#true} [109] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_118 4294967296)) (.cse1 (= v_main_~y~0_127 v_main_~y~0_126)) (.cse2 (= v_main_~x~0_118 v_main_~x~0_117)) (.cse3 (= |v_main_#t~post6_54| |v_main_#t~post6_53|)) (.cse4 (= |v_main_#t~post5_54| |v_main_#t~post5_53|))) (or (and (= v_main_~x~0_117 (+ v_main_~x~0_118 v_main_~y~0_127 (* (- 1) v_main_~y~0_126))) (forall ((v_it_12 Int)) (or (< 0 (mod (+ v_main_~x~0_118 (* 4294967295 v_it_12)) 4294967296)) (not (<= (+ v_main_~y~0_127 v_it_12 1) v_main_~y~0_126)) (not (<= 1 v_it_12)))) (< 0 .cse0) (< v_main_~y~0_127 v_main_~y~0_126)) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_127, main_#t~post5=|v_main_#t~post5_54|, main_~x~0=v_main_~x~0_118, main_#t~post6=|v_main_#t~post6_54|} OutVars{main_~y~0=v_main_~y~0_126, main_#t~post5=|v_main_#t~post5_53|, main_~x~0=v_main_~x~0_117, main_#t~post6=|v_main_#t~post6_53|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5003#true} is VALID [2022-04-15 06:41:23,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {5003#true} [108] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5003#true} is VALID [2022-04-15 06:41:23,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {5003#true} ~z~0 := ~y~0; {5045#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:41:23,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {5045#(= 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; {5049#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:41:23,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {5049#(= 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; {5053#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-15 06:41:23,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {5053#(= main_~y~0 (+ main_~z~0 2))} assume !(~z~0 % 4294967296 > 0); {5014#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:23,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {5014#(<= 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; {5015#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:41:23,536 INFO L290 TraceCheckUtils]: 13: Hoare triple {5015#(<= 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; {5016#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:41:23,536 INFO L290 TraceCheckUtils]: 14: Hoare triple {5016#(<= 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; {5004#false} is VALID [2022-04-15 06:41:23,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {5004#false} assume !(~y~0 % 4294967296 > 0); {5004#false} is VALID [2022-04-15 06:41:23,536 INFO L290 TraceCheckUtils]: 16: Hoare triple {5004#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; {5004#false} is VALID [2022-04-15 06:41:23,536 INFO L290 TraceCheckUtils]: 17: Hoare triple {5004#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; {5004#false} is VALID [2022-04-15 06:41:23,536 INFO L290 TraceCheckUtils]: 18: Hoare triple {5004#false} assume !(~x~0 % 4294967296 > 0); {5004#false} is VALID [2022-04-15 06:41:23,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {5004#false} assume !(~z~0 % 4294967296 > 0); {5004#false} is VALID [2022-04-15 06:41:23,537 INFO L272 TraceCheckUtils]: 20: Hoare triple {5004#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {5004#false} is VALID [2022-04-15 06:41:23,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {5004#false} ~cond := #in~cond; {5004#false} is VALID [2022-04-15 06:41:23,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {5004#false} assume 0 == ~cond; {5004#false} is VALID [2022-04-15 06:41:23,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {5004#false} assume !false; {5004#false} is VALID [2022-04-15 06:41:23,537 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-15 06:41:23,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:41:23,893 INFO L290 TraceCheckUtils]: 23: Hoare triple {5004#false} assume !false; {5004#false} is VALID [2022-04-15 06:41:23,894 INFO L290 TraceCheckUtils]: 22: Hoare triple {5004#false} assume 0 == ~cond; {5004#false} is VALID [2022-04-15 06:41:23,894 INFO L290 TraceCheckUtils]: 21: Hoare triple {5004#false} ~cond := #in~cond; {5004#false} is VALID [2022-04-15 06:41:23,894 INFO L272 TraceCheckUtils]: 20: Hoare triple {5004#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {5004#false} is VALID [2022-04-15 06:41:23,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {5004#false} assume !(~z~0 % 4294967296 > 0); {5004#false} is VALID [2022-04-15 06:41:23,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {5004#false} assume !(~x~0 % 4294967296 > 0); {5004#false} is VALID [2022-04-15 06:41:23,894 INFO L290 TraceCheckUtils]: 17: Hoare triple {5004#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; {5004#false} is VALID [2022-04-15 06:41:23,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {5004#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; {5004#false} is VALID [2022-04-15 06:41:23,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {5004#false} assume !(~y~0 % 4294967296 > 0); {5004#false} is VALID [2022-04-15 06:41:23,895 INFO L290 TraceCheckUtils]: 14: Hoare triple {5016#(<= 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; {5004#false} is VALID [2022-04-15 06:41:23,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {5015#(<= 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; {5016#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:41:23,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {5014#(<= 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; {5015#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:41:23,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {5129#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {5014#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:23,898 INFO L290 TraceCheckUtils]: 10: Hoare triple {5133#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~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; {5129#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 06:41:23,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {5137#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~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; {5133#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:41:23,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {5003#true} ~z~0 := ~y~0; {5137#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-15 06:41:23,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {5003#true} [108] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5003#true} is VALID [2022-04-15 06:41:23,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {5003#true} [109] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_118 4294967296)) (.cse1 (= v_main_~y~0_127 v_main_~y~0_126)) (.cse2 (= v_main_~x~0_118 v_main_~x~0_117)) (.cse3 (= |v_main_#t~post6_54| |v_main_#t~post6_53|)) (.cse4 (= |v_main_#t~post5_54| |v_main_#t~post5_53|))) (or (and (= v_main_~x~0_117 (+ v_main_~x~0_118 v_main_~y~0_127 (* (- 1) v_main_~y~0_126))) (forall ((v_it_12 Int)) (or (< 0 (mod (+ v_main_~x~0_118 (* 4294967295 v_it_12)) 4294967296)) (not (<= (+ v_main_~y~0_127 v_it_12 1) v_main_~y~0_126)) (not (<= 1 v_it_12)))) (< 0 .cse0) (< v_main_~y~0_127 v_main_~y~0_126)) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_127, main_#t~post5=|v_main_#t~post5_54|, main_~x~0=v_main_~x~0_118, main_#t~post6=|v_main_#t~post6_54|} OutVars{main_~y~0=v_main_~y~0_126, main_#t~post5=|v_main_#t~post5_53|, main_~x~0=v_main_~x~0_117, main_#t~post6=|v_main_#t~post6_53|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5003#true} is VALID [2022-04-15 06:41:23,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {5003#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5003#true} is VALID [2022-04-15 06:41:23,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {5003#true} call #t~ret15 := main(); {5003#true} is VALID [2022-04-15 06:41:23,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5003#true} {5003#true} #83#return; {5003#true} is VALID [2022-04-15 06:41:23,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {5003#true} assume true; {5003#true} is VALID [2022-04-15 06:41:23,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {5003#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5003#true} is VALID [2022-04-15 06:41:23,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {5003#true} call ULTIMATE.init(); {5003#true} is VALID [2022-04-15 06:41:23,902 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-15 06:41:23,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604902175] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:41:23,902 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:41:23,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 18 [2022-04-15 06:41:32,044 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:32,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1246501140] [2022-04-15 06:41:32,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1246501140] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:32,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:32,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 06:41:32,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057178207] [2022-04-15 06:41:32,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:32,045 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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-15 06:41:32,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:32,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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-15 06:41:33,113 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-15 06:41:33,114 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 06:41:33,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:33,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 06:41:33,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=350, Unknown=3, NotChecked=0, Total=420 [2022-04-15 06:41:33,114 INFO L87 Difference]: Start difference. First operand 50 states and 67 transitions. Second operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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-15 06:41:53,012 WARN L232 SmtUtils]: Spent 6.48s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 06:42:06,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:06,835 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2022-04-15 06:42:06,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 06:42:06,835 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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-15 06:42:06,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:06,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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-15 06:42:06,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 73 transitions. [2022-04-15 06:42:06,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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-15 06:42:06,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 73 transitions. [2022-04-15 06:42:06,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 73 transitions. [2022-04-15 06:42:14,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 70 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:14,106 INFO L225 Difference]: With dead ends: 103 [2022-04-15 06:42:14,106 INFO L226 Difference]: Without dead ends: 85 [2022-04-15 06:42:14,107 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 38.6s TimeCoverageRelationStatistics Valid=200, Invalid=912, Unknown=10, NotChecked=0, Total=1122 [2022-04-15 06:42:14,107 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 56 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:42:14,107 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 53 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 183 Invalid, 0 Unknown, 62 Unchecked, 0.3s Time] [2022-04-15 06:42:14,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-15 06:42:14,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 61. [2022-04-15 06:42:14,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:14,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 61 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:14,376 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 61 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:14,377 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 61 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:14,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:14,378 INFO L93 Difference]: Finished difference Result 85 states and 117 transitions. [2022-04-15 06:42:14,378 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2022-04-15 06:42:14,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:14,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:14,379 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 85 states. [2022-04-15 06:42:14,379 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 85 states. [2022-04-15 06:42:14,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:14,381 INFO L93 Difference]: Finished difference Result 85 states and 117 transitions. [2022-04-15 06:42:14,381 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2022-04-15 06:42:14,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:14,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:14,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:14,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:14,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:14,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 82 transitions. [2022-04-15 06:42:14,382 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 82 transitions. Word has length 25 [2022-04-15 06:42:14,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:14,383 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 82 transitions. [2022-04-15 06:42:14,383 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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-15 06:42:14,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 82 transitions. [2022-04-15 06:42:17,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 81 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:17,440 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 82 transitions. [2022-04-15 06:42:17,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 06:42:17,441 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:17,441 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:17,457 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-15 06:42:17,643 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-15 06:42:17,643 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:17,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:17,644 INFO L85 PathProgramCache]: Analyzing trace with hash -137630238, now seen corresponding path program 5 times [2022-04-15 06:42:17,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:17,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2113411726] [2022-04-15 06:42:19,930 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-15 06:42:19,931 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:19,933 INFO L85 PathProgramCache]: Analyzing trace with hash -2105316882, now seen corresponding path program 1 times [2022-04-15 06:42:19,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:19,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647355586] [2022-04-15 06:42:19,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:19,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:19,942 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-15 06:42:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:19,960 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-15 06:42:20,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:20,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {5710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5696#true} is VALID [2022-04-15 06:42:20,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {5696#true} assume true; {5696#true} is VALID [2022-04-15 06:42:20,154 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5696#true} {5696#true} #83#return; {5696#true} is VALID [2022-04-15 06:42:20,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {5696#true} call ULTIMATE.init(); {5710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:42:20,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {5710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5696#true} is VALID [2022-04-15 06:42:20,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {5696#true} assume true; {5696#true} is VALID [2022-04-15 06:42:20,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5696#true} {5696#true} #83#return; {5696#true} is VALID [2022-04-15 06:42:20,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {5696#true} call #t~ret15 := main(); {5696#true} is VALID [2022-04-15 06:42:20,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {5696#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5696#true} is VALID [2022-04-15 06:42:20,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {5696#true} [111] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_143 v_main_~y~0_142)) (.cse1 (= |v_main_#t~post6_59| |v_main_#t~post6_58|)) (.cse2 (= |v_main_#t~post5_59| |v_main_#t~post5_58|)) (.cse3 (mod v_main_~x~0_130 4294967296))) (or (and .cse0 (= v_main_~x~0_130 v_main_~x~0_129) .cse1 .cse2) (and .cse0 (= v_main_~x~0_129 v_main_~x~0_130) .cse1 (<= .cse3 0) .cse2) (and (< v_main_~y~0_143 v_main_~y~0_142) (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_main_~y~0_143 v_it_13 1) v_main_~y~0_142)) (< 0 (mod (+ v_main_~x~0_130 (* 4294967295 v_it_13)) 4294967296)))) (< 0 .cse3) (= v_main_~x~0_129 (+ v_main_~x~0_130 v_main_~y~0_143 (* (- 1) v_main_~y~0_142)))))) InVars {main_~y~0=v_main_~y~0_143, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_130, main_#t~post6=|v_main_#t~post6_59|} OutVars{main_~y~0=v_main_~y~0_142, main_#t~post5=|v_main_#t~post5_58|, main_~x~0=v_main_~x~0_129, main_#t~post6=|v_main_#t~post6_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5696#true} is VALID [2022-04-15 06:42:20,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {5696#true} [110] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5696#true} is VALID [2022-04-15 06:42:20,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {5696#true} ~z~0 := ~y~0; {5701#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:42:20,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {5701#(= (+ 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; {5702#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:42:20,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {5702#(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; {5703#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:42:20,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {5703#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {5704#(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-15 06:42:20,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {5704#(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; {5705#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:42:20,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {5705#(<= 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; {5706#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:42:20,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {5706#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {5706#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:42:20,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {5706#(<= 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; {5705#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:42:20,170 INFO L290 TraceCheckUtils]: 16: Hoare triple {5705#(<= 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; {5707#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:20,171 INFO L290 TraceCheckUtils]: 17: Hoare triple {5707#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {5707#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:20,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {5707#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5705#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:42:20,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {5705#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5706#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:42:20,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {5706#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {5706#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:42:20,174 INFO L272 TraceCheckUtils]: 21: Hoare triple {5706#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {5708#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:42:20,175 INFO L290 TraceCheckUtils]: 22: Hoare triple {5708#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5709#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:42:20,175 INFO L290 TraceCheckUtils]: 23: Hoare triple {5709#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5697#false} is VALID [2022-04-15 06:42:20,175 INFO L290 TraceCheckUtils]: 24: Hoare triple {5697#false} assume !false; {5697#false} is VALID [2022-04-15 06:42:20,175 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:42:20,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:20,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647355586] [2022-04-15 06:42:20,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647355586] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:20,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283672969] [2022-04-15 06:42:20,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:20,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:20,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:20,180 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-15 06:42:20,181 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-15 06:42:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:20,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 06:42:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:20,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:20,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {5696#true} call ULTIMATE.init(); {5696#true} is VALID [2022-04-15 06:42:20,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {5696#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5696#true} is VALID [2022-04-15 06:42:20,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {5696#true} assume true; {5696#true} is VALID [2022-04-15 06:42:20,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5696#true} {5696#true} #83#return; {5696#true} is VALID [2022-04-15 06:42:20,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {5696#true} call #t~ret15 := main(); {5696#true} is VALID [2022-04-15 06:42:20,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {5696#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5696#true} is VALID [2022-04-15 06:42:20,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {5696#true} [111] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_143 v_main_~y~0_142)) (.cse1 (= |v_main_#t~post6_59| |v_main_#t~post6_58|)) (.cse2 (= |v_main_#t~post5_59| |v_main_#t~post5_58|)) (.cse3 (mod v_main_~x~0_130 4294967296))) (or (and .cse0 (= v_main_~x~0_130 v_main_~x~0_129) .cse1 .cse2) (and .cse0 (= v_main_~x~0_129 v_main_~x~0_130) .cse1 (<= .cse3 0) .cse2) (and (< v_main_~y~0_143 v_main_~y~0_142) (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_main_~y~0_143 v_it_13 1) v_main_~y~0_142)) (< 0 (mod (+ v_main_~x~0_130 (* 4294967295 v_it_13)) 4294967296)))) (< 0 .cse3) (= v_main_~x~0_129 (+ v_main_~x~0_130 v_main_~y~0_143 (* (- 1) v_main_~y~0_142)))))) InVars {main_~y~0=v_main_~y~0_143, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_130, main_#t~post6=|v_main_#t~post6_59|} OutVars{main_~y~0=v_main_~y~0_142, main_#t~post5=|v_main_#t~post5_58|, main_~x~0=v_main_~x~0_129, main_#t~post6=|v_main_#t~post6_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5696#true} is VALID [2022-04-15 06:42:20,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {5696#true} [110] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5696#true} is VALID [2022-04-15 06:42:20,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {5696#true} ~z~0 := ~y~0; {5701#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:42:20,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {5701#(= (+ 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; {5702#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:42:20,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {5702#(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; {5696#true} is VALID [2022-04-15 06:42:20,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {5696#true} assume !(~z~0 % 4294967296 > 0); {5696#true} is VALID [2022-04-15 06:42:20,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {5696#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; {5696#true} is VALID [2022-04-15 06:42:20,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {5696#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; {5696#true} is VALID [2022-04-15 06:42:20,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {5696#true} assume !(~y~0 % 4294967296 > 0); {5706#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:42:20,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {5706#(<= 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; {5705#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:42:20,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {5705#(<= 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; {5707#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:20,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {5707#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {5707#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:20,546 INFO L290 TraceCheckUtils]: 18: Hoare triple {5707#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5705#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:42:20,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {5705#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5706#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:42:20,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {5706#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {5706#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:42:20,555 INFO L272 TraceCheckUtils]: 21: Hoare triple {5706#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {5777#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:42:20,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {5777#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5781#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:42:20,556 INFO L290 TraceCheckUtils]: 23: Hoare triple {5781#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5697#false} is VALID [2022-04-15 06:42:20,556 INFO L290 TraceCheckUtils]: 24: Hoare triple {5697#false} assume !false; {5697#false} is VALID [2022-04-15 06:42:20,556 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-15 06:42:20,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:20,679 INFO L290 TraceCheckUtils]: 24: Hoare triple {5697#false} assume !false; {5697#false} is VALID [2022-04-15 06:42:20,680 INFO L290 TraceCheckUtils]: 23: Hoare triple {5781#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5697#false} is VALID [2022-04-15 06:42:20,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {5777#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5781#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:42:20,681 INFO L272 TraceCheckUtils]: 21: Hoare triple {5706#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {5777#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:42:20,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {5706#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {5706#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:42:20,683 INFO L290 TraceCheckUtils]: 19: Hoare triple {5705#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5706#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:42:20,684 INFO L290 TraceCheckUtils]: 18: Hoare triple {5707#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5705#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:42:20,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {5707#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {5707#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:20,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {5705#(<= 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; {5707#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:20,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {5706#(<= 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; {5705#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:42:20,686 INFO L290 TraceCheckUtils]: 14: Hoare triple {5696#true} assume !(~y~0 % 4294967296 > 0); {5706#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:42:20,686 INFO L290 TraceCheckUtils]: 13: Hoare triple {5696#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; {5696#true} is VALID [2022-04-15 06:42:20,686 INFO L290 TraceCheckUtils]: 12: Hoare triple {5696#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; {5696#true} is VALID [2022-04-15 06:42:20,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {5696#true} assume !(~z~0 % 4294967296 > 0); {5696#true} is VALID [2022-04-15 06:42:20,686 INFO L290 TraceCheckUtils]: 10: Hoare triple {5696#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; {5696#true} is VALID [2022-04-15 06:42:20,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {5696#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; {5696#true} is VALID [2022-04-15 06:42:20,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {5696#true} ~z~0 := ~y~0; {5696#true} is VALID [2022-04-15 06:42:20,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {5696#true} [110] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5696#true} is VALID [2022-04-15 06:42:20,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {5696#true} [111] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_143 v_main_~y~0_142)) (.cse1 (= |v_main_#t~post6_59| |v_main_#t~post6_58|)) (.cse2 (= |v_main_#t~post5_59| |v_main_#t~post5_58|)) (.cse3 (mod v_main_~x~0_130 4294967296))) (or (and .cse0 (= v_main_~x~0_130 v_main_~x~0_129) .cse1 .cse2) (and .cse0 (= v_main_~x~0_129 v_main_~x~0_130) .cse1 (<= .cse3 0) .cse2) (and (< v_main_~y~0_143 v_main_~y~0_142) (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_main_~y~0_143 v_it_13 1) v_main_~y~0_142)) (< 0 (mod (+ v_main_~x~0_130 (* 4294967295 v_it_13)) 4294967296)))) (< 0 .cse3) (= v_main_~x~0_129 (+ v_main_~x~0_130 v_main_~y~0_143 (* (- 1) v_main_~y~0_142)))))) InVars {main_~y~0=v_main_~y~0_143, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_130, main_#t~post6=|v_main_#t~post6_59|} OutVars{main_~y~0=v_main_~y~0_142, main_#t~post5=|v_main_#t~post5_58|, main_~x~0=v_main_~x~0_129, main_#t~post6=|v_main_#t~post6_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5696#true} is VALID [2022-04-15 06:42:20,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {5696#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5696#true} is VALID [2022-04-15 06:42:20,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {5696#true} call #t~ret15 := main(); {5696#true} is VALID [2022-04-15 06:42:20,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5696#true} {5696#true} #83#return; {5696#true} is VALID [2022-04-15 06:42:20,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {5696#true} assume true; {5696#true} is VALID [2022-04-15 06:42:20,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {5696#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5696#true} is VALID [2022-04-15 06:42:20,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {5696#true} call ULTIMATE.init(); {5696#true} is VALID [2022-04-15 06:42:20,687 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 06:42:20,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283672969] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:20,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:20,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 7] total 14 [2022-04-15 06:42:20,743 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:20,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2113411726] [2022-04-15 06:42:20,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2113411726] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:20,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:20,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 06:42:20,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569443503] [2022-04-15 06:42:20,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:20,744 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 06:42:20,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:20,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 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-15 06:42:20,767 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-15 06:42:20,767 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 06:42:20,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:20,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 06:42:20,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-04-15 06:42:20,768 INFO L87 Difference]: Start difference. First operand 61 states and 82 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 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-15 06:42:22,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:22,344 INFO L93 Difference]: Finished difference Result 88 states and 117 transitions. [2022-04-15 06:42:22,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 06:42:22,345 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 06:42:22,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:22,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 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-15 06:42:22,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 66 transitions. [2022-04-15 06:42:22,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 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-15 06:42:22,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 66 transitions. [2022-04-15 06:42:22,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 66 transitions. [2022-04-15 06:42:22,440 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-15 06:42:22,441 INFO L225 Difference]: With dead ends: 88 [2022-04-15 06:42:22,441 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 06:42:22,442 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2022-04-15 06:42:22,442 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 55 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:42:22,442 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 62 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:42:22,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 06:42:22,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2022-04-15 06:42:22,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:22,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 57 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:22,719 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 57 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:22,719 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 57 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:22,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:22,721 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-15 06:42:22,721 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-15 06:42:22,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:22,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:22,721 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-15 06:42:22,721 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-15 06:42:22,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:22,723 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-15 06:42:22,723 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-15 06:42:22,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:22,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:22,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:22,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:22,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:22,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 78 transitions. [2022-04-15 06:42:22,724 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 78 transitions. Word has length 26 [2022-04-15 06:42:22,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:22,725 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 78 transitions. [2022-04-15 06:42:22,725 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 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-15 06:42:22,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 78 transitions. [2022-04-15 06:42:25,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 77 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:25,460 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2022-04-15 06:42:25,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 06:42:25,460 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:25,460 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:25,477 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-15 06:42:25,667 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-15 06:42:25,667 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:25,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:25,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1205395922, now seen corresponding path program 5 times [2022-04-15 06:42:25,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:25,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1450890204] [2022-04-15 06:42:26,034 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-15 06:42:26,036 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:26,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1030862093, now seen corresponding path program 1 times [2022-04-15 06:42:26,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:26,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249194126] [2022-04-15 06:42:26,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:26,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:26,046 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-15 06:42:26,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:26,060 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_14.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:42:26,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:26,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {6327#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6317#true} is VALID [2022-04-15 06:42:26,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {6317#true} assume true; {6317#true} is VALID [2022-04-15 06:42:26,138 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6317#true} {6317#true} #83#return; {6317#true} is VALID [2022-04-15 06:42:26,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {6317#true} call ULTIMATE.init(); {6327#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:42:26,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {6327#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6317#true} is VALID [2022-04-15 06:42:26,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {6317#true} assume true; {6317#true} is VALID [2022-04-15 06:42:26,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6317#true} {6317#true} #83#return; {6317#true} is VALID [2022-04-15 06:42:26,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {6317#true} call #t~ret15 := main(); {6317#true} is VALID [2022-04-15 06:42:26,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {6317#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6317#true} is VALID [2022-04-15 06:42:26,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {6317#true} [113] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_140 4294967296)) (.cse1 (= |v_main_#t~post5_64| |v_main_#t~post5_63|)) (.cse2 (= v_main_~y~0_161 v_main_~y~0_160)) (.cse3 (= |v_main_#t~post6_64| |v_main_#t~post6_63|))) (or (and (< v_main_~x~0_139 v_main_~x~0_140) (< 0 .cse0) (= (+ v_main_~x~0_140 (* v_main_~x~0_139 (- 1)) v_main_~y~0_161) v_main_~y~0_160) (forall ((v_it_14 Int)) (or (not (<= 1 v_it_14)) (< 0 (mod (+ v_main_~x~0_140 (* 4294967295 v_it_14)) 4294967296)) (not (<= (+ v_main_~x~0_139 v_it_14 1) v_main_~x~0_140))))) (and (<= .cse0 0) .cse1 .cse2 .cse3 (= v_main_~x~0_139 v_main_~x~0_140)) (and .cse1 .cse2 .cse3 (= v_main_~x~0_140 v_main_~x~0_139)))) InVars {main_~y~0=v_main_~y~0_161, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_140, main_#t~post6=|v_main_#t~post6_64|} OutVars{main_~y~0=v_main_~y~0_160, main_#t~post5=|v_main_#t~post5_63|, main_~x~0=v_main_~x~0_139, main_#t~post6=|v_main_#t~post6_63|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6317#true} is VALID [2022-04-15 06:42:26,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {6317#true} [112] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {6322#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:42:26,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {6322#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {6322#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:42:26,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {6322#(<= 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; {6323#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:42:26,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {6323#(<= 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; {6324#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:26,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {6324#(<= 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; {6325#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:26,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {6325#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6325#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:26,145 INFO L290 TraceCheckUtils]: 13: Hoare triple {6325#(<= 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; {6325#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:26,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {6325#(<= 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; {6325#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:26,146 INFO L290 TraceCheckUtils]: 15: Hoare triple {6325#(<= 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; {6325#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:26,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {6325#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {6325#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:26,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {6325#(<= 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; {6326#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 06:42:26,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {6326#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {6318#false} is VALID [2022-04-15 06:42:26,148 INFO L290 TraceCheckUtils]: 19: Hoare triple {6318#false} assume !(~z~0 % 4294967296 > 0); {6318#false} is VALID [2022-04-15 06:42:26,148 INFO L272 TraceCheckUtils]: 20: Hoare triple {6318#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {6318#false} is VALID [2022-04-15 06:42:26,148 INFO L290 TraceCheckUtils]: 21: Hoare triple {6318#false} ~cond := #in~cond; {6318#false} is VALID [2022-04-15 06:42:26,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {6318#false} assume 0 == ~cond; {6318#false} is VALID [2022-04-15 06:42:26,149 INFO L290 TraceCheckUtils]: 23: Hoare triple {6318#false} assume !false; {6318#false} is VALID [2022-04-15 06:42:26,149 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 06:42:26,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:26,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249194126] [2022-04-15 06:42:26,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249194126] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:26,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081611904] [2022-04-15 06:42:26,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:26,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:26,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:26,152 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-15 06:42:26,179 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-15 06:42:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:26,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 06:42:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:26,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:26,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {6317#true} call ULTIMATE.init(); {6317#true} is VALID [2022-04-15 06:42:26,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {6317#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6317#true} is VALID [2022-04-15 06:42:26,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {6317#true} assume true; {6317#true} is VALID [2022-04-15 06:42:26,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6317#true} {6317#true} #83#return; {6317#true} is VALID [2022-04-15 06:42:26,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {6317#true} call #t~ret15 := main(); {6317#true} is VALID [2022-04-15 06:42:26,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {6317#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6317#true} is VALID [2022-04-15 06:42:26,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {6317#true} [113] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_140 4294967296)) (.cse1 (= |v_main_#t~post5_64| |v_main_#t~post5_63|)) (.cse2 (= v_main_~y~0_161 v_main_~y~0_160)) (.cse3 (= |v_main_#t~post6_64| |v_main_#t~post6_63|))) (or (and (< v_main_~x~0_139 v_main_~x~0_140) (< 0 .cse0) (= (+ v_main_~x~0_140 (* v_main_~x~0_139 (- 1)) v_main_~y~0_161) v_main_~y~0_160) (forall ((v_it_14 Int)) (or (not (<= 1 v_it_14)) (< 0 (mod (+ v_main_~x~0_140 (* 4294967295 v_it_14)) 4294967296)) (not (<= (+ v_main_~x~0_139 v_it_14 1) v_main_~x~0_140))))) (and (<= .cse0 0) .cse1 .cse2 .cse3 (= v_main_~x~0_139 v_main_~x~0_140)) (and .cse1 .cse2 .cse3 (= v_main_~x~0_140 v_main_~x~0_139)))) InVars {main_~y~0=v_main_~y~0_161, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_140, main_#t~post6=|v_main_#t~post6_64|} OutVars{main_~y~0=v_main_~y~0_160, main_#t~post5=|v_main_#t~post5_63|, main_~x~0=v_main_~x~0_139, main_#t~post6=|v_main_#t~post6_63|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6317#true} is VALID [2022-04-15 06:42:26,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {6317#true} [112] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {6317#true} is VALID [2022-04-15 06:42:26,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {6317#true} ~z~0 := ~y~0; {6355#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:42:26,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {6355#(= 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; {6359#(and (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:42:26,456 INFO L290 TraceCheckUtils]: 10: Hoare triple {6359#(and (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6363#(and (= main_~y~0 (+ main_~z~0 2)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:42:26,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {6363#(and (= main_~y~0 (+ main_~z~0 2)) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6367#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:42:26,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {6367#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6367#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:42:26,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {6367#(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; {6374#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= main_~z~0 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 06:42:26,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {6374#(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; {6378#(and (= main_~y~0 (+ (- 1) main_~z~0)) (< 0 (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-15 06:42:26,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {6378#(and (= main_~y~0 (+ (- 1) main_~z~0)) (< 0 (mod (+ main_~y~0 2) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6382#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:42:26,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {6382#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {6382#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:42:26,460 INFO L290 TraceCheckUtils]: 17: Hoare triple {6382#(< 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; {6382#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:42:26,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {6382#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {6382#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:42:26,461 INFO L290 TraceCheckUtils]: 19: Hoare triple {6382#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6318#false} is VALID [2022-04-15 06:42:26,461 INFO L272 TraceCheckUtils]: 20: Hoare triple {6318#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {6318#false} is VALID [2022-04-15 06:42:26,461 INFO L290 TraceCheckUtils]: 21: Hoare triple {6318#false} ~cond := #in~cond; {6318#false} is VALID [2022-04-15 06:42:26,461 INFO L290 TraceCheckUtils]: 22: Hoare triple {6318#false} assume 0 == ~cond; {6318#false} is VALID [2022-04-15 06:42:26,461 INFO L290 TraceCheckUtils]: 23: Hoare triple {6318#false} assume !false; {6318#false} is VALID [2022-04-15 06:42:26,461 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:42:26,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:26,596 INFO L290 TraceCheckUtils]: 23: Hoare triple {6318#false} assume !false; {6318#false} is VALID [2022-04-15 06:42:26,596 INFO L290 TraceCheckUtils]: 22: Hoare triple {6318#false} assume 0 == ~cond; {6318#false} is VALID [2022-04-15 06:42:26,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {6318#false} ~cond := #in~cond; {6318#false} is VALID [2022-04-15 06:42:26,596 INFO L272 TraceCheckUtils]: 20: Hoare triple {6318#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {6318#false} is VALID [2022-04-15 06:42:26,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {6382#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6318#false} is VALID [2022-04-15 06:42:26,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {6382#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {6382#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:42:26,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {6382#(< 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; {6382#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:42:26,597 INFO L290 TraceCheckUtils]: 16: Hoare triple {6382#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {6382#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:42:26,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {6431#(< 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; {6382#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:42:26,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {6435#(< 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; {6431#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:42:26,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {6439#(< 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; {6435#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:42:26,600 INFO L290 TraceCheckUtils]: 12: Hoare triple {6439#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !(~z~0 % 4294967296 > 0); {6439#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 06:42:26,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {6435#(< 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; {6439#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 06:42:26,602 INFO L290 TraceCheckUtils]: 10: Hoare triple {6431#(< 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; {6435#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:42:26,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {6317#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; {6431#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:42:26,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {6317#true} ~z~0 := ~y~0; {6317#true} is VALID [2022-04-15 06:42:26,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {6317#true} [112] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {6317#true} is VALID [2022-04-15 06:42:26,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {6317#true} [113] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_140 4294967296)) (.cse1 (= |v_main_#t~post5_64| |v_main_#t~post5_63|)) (.cse2 (= v_main_~y~0_161 v_main_~y~0_160)) (.cse3 (= |v_main_#t~post6_64| |v_main_#t~post6_63|))) (or (and (< v_main_~x~0_139 v_main_~x~0_140) (< 0 .cse0) (= (+ v_main_~x~0_140 (* v_main_~x~0_139 (- 1)) v_main_~y~0_161) v_main_~y~0_160) (forall ((v_it_14 Int)) (or (not (<= 1 v_it_14)) (< 0 (mod (+ v_main_~x~0_140 (* 4294967295 v_it_14)) 4294967296)) (not (<= (+ v_main_~x~0_139 v_it_14 1) v_main_~x~0_140))))) (and (<= .cse0 0) .cse1 .cse2 .cse3 (= v_main_~x~0_139 v_main_~x~0_140)) (and .cse1 .cse2 .cse3 (= v_main_~x~0_140 v_main_~x~0_139)))) InVars {main_~y~0=v_main_~y~0_161, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_140, main_#t~post6=|v_main_#t~post6_64|} OutVars{main_~y~0=v_main_~y~0_160, main_#t~post5=|v_main_#t~post5_63|, main_~x~0=v_main_~x~0_139, main_#t~post6=|v_main_#t~post6_63|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6317#true} is VALID [2022-04-15 06:42:26,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {6317#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6317#true} is VALID [2022-04-15 06:42:26,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {6317#true} call #t~ret15 := main(); {6317#true} is VALID [2022-04-15 06:42:26,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6317#true} {6317#true} #83#return; {6317#true} is VALID [2022-04-15 06:42:26,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {6317#true} assume true; {6317#true} is VALID [2022-04-15 06:42:26,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {6317#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6317#true} is VALID [2022-04-15 06:42:26,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {6317#true} call ULTIMATE.init(); {6317#true} is VALID [2022-04-15 06:42:26,603 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:42:26,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081611904] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:26,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:26,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 6] total 18 [2022-04-15 06:42:26,771 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:26,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1450890204] [2022-04-15 06:42:26,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1450890204] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:26,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:26,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 06:42:26,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904091084] [2022-04-15 06:42:26,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:26,772 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 06:42:26,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:26,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:26,799 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-15 06:42:26,799 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 06:42:26,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:26,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 06:42:26,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-04-15 06:42:26,800 INFO L87 Difference]: Start difference. First operand 57 states and 78 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:28,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:28,185 INFO L93 Difference]: Finished difference Result 108 states and 159 transitions. [2022-04-15 06:42:28,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 06:42:28,185 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 06:42:28,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:28,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:28,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-04-15 06:42:28,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:28,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-04-15 06:42:28,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 78 transitions. [2022-04-15 06:42:28,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:28,294 INFO L225 Difference]: With dead ends: 108 [2022-04-15 06:42:28,294 INFO L226 Difference]: Without dead ends: 95 [2022-04-15 06:42:28,295 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992 [2022-04-15 06:42:28,295 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 90 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:42:28,295 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 42 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:42:28,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-15 06:42:28,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 71. [2022-04-15 06:42:28,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:28,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 71 states, 66 states have (on average 1.393939393939394) internal successors, (92), 66 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:28,647 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 71 states, 66 states have (on average 1.393939393939394) internal successors, (92), 66 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:28,647 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 71 states, 66 states have (on average 1.393939393939394) internal successors, (92), 66 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:28,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:28,649 INFO L93 Difference]: Finished difference Result 95 states and 132 transitions. [2022-04-15 06:42:28,649 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2022-04-15 06:42:28,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:28,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:28,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 66 states have (on average 1.393939393939394) internal successors, (92), 66 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 95 states. [2022-04-15 06:42:28,649 INFO L87 Difference]: Start difference. First operand has 71 states, 66 states have (on average 1.393939393939394) internal successors, (92), 66 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 95 states. [2022-04-15 06:42:28,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:28,651 INFO L93 Difference]: Finished difference Result 95 states and 132 transitions. [2022-04-15 06:42:28,651 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2022-04-15 06:42:28,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:28,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:28,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:28,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:28,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.393939393939394) internal successors, (92), 66 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:28,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 96 transitions. [2022-04-15 06:42:28,653 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 96 transitions. Word has length 26 [2022-04-15 06:42:28,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:28,653 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 96 transitions. [2022-04-15 06:42:28,653 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:28,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 96 transitions. [2022-04-15 06:42:31,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 95 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:31,554 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 96 transitions. [2022-04-15 06:42:31,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 06:42:31,554 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:31,554 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:31,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 06:42:31,754 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 06:42:31,755 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:31,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:31,755 INFO L85 PathProgramCache]: Analyzing trace with hash 62925025, now seen corresponding path program 6 times [2022-04-15 06:42:31,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:31,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [951247428] [2022-04-15 06:42:32,159 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-15 06:42:32,160 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:32,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1524035883, now seen corresponding path program 1 times [2022-04-15 06:42:32,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:32,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407934202] [2022-04-15 06:42:32,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:32,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:32,177 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-15 06:42:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:32,193 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-15 06:42:32,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:32,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {7062#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7054#true} is VALID [2022-04-15 06:42:32,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {7054#true} assume true; {7054#true} is VALID [2022-04-15 06:42:32,254 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7054#true} {7054#true} #83#return; {7054#true} is VALID [2022-04-15 06:42:32,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {7054#true} call ULTIMATE.init(); {7062#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:42:32,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {7062#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7054#true} is VALID [2022-04-15 06:42:32,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {7054#true} assume true; {7054#true} is VALID [2022-04-15 06:42:32,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7054#true} {7054#true} #83#return; {7054#true} is VALID [2022-04-15 06:42:32,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {7054#true} call #t~ret15 := main(); {7054#true} is VALID [2022-04-15 06:42:32,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {7054#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7054#true} is VALID [2022-04-15 06:42:32,255 INFO L290 TraceCheckUtils]: 6: Hoare triple {7054#true} [115] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_153 v_main_~x~0_152)) (.cse1 (= |v_main_#t~post5_69| |v_main_#t~post5_68|)) (.cse2 (= v_main_~y~0_177 v_main_~y~0_176)) (.cse4 (mod v_main_~x~0_153 4294967296)) (.cse3 (= |v_main_#t~post6_69| |v_main_#t~post6_68|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< 0 .cse4) (= v_main_~x~0_152 (+ v_main_~x~0_153 v_main_~y~0_177 (* (- 1) v_main_~y~0_176))) (< v_main_~y~0_177 v_main_~y~0_176) (forall ((v_it_15 Int)) (or (< 0 (mod (+ v_main_~x~0_153 (* 4294967295 v_it_15)) 4294967296)) (not (<= (+ v_main_~y~0_177 v_it_15 1) v_main_~y~0_176)) (not (<= 1 v_it_15))))) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3))) InVars {main_~y~0=v_main_~y~0_177, main_#t~post5=|v_main_#t~post5_69|, main_~x~0=v_main_~x~0_153, main_#t~post6=|v_main_#t~post6_69|} OutVars{main_~y~0=v_main_~y~0_176, main_#t~post5=|v_main_#t~post5_68|, main_~x~0=v_main_~x~0_152, main_#t~post6=|v_main_#t~post6_68|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7054#true} is VALID [2022-04-15 06:42:32,255 INFO L290 TraceCheckUtils]: 7: Hoare triple {7054#true} [114] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7054#true} is VALID [2022-04-15 06:42:32,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {7054#true} ~z~0 := ~y~0; {7054#true} is VALID [2022-04-15 06:42:32,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {7054#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; {7054#true} is VALID [2022-04-15 06:42:32,256 INFO L290 TraceCheckUtils]: 10: Hoare triple {7054#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; {7054#true} is VALID [2022-04-15 06:42:32,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {7054#true} assume !(~z~0 % 4294967296 > 0); {7059#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 06:42:32,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {7059#(<= 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; {7060#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 06:42:32,259 INFO L290 TraceCheckUtils]: 13: Hoare triple {7060#(<= 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; {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 06:42:32,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !(~y~0 % 4294967296 > 0); {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 06:42:32,260 INFO L290 TraceCheckUtils]: 15: Hoare triple {7061#(<= 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; {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 06:42:32,260 INFO L290 TraceCheckUtils]: 16: Hoare triple {7061#(<= 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; {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 06:42:32,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !(~x~0 % 4294967296 > 0); {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 06:42:32,262 INFO L290 TraceCheckUtils]: 18: Hoare triple {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7060#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 06:42:32,263 INFO L290 TraceCheckUtils]: 19: Hoare triple {7060#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7059#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 06:42:32,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {7059#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7055#false} is VALID [2022-04-15 06:42:32,264 INFO L290 TraceCheckUtils]: 21: Hoare triple {7055#false} assume !(~z~0 % 4294967296 > 0); {7055#false} is VALID [2022-04-15 06:42:32,264 INFO L272 TraceCheckUtils]: 22: Hoare triple {7055#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {7055#false} is VALID [2022-04-15 06:42:32,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {7055#false} ~cond := #in~cond; {7055#false} is VALID [2022-04-15 06:42:32,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {7055#false} assume 0 == ~cond; {7055#false} is VALID [2022-04-15 06:42:32,264 INFO L290 TraceCheckUtils]: 25: Hoare triple {7055#false} assume !false; {7055#false} is VALID [2022-04-15 06:42:32,264 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 06:42:32,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:32,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407934202] [2022-04-15 06:42:32,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407934202] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:32,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798294543] [2022-04-15 06:42:32,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:32,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:32,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:32,266 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-15 06:42:32,292 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-15 06:42:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:32,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 06:42:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:32,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:32,676 INFO L272 TraceCheckUtils]: 0: Hoare triple {7054#true} call ULTIMATE.init(); {7054#true} is VALID [2022-04-15 06:42:32,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {7054#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7054#true} is VALID [2022-04-15 06:42:32,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {7054#true} assume true; {7054#true} is VALID [2022-04-15 06:42:32,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7054#true} {7054#true} #83#return; {7054#true} is VALID [2022-04-15 06:42:32,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {7054#true} call #t~ret15 := main(); {7054#true} is VALID [2022-04-15 06:42:32,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {7054#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7054#true} is VALID [2022-04-15 06:42:32,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {7054#true} [115] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_153 v_main_~x~0_152)) (.cse1 (= |v_main_#t~post5_69| |v_main_#t~post5_68|)) (.cse2 (= v_main_~y~0_177 v_main_~y~0_176)) (.cse4 (mod v_main_~x~0_153 4294967296)) (.cse3 (= |v_main_#t~post6_69| |v_main_#t~post6_68|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< 0 .cse4) (= v_main_~x~0_152 (+ v_main_~x~0_153 v_main_~y~0_177 (* (- 1) v_main_~y~0_176))) (< v_main_~y~0_177 v_main_~y~0_176) (forall ((v_it_15 Int)) (or (< 0 (mod (+ v_main_~x~0_153 (* 4294967295 v_it_15)) 4294967296)) (not (<= (+ v_main_~y~0_177 v_it_15 1) v_main_~y~0_176)) (not (<= 1 v_it_15))))) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3))) InVars {main_~y~0=v_main_~y~0_177, main_#t~post5=|v_main_#t~post5_69|, main_~x~0=v_main_~x~0_153, main_#t~post6=|v_main_#t~post6_69|} OutVars{main_~y~0=v_main_~y~0_176, main_#t~post5=|v_main_#t~post5_68|, main_~x~0=v_main_~x~0_152, main_#t~post6=|v_main_#t~post6_68|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7054#true} is VALID [2022-04-15 06:42:32,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {7054#true} [114] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7054#true} is VALID [2022-04-15 06:42:32,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {7054#true} ~z~0 := ~y~0; {7090#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:42:32,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {7090#(= 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; {7094#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:42:32,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {7094#(= 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; {7098#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:42:32,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {7098#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {7098#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:42:32,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {7098#(= (+ 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; {7090#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:42:32,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {7090#(= 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; {7108#(= (+ (- 1) main_~z~0) (+ main_~y~0 1))} is VALID [2022-04-15 06:42:32,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {7108#(= (+ (- 1) main_~z~0) (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 06:42:32,682 INFO L290 TraceCheckUtils]: 15: Hoare triple {7061#(<= 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; {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 06:42:32,683 INFO L290 TraceCheckUtils]: 16: Hoare triple {7061#(<= 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; {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 06:42:32,683 INFO L290 TraceCheckUtils]: 17: Hoare triple {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !(~x~0 % 4294967296 > 0); {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 06:42:32,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7060#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 06:42:32,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {7060#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7059#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 06:42:32,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {7059#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7055#false} is VALID [2022-04-15 06:42:32,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {7055#false} assume !(~z~0 % 4294967296 > 0); {7055#false} is VALID [2022-04-15 06:42:32,687 INFO L272 TraceCheckUtils]: 22: Hoare triple {7055#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {7055#false} is VALID [2022-04-15 06:42:32,687 INFO L290 TraceCheckUtils]: 23: Hoare triple {7055#false} ~cond := #in~cond; {7055#false} is VALID [2022-04-15 06:42:32,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {7055#false} assume 0 == ~cond; {7055#false} is VALID [2022-04-15 06:42:32,687 INFO L290 TraceCheckUtils]: 25: Hoare triple {7055#false} assume !false; {7055#false} is VALID [2022-04-15 06:42:32,687 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 06:42:32,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:33,098 INFO L290 TraceCheckUtils]: 25: Hoare triple {7055#false} assume !false; {7055#false} is VALID [2022-04-15 06:42:33,099 INFO L290 TraceCheckUtils]: 24: Hoare triple {7055#false} assume 0 == ~cond; {7055#false} is VALID [2022-04-15 06:42:33,099 INFO L290 TraceCheckUtils]: 23: Hoare triple {7055#false} ~cond := #in~cond; {7055#false} is VALID [2022-04-15 06:42:33,099 INFO L272 TraceCheckUtils]: 22: Hoare triple {7055#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {7055#false} is VALID [2022-04-15 06:42:33,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {7055#false} assume !(~z~0 % 4294967296 > 0); {7055#false} is VALID [2022-04-15 06:42:33,099 INFO L290 TraceCheckUtils]: 20: Hoare triple {7059#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7055#false} is VALID [2022-04-15 06:42:33,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {7060#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7059#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 06:42:33,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7060#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 06:42:33,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !(~x~0 % 4294967296 > 0); {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 06:42:33,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {7061#(<= 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; {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 06:42:33,103 INFO L290 TraceCheckUtils]: 15: Hoare triple {7061#(<= 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; {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 06:42:33,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {7178#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2)) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 06:42:33,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {7182#(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; {7178#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:42:33,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {7186#(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; {7182#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:42:33,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {7186#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {7186#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:33,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {7193#(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; {7186#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:33,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {7197#(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; {7193#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1)))} is VALID [2022-04-15 06:42:33,111 INFO L290 TraceCheckUtils]: 8: Hoare triple {7054#true} ~z~0 := ~y~0; {7197#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2)) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-15 06:42:33,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {7054#true} [114] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7054#true} is VALID [2022-04-15 06:42:33,112 INFO L290 TraceCheckUtils]: 6: Hoare triple {7054#true} [115] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_153 v_main_~x~0_152)) (.cse1 (= |v_main_#t~post5_69| |v_main_#t~post5_68|)) (.cse2 (= v_main_~y~0_177 v_main_~y~0_176)) (.cse4 (mod v_main_~x~0_153 4294967296)) (.cse3 (= |v_main_#t~post6_69| |v_main_#t~post6_68|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< 0 .cse4) (= v_main_~x~0_152 (+ v_main_~x~0_153 v_main_~y~0_177 (* (- 1) v_main_~y~0_176))) (< v_main_~y~0_177 v_main_~y~0_176) (forall ((v_it_15 Int)) (or (< 0 (mod (+ v_main_~x~0_153 (* 4294967295 v_it_15)) 4294967296)) (not (<= (+ v_main_~y~0_177 v_it_15 1) v_main_~y~0_176)) (not (<= 1 v_it_15))))) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3))) InVars {main_~y~0=v_main_~y~0_177, main_#t~post5=|v_main_#t~post5_69|, main_~x~0=v_main_~x~0_153, main_#t~post6=|v_main_#t~post6_69|} OutVars{main_~y~0=v_main_~y~0_176, main_#t~post5=|v_main_#t~post5_68|, main_~x~0=v_main_~x~0_152, main_#t~post6=|v_main_#t~post6_68|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7054#true} is VALID [2022-04-15 06:42:33,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {7054#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7054#true} is VALID [2022-04-15 06:42:33,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {7054#true} call #t~ret15 := main(); {7054#true} is VALID [2022-04-15 06:42:33,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7054#true} {7054#true} #83#return; {7054#true} is VALID [2022-04-15 06:42:33,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {7054#true} assume true; {7054#true} is VALID [2022-04-15 06:42:33,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {7054#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7054#true} is VALID [2022-04-15 06:42:33,112 INFO L272 TraceCheckUtils]: 0: Hoare triple {7054#true} call ULTIMATE.init(); {7054#true} is VALID [2022-04-15 06:42:33,112 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 06:42:33,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798294543] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:33,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:33,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 10] total 15 [2022-04-15 06:42:33,174 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:33,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [951247428] [2022-04-15 06:42:33,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [951247428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:33,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:33,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:42:33,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405107481] [2022-04-15 06:42:33,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:33,175 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 06:42:33,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:33,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:33,196 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-15 06:42:33,196 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:42:33,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:33,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:42:33,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-04-15 06:42:33,197 INFO L87 Difference]: Start difference. First operand 71 states and 96 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:34,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:34,089 INFO L93 Difference]: Finished difference Result 81 states and 107 transitions. [2022-04-15 06:42:34,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 06:42:34,090 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 06:42:34,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:34,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:34,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 49 transitions. [2022-04-15 06:42:34,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:34,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 49 transitions. [2022-04-15 06:42:34,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 49 transitions. [2022-04-15 06:42:34,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:34,165 INFO L225 Difference]: With dead ends: 81 [2022-04-15 06:42:34,165 INFO L226 Difference]: Without dead ends: 62 [2022-04-15 06:42:34,166 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2022-04-15 06:42:34,166 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 26 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:42:34,167 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 43 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:42:34,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-15 06:42:34,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-04-15 06:42:34,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:34,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 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-15 06:42:34,480 INFO L74 IsIncluded]: Start isIncluded. First operand 62 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-15 06:42:34,481 INFO L87 Difference]: Start difference. First operand 62 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-15 06:42:34,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:34,481 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2022-04-15 06:42:34,481 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 84 transitions. [2022-04-15 06:42:34,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:34,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:34,482 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 62 states. [2022-04-15 06:42:34,482 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 62 states. [2022-04-15 06:42:34,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:34,491 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2022-04-15 06:42:34,491 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 84 transitions. [2022-04-15 06:42:34,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:34,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:34,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:34,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:34,492 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-15 06:42:34,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 84 transitions. [2022-04-15 06:42:34,493 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 84 transitions. Word has length 27 [2022-04-15 06:42:34,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:34,493 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 84 transitions. [2022-04-15 06:42:34,494 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:34,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 84 transitions. [2022-04-15 06:42:36,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:36,560 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 84 transitions. [2022-04-15 06:42:36,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 06:42:36,560 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:36,560 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:36,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-15 06:42:36,760 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:36,761 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:36,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:36,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1678337854, now seen corresponding path program 6 times [2022-04-15 06:42:36,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:36,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [908477263] [2022-04-15 06:42:36,971 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-15 06:42:36,973 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:36,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1997393475, now seen corresponding path program 1 times [2022-04-15 06:42:36,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:36,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567407918] [2022-04-15 06:42:36,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:36,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:36,983 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-15 06:42:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:36,998 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-15 06:42:37,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:37,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:37,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {7670#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7659#true} is VALID [2022-04-15 06:42:37,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {7659#true} assume true; {7659#true} is VALID [2022-04-15 06:42:37,093 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7659#true} {7659#true} #83#return; {7659#true} is VALID [2022-04-15 06:42:37,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {7659#true} call ULTIMATE.init(); {7670#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:42:37,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {7670#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7659#true} is VALID [2022-04-15 06:42:37,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {7659#true} assume true; {7659#true} is VALID [2022-04-15 06:42:37,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7659#true} {7659#true} #83#return; {7659#true} is VALID [2022-04-15 06:42:37,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {7659#true} call #t~ret15 := main(); {7659#true} is VALID [2022-04-15 06:42:37,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {7659#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7659#true} is VALID [2022-04-15 06:42:37,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {7659#true} [117] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_165 4294967296)) (.cse0 (= v_main_~y~0_195 v_main_~y~0_194)) (.cse1 (= v_main_~x~0_165 v_main_~x~0_164)) (.cse2 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse4 (= |v_main_#t~post5_74| |v_main_#t~post5_73|))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (= v_main_~y~0_194 (+ v_main_~x~0_165 v_main_~y~0_195 (* v_main_~x~0_164 (- 1)))) (< 0 .cse3) (< v_main_~x~0_164 v_main_~x~0_165) (forall ((v_it_16 Int)) (or (not (<= (+ v_main_~x~0_164 v_it_16 1) v_main_~x~0_165)) (< 0 (mod (+ v_main_~x~0_165 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16))))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_195, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_165, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_194, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_164, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7659#true} is VALID [2022-04-15 06:42:37,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {7659#true} [116] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7664#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:42:37,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {7664#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {7664#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:42:37,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {7664#(<= 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; {7665#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:42:37,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {7665#(<= 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; {7666#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:37,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {7666#(<= 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; {7667#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:37,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {7667#(<= 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; {7668#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:37,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {7668#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {7668#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:37,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {7668#(<= 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; {7668#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:37,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {7668#(<= 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; {7668#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:37,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {7668#(<= 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; {7668#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:37,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {7668#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {7668#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:37,101 INFO L290 TraceCheckUtils]: 18: Hoare triple {7668#(<= 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; {7669#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 06:42:37,101 INFO L290 TraceCheckUtils]: 19: Hoare triple {7669#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {7660#false} is VALID [2022-04-15 06:42:37,101 INFO L290 TraceCheckUtils]: 20: Hoare triple {7660#false} assume !(~z~0 % 4294967296 > 0); {7660#false} is VALID [2022-04-15 06:42:37,101 INFO L272 TraceCheckUtils]: 21: Hoare triple {7660#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {7660#false} is VALID [2022-04-15 06:42:37,102 INFO L290 TraceCheckUtils]: 22: Hoare triple {7660#false} ~cond := #in~cond; {7660#false} is VALID [2022-04-15 06:42:37,102 INFO L290 TraceCheckUtils]: 23: Hoare triple {7660#false} assume 0 == ~cond; {7660#false} is VALID [2022-04-15 06:42:37,102 INFO L290 TraceCheckUtils]: 24: Hoare triple {7660#false} assume !false; {7660#false} is VALID [2022-04-15 06:42:37,102 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 06:42:37,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:37,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567407918] [2022-04-15 06:42:37,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567407918] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:37,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444188178] [2022-04-15 06:42:37,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:37,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:37,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:37,103 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-15 06:42:37,104 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-15 06:42:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:37,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 06:42:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:37,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:37,335 INFO L272 TraceCheckUtils]: 0: Hoare triple {7659#true} call ULTIMATE.init(); {7659#true} is VALID [2022-04-15 06:42:37,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {7659#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7659#true} is VALID [2022-04-15 06:42:37,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {7659#true} assume true; {7659#true} is VALID [2022-04-15 06:42:37,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7659#true} {7659#true} #83#return; {7659#true} is VALID [2022-04-15 06:42:37,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {7659#true} call #t~ret15 := main(); {7659#true} is VALID [2022-04-15 06:42:37,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {7659#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7659#true} is VALID [2022-04-15 06:42:37,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {7659#true} [117] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_165 4294967296)) (.cse0 (= v_main_~y~0_195 v_main_~y~0_194)) (.cse1 (= v_main_~x~0_165 v_main_~x~0_164)) (.cse2 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse4 (= |v_main_#t~post5_74| |v_main_#t~post5_73|))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (= v_main_~y~0_194 (+ v_main_~x~0_165 v_main_~y~0_195 (* v_main_~x~0_164 (- 1)))) (< 0 .cse3) (< v_main_~x~0_164 v_main_~x~0_165) (forall ((v_it_16 Int)) (or (not (<= (+ v_main_~x~0_164 v_it_16 1) v_main_~x~0_165)) (< 0 (mod (+ v_main_~x~0_165 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16))))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_195, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_165, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_194, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_164, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7659#true} is VALID [2022-04-15 06:42:37,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {7659#true} [116] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7659#true} is VALID [2022-04-15 06:42:37,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {7659#true} ~z~0 := ~y~0; {7698#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:42:37,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {7698#(= 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; {7702#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:42:37,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {7702#(= 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; {7706#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-15 06:42:37,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {7706#(= 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; {7710#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-15 06:42:37,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {7710#(= (+ (- 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; {7714#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-15 06:42:37,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {7714#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~z~0 % 4294967296 > 0); {7714#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-15 06:42:37,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {7714#(< 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; {7721#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:42:37,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {7721#(< 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; {7725#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:42:37,341 INFO L290 TraceCheckUtils]: 16: Hoare triple {7725#(< 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; {7729#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:42:37,342 INFO L290 TraceCheckUtils]: 17: Hoare triple {7729#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {7660#false} is VALID [2022-04-15 06:42:37,342 INFO L290 TraceCheckUtils]: 18: Hoare triple {7660#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; {7660#false} is VALID [2022-04-15 06:42:37,342 INFO L290 TraceCheckUtils]: 19: Hoare triple {7660#false} assume !(~x~0 % 4294967296 > 0); {7660#false} is VALID [2022-04-15 06:42:37,342 INFO L290 TraceCheckUtils]: 20: Hoare triple {7660#false} assume !(~z~0 % 4294967296 > 0); {7660#false} is VALID [2022-04-15 06:42:37,342 INFO L272 TraceCheckUtils]: 21: Hoare triple {7660#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {7660#false} is VALID [2022-04-15 06:42:37,342 INFO L290 TraceCheckUtils]: 22: Hoare triple {7660#false} ~cond := #in~cond; {7660#false} is VALID [2022-04-15 06:42:37,342 INFO L290 TraceCheckUtils]: 23: Hoare triple {7660#false} assume 0 == ~cond; {7660#false} is VALID [2022-04-15 06:42:37,342 INFO L290 TraceCheckUtils]: 24: Hoare triple {7660#false} assume !false; {7660#false} is VALID [2022-04-15 06:42:37,342 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:42:37,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:37,556 INFO L290 TraceCheckUtils]: 24: Hoare triple {7660#false} assume !false; {7660#false} is VALID [2022-04-15 06:42:37,556 INFO L290 TraceCheckUtils]: 23: Hoare triple {7660#false} assume 0 == ~cond; {7660#false} is VALID [2022-04-15 06:42:37,556 INFO L290 TraceCheckUtils]: 22: Hoare triple {7660#false} ~cond := #in~cond; {7660#false} is VALID [2022-04-15 06:42:37,557 INFO L272 TraceCheckUtils]: 21: Hoare triple {7660#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {7660#false} is VALID [2022-04-15 06:42:37,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {7660#false} assume !(~z~0 % 4294967296 > 0); {7660#false} is VALID [2022-04-15 06:42:37,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {7660#false} assume !(~x~0 % 4294967296 > 0); {7660#false} is VALID [2022-04-15 06:42:37,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {7660#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; {7660#false} is VALID [2022-04-15 06:42:37,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {7729#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {7660#false} is VALID [2022-04-15 06:42:37,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {7725#(< 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; {7729#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:42:37,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {7721#(< 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; {7725#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:42:37,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {7714#(< 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; {7721#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:42:37,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {7714#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~z~0 % 4294967296 > 0); {7714#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-15 06:42:37,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {7790#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7714#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-15 06:42:37,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {7794#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7790#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:42:37,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {7798#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7794#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:42:37,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {7802#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7798#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:42:37,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {7659#true} ~z~0 := ~y~0; {7802#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:42:37,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {7659#true} [116] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7659#true} is VALID [2022-04-15 06:42:37,565 INFO L290 TraceCheckUtils]: 6: Hoare triple {7659#true} [117] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_165 4294967296)) (.cse0 (= v_main_~y~0_195 v_main_~y~0_194)) (.cse1 (= v_main_~x~0_165 v_main_~x~0_164)) (.cse2 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse4 (= |v_main_#t~post5_74| |v_main_#t~post5_73|))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (= v_main_~y~0_194 (+ v_main_~x~0_165 v_main_~y~0_195 (* v_main_~x~0_164 (- 1)))) (< 0 .cse3) (< v_main_~x~0_164 v_main_~x~0_165) (forall ((v_it_16 Int)) (or (not (<= (+ v_main_~x~0_164 v_it_16 1) v_main_~x~0_165)) (< 0 (mod (+ v_main_~x~0_165 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16))))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_195, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_165, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_194, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_164, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7659#true} is VALID [2022-04-15 06:42:37,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {7659#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7659#true} is VALID [2022-04-15 06:42:37,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {7659#true} call #t~ret15 := main(); {7659#true} is VALID [2022-04-15 06:42:37,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7659#true} {7659#true} #83#return; {7659#true} is VALID [2022-04-15 06:42:37,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {7659#true} assume true; {7659#true} is VALID [2022-04-15 06:42:37,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {7659#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7659#true} is VALID [2022-04-15 06:42:37,565 INFO L272 TraceCheckUtils]: 0: Hoare triple {7659#true} call ULTIMATE.init(); {7659#true} is VALID [2022-04-15 06:42:37,565 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:42:37,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444188178] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:37,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:37,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 21 [2022-04-15 06:42:37,744 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:37,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [908477263] [2022-04-15 06:42:37,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [908477263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:37,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:37,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 06:42:37,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6212258] [2022-04-15 06:42:37,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:37,745 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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-15 06:42:37,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:37,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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-15 06:42:37,770 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-15 06:42:37,770 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 06:42:37,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:37,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 06:42:37,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2022-04-15 06:42:37,771 INFO L87 Difference]: Start difference. First operand 62 states and 84 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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-15 06:42:39,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:39,519 INFO L93 Difference]: Finished difference Result 115 states and 164 transitions. [2022-04-15 06:42:39,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 06:42:39,520 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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-15 06:42:39,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:39,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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-15 06:42:39,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2022-04-15 06:42:39,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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-15 06:42:39,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2022-04-15 06:42:39,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 79 transitions. [2022-04-15 06:42:39,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:39,696 INFO L225 Difference]: With dead ends: 115 [2022-04-15 06:42:39,696 INFO L226 Difference]: Without dead ends: 101 [2022-04-15 06:42:39,697 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=185, Invalid=1075, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 06:42:39,697 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 98 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:42:39,698 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 37 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:42:39,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-15 06:42:40,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 69. [2022-04-15 06:42:40,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:40,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 69 states, 64 states have (on average 1.40625) internal successors, (90), 64 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:40,128 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 69 states, 64 states have (on average 1.40625) internal successors, (90), 64 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:40,128 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 69 states, 64 states have (on average 1.40625) internal successors, (90), 64 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:40,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:40,129 INFO L93 Difference]: Finished difference Result 101 states and 137 transitions. [2022-04-15 06:42:40,129 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 137 transitions. [2022-04-15 06:42:40,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:40,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:40,130 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 64 states have (on average 1.40625) internal successors, (90), 64 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 101 states. [2022-04-15 06:42:40,130 INFO L87 Difference]: Start difference. First operand has 69 states, 64 states have (on average 1.40625) internal successors, (90), 64 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 101 states. [2022-04-15 06:42:40,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:40,131 INFO L93 Difference]: Finished difference Result 101 states and 137 transitions. [2022-04-15 06:42:40,131 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 137 transitions. [2022-04-15 06:42:40,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:40,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:40,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:40,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:40,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.40625) internal successors, (90), 64 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:40,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 94 transitions. [2022-04-15 06:42:40,133 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 94 transitions. Word has length 27 [2022-04-15 06:42:40,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:40,133 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 94 transitions. [2022-04-15 06:42:40,133 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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-15 06:42:40,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 94 transitions. [2022-04-15 06:42:43,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 93 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:43,543 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 94 transitions. [2022-04-15 06:42:43,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 06:42:43,543 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:43,543 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:43,560 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-15 06:42:43,744 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:43,744 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:43,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:43,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1788990354, now seen corresponding path program 7 times [2022-04-15 06:42:43,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:43,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1977322473] [2022-04-15 06:42:43,943 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:42:43,944 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:43,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1298843955, now seen corresponding path program 1 times [2022-04-15 06:42:43,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:43,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135620290] [2022-04-15 06:42:43,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:43,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:43,954 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-15 06:42:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:43,970 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-15 06:42:44,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:44,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {8440#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8429#true} is VALID [2022-04-15 06:42:44,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {8429#true} assume true; {8429#true} is VALID [2022-04-15 06:42:44,065 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8429#true} {8429#true} #83#return; {8429#true} is VALID [2022-04-15 06:42:44,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {8429#true} call ULTIMATE.init(); {8440#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:42:44,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {8440#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8429#true} is VALID [2022-04-15 06:42:44,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {8429#true} assume true; {8429#true} is VALID [2022-04-15 06:42:44,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8429#true} {8429#true} #83#return; {8429#true} is VALID [2022-04-15 06:42:44,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {8429#true} call #t~ret15 := main(); {8429#true} is VALID [2022-04-15 06:42:44,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {8429#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8429#true} is VALID [2022-04-15 06:42:44,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {8429#true} [119] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_179 v_main_~x~0_178)) (.cse1 (= |v_main_#t~post6_79| |v_main_#t~post6_78|)) (.cse2 (= v_main_~y~0_211 v_main_~y~0_210)) (.cse3 (= |v_main_#t~post5_79| |v_main_#t~post5_78|)) (.cse4 (mod v_main_~x~0_179 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3) (and (forall ((v_it_17 Int)) (or (not (<= 1 v_it_17)) (< 0 (mod (+ v_main_~x~0_179 (* 4294967295 v_it_17)) 4294967296)) (not (<= (+ v_main_~x~0_178 v_it_17 1) v_main_~x~0_179)))) (< 0 .cse4) (= v_main_~y~0_210 (+ v_main_~x~0_179 v_main_~y~0_211 (* v_main_~x~0_178 (- 1)))) (< v_main_~x~0_178 v_main_~x~0_179)))) InVars {main_~y~0=v_main_~y~0_211, main_#t~post5=|v_main_#t~post5_79|, main_~x~0=v_main_~x~0_179, main_#t~post6=|v_main_#t~post6_79|} OutVars{main_~y~0=v_main_~y~0_210, main_#t~post5=|v_main_#t~post5_78|, main_~x~0=v_main_~x~0_178, main_#t~post6=|v_main_#t~post6_78|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8429#true} is VALID [2022-04-15 06:42:44,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {8429#true} [118] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {8429#true} is VALID [2022-04-15 06:42:44,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {8429#true} ~z~0 := ~y~0; {8429#true} is VALID [2022-04-15 06:42:44,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {8429#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; {8434#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:44,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {8434#(<= 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; {8435#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 06:42:44,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {8435#(<= 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; {8436#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:44,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {8436#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8436#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:44,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {8436#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8437#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 4294967293))} is VALID [2022-04-15 06:42:44,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {8437#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8438#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967294))} is VALID [2022-04-15 06:42:44,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {8438#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967294))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8439#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:42:44,074 INFO L290 TraceCheckUtils]: 16: Hoare triple {8439#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {8439#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:42:44,074 INFO L290 TraceCheckUtils]: 17: Hoare triple {8439#(<= (+ 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; {8439#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:42:44,074 INFO L290 TraceCheckUtils]: 18: Hoare triple {8439#(<= (+ 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; {8439#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:42:44,075 INFO L290 TraceCheckUtils]: 19: Hoare triple {8439#(<= (+ 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; {8439#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:42:44,075 INFO L290 TraceCheckUtils]: 20: Hoare triple {8439#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {8439#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:42:44,075 INFO L290 TraceCheckUtils]: 21: Hoare triple {8439#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {8430#false} is VALID [2022-04-15 06:42:44,076 INFO L272 TraceCheckUtils]: 22: Hoare triple {8430#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {8430#false} is VALID [2022-04-15 06:42:44,076 INFO L290 TraceCheckUtils]: 23: Hoare triple {8430#false} ~cond := #in~cond; {8430#false} is VALID [2022-04-15 06:42:44,076 INFO L290 TraceCheckUtils]: 24: Hoare triple {8430#false} assume 0 == ~cond; {8430#false} is VALID [2022-04-15 06:42:44,076 INFO L290 TraceCheckUtils]: 25: Hoare triple {8430#false} assume !false; {8430#false} is VALID [2022-04-15 06:42:44,076 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 06:42:44,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:44,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135620290] [2022-04-15 06:42:44,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135620290] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:44,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790074582] [2022-04-15 06:42:44,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:44,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:44,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:44,077 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-15 06:42:44,078 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-15 06:42:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:44,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 06:42:44,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:44,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:44,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {8429#true} call ULTIMATE.init(); {8429#true} is VALID [2022-04-15 06:42:44,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {8429#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8429#true} is VALID [2022-04-15 06:42:44,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {8429#true} assume true; {8429#true} is VALID [2022-04-15 06:42:44,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8429#true} {8429#true} #83#return; {8429#true} is VALID [2022-04-15 06:42:44,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {8429#true} call #t~ret15 := main(); {8429#true} is VALID [2022-04-15 06:42:44,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {8429#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8429#true} is VALID [2022-04-15 06:42:44,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {8429#true} [119] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_179 v_main_~x~0_178)) (.cse1 (= |v_main_#t~post6_79| |v_main_#t~post6_78|)) (.cse2 (= v_main_~y~0_211 v_main_~y~0_210)) (.cse3 (= |v_main_#t~post5_79| |v_main_#t~post5_78|)) (.cse4 (mod v_main_~x~0_179 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3) (and (forall ((v_it_17 Int)) (or (not (<= 1 v_it_17)) (< 0 (mod (+ v_main_~x~0_179 (* 4294967295 v_it_17)) 4294967296)) (not (<= (+ v_main_~x~0_178 v_it_17 1) v_main_~x~0_179)))) (< 0 .cse4) (= v_main_~y~0_210 (+ v_main_~x~0_179 v_main_~y~0_211 (* v_main_~x~0_178 (- 1)))) (< v_main_~x~0_178 v_main_~x~0_179)))) InVars {main_~y~0=v_main_~y~0_211, main_#t~post5=|v_main_#t~post5_79|, main_~x~0=v_main_~x~0_179, main_#t~post6=|v_main_#t~post6_79|} OutVars{main_~y~0=v_main_~y~0_210, main_#t~post5=|v_main_#t~post5_78|, main_~x~0=v_main_~x~0_178, main_#t~post6=|v_main_#t~post6_78|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8429#true} is VALID [2022-04-15 06:42:44,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {8429#true} [118] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {8429#true} is VALID [2022-04-15 06:42:44,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {8429#true} ~z~0 := ~y~0; {8468#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:42:44,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {8468#(= 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; {8472#(and (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:42:44,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {8472#(and (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8476#(and (= main_~y~0 (+ main_~z~0 2)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:42:44,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {8476#(and (= main_~y~0 (+ main_~z~0 2)) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8480#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:42:44,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {8480#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8480#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:42:44,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {8480#(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; {8487#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= (+ main_~z~0 2) (+ main_~y~0 1)))} is VALID [2022-04-15 06:42:44,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {8487#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= (+ main_~z~0 2) (+ main_~y~0 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8491#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~z~0 (+ main_~y~0 1)))} is VALID [2022-04-15 06:42:44,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {8491#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~z~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; {8495#(and (< 0 (mod (+ main_~y~0 3) 4294967296)) (= main_~z~0 (+ main_~y~0 3)))} is VALID [2022-04-15 06:42:44,420 INFO L290 TraceCheckUtils]: 16: Hoare triple {8495#(and (< 0 (mod (+ main_~y~0 3) 4294967296)) (= main_~z~0 (+ main_~y~0 3)))} assume !(~y~0 % 4294967296 > 0); {8495#(and (< 0 (mod (+ main_~y~0 3) 4294967296)) (= main_~z~0 (+ main_~y~0 3)))} is VALID [2022-04-15 06:42:44,421 INFO L290 TraceCheckUtils]: 17: Hoare triple {8495#(and (< 0 (mod (+ main_~y~0 3) 4294967296)) (= main_~z~0 (+ main_~y~0 3)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8502#(and (< 0 (mod (+ main_~y~0 2) 4294967296)) (= (+ main_~y~0 2) main_~z~0))} is VALID [2022-04-15 06:42:44,421 INFO L290 TraceCheckUtils]: 18: Hoare triple {8502#(and (< 0 (mod (+ main_~y~0 2) 4294967296)) (= (+ main_~y~0 2) 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; {8506#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= main_~z~0 (+ main_~y~0 1)))} is VALID [2022-04-15 06:42:44,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {8506#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= 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; {8510#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:42:44,422 INFO L290 TraceCheckUtils]: 20: Hoare triple {8510#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {8510#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:42:44,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {8510#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {8430#false} is VALID [2022-04-15 06:42:44,423 INFO L272 TraceCheckUtils]: 22: Hoare triple {8430#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {8430#false} is VALID [2022-04-15 06:42:44,423 INFO L290 TraceCheckUtils]: 23: Hoare triple {8430#false} ~cond := #in~cond; {8430#false} is VALID [2022-04-15 06:42:44,423 INFO L290 TraceCheckUtils]: 24: Hoare triple {8430#false} assume 0 == ~cond; {8430#false} is VALID [2022-04-15 06:42:44,423 INFO L290 TraceCheckUtils]: 25: Hoare triple {8430#false} assume !false; {8430#false} is VALID [2022-04-15 06:42:44,423 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:42:44,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:44,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {8430#false} assume !false; {8430#false} is VALID [2022-04-15 06:42:44,573 INFO L290 TraceCheckUtils]: 24: Hoare triple {8430#false} assume 0 == ~cond; {8430#false} is VALID [2022-04-15 06:42:44,573 INFO L290 TraceCheckUtils]: 23: Hoare triple {8430#false} ~cond := #in~cond; {8430#false} is VALID [2022-04-15 06:42:44,573 INFO L272 TraceCheckUtils]: 22: Hoare triple {8430#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {8430#false} is VALID [2022-04-15 06:42:44,573 INFO L290 TraceCheckUtils]: 21: Hoare triple {8510#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {8430#false} is VALID [2022-04-15 06:42:44,573 INFO L290 TraceCheckUtils]: 20: Hoare triple {8510#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {8510#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:42:44,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {8510#(< 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; {8510#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:42:44,574 INFO L290 TraceCheckUtils]: 18: Hoare triple {8510#(< 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; {8510#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:42:44,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {8510#(< 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; {8510#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:42:44,575 INFO L290 TraceCheckUtils]: 16: Hoare triple {8510#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {8510#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:42:44,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {8434#(<= 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; {8510#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:42:44,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {8562#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8434#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:44,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {8566#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 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; {8562#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 06:42:44,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {8566#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8566#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:44,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {8562#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 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; {8566#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:44,579 INFO L290 TraceCheckUtils]: 10: Hoare triple {8434#(<= 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; {8562#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 06:42:44,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {8429#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; {8434#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:44,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {8429#true} ~z~0 := ~y~0; {8429#true} is VALID [2022-04-15 06:42:44,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {8429#true} [118] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {8429#true} is VALID [2022-04-15 06:42:44,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {8429#true} [119] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_179 v_main_~x~0_178)) (.cse1 (= |v_main_#t~post6_79| |v_main_#t~post6_78|)) (.cse2 (= v_main_~y~0_211 v_main_~y~0_210)) (.cse3 (= |v_main_#t~post5_79| |v_main_#t~post5_78|)) (.cse4 (mod v_main_~x~0_179 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3) (and (forall ((v_it_17 Int)) (or (not (<= 1 v_it_17)) (< 0 (mod (+ v_main_~x~0_179 (* 4294967295 v_it_17)) 4294967296)) (not (<= (+ v_main_~x~0_178 v_it_17 1) v_main_~x~0_179)))) (< 0 .cse4) (= v_main_~y~0_210 (+ v_main_~x~0_179 v_main_~y~0_211 (* v_main_~x~0_178 (- 1)))) (< v_main_~x~0_178 v_main_~x~0_179)))) InVars {main_~y~0=v_main_~y~0_211, main_#t~post5=|v_main_#t~post5_79|, main_~x~0=v_main_~x~0_179, main_#t~post6=|v_main_#t~post6_79|} OutVars{main_~y~0=v_main_~y~0_210, main_#t~post5=|v_main_#t~post5_78|, main_~x~0=v_main_~x~0_178, main_#t~post6=|v_main_#t~post6_78|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8429#true} is VALID [2022-04-15 06:42:44,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {8429#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8429#true} is VALID [2022-04-15 06:42:44,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {8429#true} call #t~ret15 := main(); {8429#true} is VALID [2022-04-15 06:42:44,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8429#true} {8429#true} #83#return; {8429#true} is VALID [2022-04-15 06:42:44,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {8429#true} assume true; {8429#true} is VALID [2022-04-15 06:42:44,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {8429#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8429#true} is VALID [2022-04-15 06:42:44,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {8429#true} call ULTIMATE.init(); {8429#true} is VALID [2022-04-15 06:42:44,581 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-15 06:42:44,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790074582] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:44,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:44,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 6] total 21 [2022-04-15 06:42:44,715 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:44,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1977322473] [2022-04-15 06:42:44,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1977322473] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:44,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:44,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 06:42:44,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509281078] [2022-04-15 06:42:44,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:44,716 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-15 06:42:44,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:44,716 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-15 06:42:44,746 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-15 06:42:44,746 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 06:42:44,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:44,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 06:42:44,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2022-04-15 06:42:44,746 INFO L87 Difference]: Start difference. First operand 69 states and 94 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-15 06:42:46,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:46,697 INFO L93 Difference]: Finished difference Result 112 states and 154 transitions. [2022-04-15 06:42:46,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 06:42:46,697 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-15 06:42:46,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:46,697 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-15 06:42:46,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 70 transitions. [2022-04-15 06:42:46,699 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-15 06:42:46,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 70 transitions. [2022-04-15 06:42:46,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 70 transitions. [2022-04-15 06:42:46,852 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-15 06:42:46,853 INFO L225 Difference]: With dead ends: 112 [2022-04-15 06:42:46,853 INFO L226 Difference]: Without dead ends: 107 [2022-04-15 06:42:46,854 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=266, Invalid=1540, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 06:42:46,855 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 63 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:42:46,855 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 38 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:42:46,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-15 06:42:47,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 82. [2022-04-15 06:42:47,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:47,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 82 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 77 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:47,408 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 82 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 77 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:47,408 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 82 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 77 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:47,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:47,416 INFO L93 Difference]: Finished difference Result 107 states and 144 transitions. [2022-04-15 06:42:47,416 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 144 transitions. [2022-04-15 06:42:47,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:47,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:47,424 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 77 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 107 states. [2022-04-15 06:42:47,424 INFO L87 Difference]: Start difference. First operand has 82 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 77 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 107 states. [2022-04-15 06:42:47,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:47,427 INFO L93 Difference]: Finished difference Result 107 states and 144 transitions. [2022-04-15 06:42:47,427 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 144 transitions. [2022-04-15 06:42:47,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:47,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:47,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:47,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:47,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 77 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:47,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 112 transitions. [2022-04-15 06:42:47,429 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 112 transitions. Word has length 28 [2022-04-15 06:42:47,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:47,429 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 112 transitions. [2022-04-15 06:42:47,429 INFO L479 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-15 06:42:47,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 112 transitions. [2022-04-15 06:42:51,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 111 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:51,236 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 112 transitions. [2022-04-15 06:42:51,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 06:42:51,237 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:51,237 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:51,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-15 06:42:51,451 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:51,451 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:51,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:51,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1271884495, now seen corresponding path program 7 times [2022-04-15 06:42:51,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:51,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [995042342] [2022-04-15 06:42:51,659 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-15 06:42:51,661 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:51,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1432698610, now seen corresponding path program 1 times [2022-04-15 06:42:51,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:51,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715486213] [2022-04-15 06:42:51,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:51,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:51,672 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-15 06:42:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:51,689 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-15 06:42:51,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:51,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:51,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {9263#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9252#true} is VALID [2022-04-15 06:42:51,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {9252#true} assume true; {9252#true} is VALID [2022-04-15 06:42:51,811 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9252#true} {9252#true} #83#return; {9252#true} is VALID [2022-04-15 06:42:51,812 INFO L272 TraceCheckUtils]: 0: Hoare triple {9252#true} call ULTIMATE.init(); {9263#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:42:51,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {9263#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9252#true} is VALID [2022-04-15 06:42:51,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {9252#true} assume true; {9252#true} is VALID [2022-04-15 06:42:51,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9252#true} {9252#true} #83#return; {9252#true} is VALID [2022-04-15 06:42:51,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {9252#true} call #t~ret15 := main(); {9252#true} is VALID [2022-04-15 06:42:51,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {9252#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9252#true} is VALID [2022-04-15 06:42:51,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {9252#true} [121] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_194 4294967296)) (.cse1 (= v_main_~y~0_232 v_main_~y~0_231)) (.cse2 (= v_main_~x~0_194 v_main_~x~0_193)) (.cse3 (= |v_main_#t~post6_84| |v_main_#t~post6_83|)) (.cse4 (= |v_main_#t~post5_84| |v_main_#t~post5_83|))) (or (and (forall ((v_it_18 Int)) (or (< 0 (mod (+ v_main_~x~0_194 (* 4294967295 v_it_18)) 4294967296)) (not (<= (+ v_main_~y~0_232 v_it_18 1) v_main_~y~0_231)) (not (<= 1 v_it_18)))) (= v_main_~x~0_193 (+ v_main_~x~0_194 v_main_~y~0_232 (* (- 1) v_main_~y~0_231))) (< 0 .cse0) (< v_main_~y~0_232 v_main_~y~0_231)) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_232, main_#t~post5=|v_main_#t~post5_84|, main_~x~0=v_main_~x~0_194, main_#t~post6=|v_main_#t~post6_84|} OutVars{main_~y~0=v_main_~y~0_231, main_#t~post5=|v_main_#t~post5_83|, main_~x~0=v_main_~x~0_193, main_#t~post6=|v_main_#t~post6_83|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9252#true} is VALID [2022-04-15 06:42:51,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {9252#true} [120] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {9252#true} is VALID [2022-04-15 06:42:51,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {9252#true} ~z~0 := ~y~0; {9257#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:42:51,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {9257#(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; {9258#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:42:51,815 INFO L290 TraceCheckUtils]: 10: Hoare triple {9258#(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; {9259#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:42:51,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {9259#(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; {9260#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:42:51,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {9260#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {9260#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:42:51,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {9260#(<= 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; {9261#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:42:51,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {9261#(<= 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; {9262#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:42:51,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {9262#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {9253#false} is VALID [2022-04-15 06:42:51,820 INFO L290 TraceCheckUtils]: 16: Hoare triple {9253#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; {9253#false} is VALID [2022-04-15 06:42:51,820 INFO L290 TraceCheckUtils]: 17: Hoare triple {9253#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; {9253#false} is VALID [2022-04-15 06:42:51,820 INFO L290 TraceCheckUtils]: 18: Hoare triple {9253#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; {9253#false} is VALID [2022-04-15 06:42:51,820 INFO L290 TraceCheckUtils]: 19: Hoare triple {9253#false} assume !(~x~0 % 4294967296 > 0); {9253#false} is VALID [2022-04-15 06:42:51,820 INFO L290 TraceCheckUtils]: 20: Hoare triple {9253#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9253#false} is VALID [2022-04-15 06:42:51,820 INFO L290 TraceCheckUtils]: 21: Hoare triple {9253#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9253#false} is VALID [2022-04-15 06:42:51,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {9253#false} assume !(~z~0 % 4294967296 > 0); {9253#false} is VALID [2022-04-15 06:42:51,820 INFO L272 TraceCheckUtils]: 23: Hoare triple {9253#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {9253#false} is VALID [2022-04-15 06:42:51,820 INFO L290 TraceCheckUtils]: 24: Hoare triple {9253#false} ~cond := #in~cond; {9253#false} is VALID [2022-04-15 06:42:51,821 INFO L290 TraceCheckUtils]: 25: Hoare triple {9253#false} assume 0 == ~cond; {9253#false} is VALID [2022-04-15 06:42:51,821 INFO L290 TraceCheckUtils]: 26: Hoare triple {9253#false} assume !false; {9253#false} is VALID [2022-04-15 06:42:51,821 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-15 06:42:51,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:51,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715486213] [2022-04-15 06:42:51,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715486213] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:51,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959461925] [2022-04-15 06:42:51,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:51,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:51,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:51,824 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-15 06:42:51,833 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-15 06:42:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:51,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 06:42:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:51,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:52,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {9252#true} call ULTIMATE.init(); {9252#true} is VALID [2022-04-15 06:42:52,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {9252#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9252#true} is VALID [2022-04-15 06:42:52,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {9252#true} assume true; {9252#true} is VALID [2022-04-15 06:42:52,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9252#true} {9252#true} #83#return; {9252#true} is VALID [2022-04-15 06:42:52,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {9252#true} call #t~ret15 := main(); {9252#true} is VALID [2022-04-15 06:42:52,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {9252#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9252#true} is VALID [2022-04-15 06:42:52,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {9252#true} [121] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_194 4294967296)) (.cse1 (= v_main_~y~0_232 v_main_~y~0_231)) (.cse2 (= v_main_~x~0_194 v_main_~x~0_193)) (.cse3 (= |v_main_#t~post6_84| |v_main_#t~post6_83|)) (.cse4 (= |v_main_#t~post5_84| |v_main_#t~post5_83|))) (or (and (forall ((v_it_18 Int)) (or (< 0 (mod (+ v_main_~x~0_194 (* 4294967295 v_it_18)) 4294967296)) (not (<= (+ v_main_~y~0_232 v_it_18 1) v_main_~y~0_231)) (not (<= 1 v_it_18)))) (= v_main_~x~0_193 (+ v_main_~x~0_194 v_main_~y~0_232 (* (- 1) v_main_~y~0_231))) (< 0 .cse0) (< v_main_~y~0_232 v_main_~y~0_231)) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_232, main_#t~post5=|v_main_#t~post5_84|, main_~x~0=v_main_~x~0_194, main_#t~post6=|v_main_#t~post6_84|} OutVars{main_~y~0=v_main_~y~0_231, main_#t~post5=|v_main_#t~post5_83|, main_~x~0=v_main_~x~0_193, main_#t~post6=|v_main_#t~post6_83|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9252#true} is VALID [2022-04-15 06:42:52,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {9252#true} [120] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {9252#true} is VALID [2022-04-15 06:42:52,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {9252#true} ~z~0 := ~y~0; {9257#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:42:52,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {9257#(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; {9258#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:42:52,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {9258#(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; {9259#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:42:52,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {9259#(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; {9300#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:42:52,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {9300#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {9300#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:42:52,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {9300#(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; {9258#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:42:52,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {9258#(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; {9310#(and (<= (+ main_~y~0 1) main_~z~0) (<= main_~z~0 (+ main_~y~0 1)))} is VALID [2022-04-15 06:42:52,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {9310#(and (<= (+ main_~y~0 1) main_~z~0) (<= main_~z~0 (+ main_~y~0 1)))} assume !(~y~0 % 4294967296 > 0); {9314#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} is VALID [2022-04-15 06:42:52,694 INFO L290 TraceCheckUtils]: 16: Hoare triple {9314#(<= (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; {9314#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} is VALID [2022-04-15 06:42:52,694 INFO L290 TraceCheckUtils]: 17: Hoare triple {9314#(<= (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; {9314#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} is VALID [2022-04-15 06:42:52,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {9314#(<= (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; {9314#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} is VALID [2022-04-15 06:42:52,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {9314#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {9314#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} is VALID [2022-04-15 06:42:52,696 INFO L290 TraceCheckUtils]: 20: Hoare triple {9314#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9330#(<= (div (* (- 1) main_~z~0) (- 4294967296)) (div main_~z~0 4294967296))} is VALID [2022-04-15 06:42:52,696 INFO L290 TraceCheckUtils]: 21: Hoare triple {9330#(<= (div (* (- 1) main_~z~0) (- 4294967296)) (div main_~z~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9253#false} is VALID [2022-04-15 06:42:52,696 INFO L290 TraceCheckUtils]: 22: Hoare triple {9253#false} assume !(~z~0 % 4294967296 > 0); {9253#false} is VALID [2022-04-15 06:42:52,696 INFO L272 TraceCheckUtils]: 23: Hoare triple {9253#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {9253#false} is VALID [2022-04-15 06:42:52,697 INFO L290 TraceCheckUtils]: 24: Hoare triple {9253#false} ~cond := #in~cond; {9253#false} is VALID [2022-04-15 06:42:52,697 INFO L290 TraceCheckUtils]: 25: Hoare triple {9253#false} assume 0 == ~cond; {9253#false} is VALID [2022-04-15 06:42:52,697 INFO L290 TraceCheckUtils]: 26: Hoare triple {9253#false} assume !false; {9253#false} is VALID [2022-04-15 06:42:52,697 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 06:42:52,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:53,331 INFO L290 TraceCheckUtils]: 26: Hoare triple {9253#false} assume !false; {9253#false} is VALID [2022-04-15 06:42:53,331 INFO L290 TraceCheckUtils]: 25: Hoare triple {9253#false} assume 0 == ~cond; {9253#false} is VALID [2022-04-15 06:42:53,331 INFO L290 TraceCheckUtils]: 24: Hoare triple {9253#false} ~cond := #in~cond; {9253#false} is VALID [2022-04-15 06:42:53,331 INFO L272 TraceCheckUtils]: 23: Hoare triple {9253#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {9253#false} is VALID [2022-04-15 06:42:53,331 INFO L290 TraceCheckUtils]: 22: Hoare triple {9253#false} assume !(~z~0 % 4294967296 > 0); {9253#false} is VALID [2022-04-15 06:42:53,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {9330#(<= (div (* (- 1) main_~z~0) (- 4294967296)) (div main_~z~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9253#false} is VALID [2022-04-15 06:42:53,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {9314#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9330#(<= (div (* (- 1) main_~z~0) (- 4294967296)) (div main_~z~0 4294967296))} is VALID [2022-04-15 06:42:53,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {9314#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {9314#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} is VALID [2022-04-15 06:42:53,335 INFO L290 TraceCheckUtils]: 18: Hoare triple {9314#(<= (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; {9314#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} is VALID [2022-04-15 06:42:53,335 INFO L290 TraceCheckUtils]: 17: Hoare triple {9314#(<= (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; {9314#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} is VALID [2022-04-15 06:42:53,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {9314#(<= (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; {9314#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} is VALID [2022-04-15 06:42:53,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {9382#(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); {9314#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} is VALID [2022-04-15 06:42:53,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {9386#(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; {9382#(or (<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:42:53,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {9390#(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; {9386#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= (div (* (- 1) main_~z~0) (- 4294967296)) (div main_~z~0 4294967296)))} is VALID [2022-04-15 06:42:53,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {9390#(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); {9390#(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-15 06:42:53,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {9397#(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; {9390#(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-15 06:42:53,341 INFO L290 TraceCheckUtils]: 10: Hoare triple {9401#(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; {9397#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= (div (* (- 1) main_~z~0) (- 4294967296)) (div main_~z~0 4294967296)))} is VALID [2022-04-15 06:42:53,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {9405#(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; {9401#(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-15 06:42:53,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {9252#true} ~z~0 := ~y~0; {9405#(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-15 06:42:53,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {9252#true} [120] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {9252#true} is VALID [2022-04-15 06:42:53,344 INFO L290 TraceCheckUtils]: 6: Hoare triple {9252#true} [121] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_194 4294967296)) (.cse1 (= v_main_~y~0_232 v_main_~y~0_231)) (.cse2 (= v_main_~x~0_194 v_main_~x~0_193)) (.cse3 (= |v_main_#t~post6_84| |v_main_#t~post6_83|)) (.cse4 (= |v_main_#t~post5_84| |v_main_#t~post5_83|))) (or (and (forall ((v_it_18 Int)) (or (< 0 (mod (+ v_main_~x~0_194 (* 4294967295 v_it_18)) 4294967296)) (not (<= (+ v_main_~y~0_232 v_it_18 1) v_main_~y~0_231)) (not (<= 1 v_it_18)))) (= v_main_~x~0_193 (+ v_main_~x~0_194 v_main_~y~0_232 (* (- 1) v_main_~y~0_231))) (< 0 .cse0) (< v_main_~y~0_232 v_main_~y~0_231)) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_232, main_#t~post5=|v_main_#t~post5_84|, main_~x~0=v_main_~x~0_194, main_#t~post6=|v_main_#t~post6_84|} OutVars{main_~y~0=v_main_~y~0_231, main_#t~post5=|v_main_#t~post5_83|, main_~x~0=v_main_~x~0_193, main_#t~post6=|v_main_#t~post6_83|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9252#true} is VALID [2022-04-15 06:42:53,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {9252#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9252#true} is VALID [2022-04-15 06:42:53,344 INFO L272 TraceCheckUtils]: 4: Hoare triple {9252#true} call #t~ret15 := main(); {9252#true} is VALID [2022-04-15 06:42:53,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9252#true} {9252#true} #83#return; {9252#true} is VALID [2022-04-15 06:42:53,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {9252#true} assume true; {9252#true} is VALID [2022-04-15 06:42:53,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {9252#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9252#true} is VALID [2022-04-15 06:42:53,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {9252#true} call ULTIMATE.init(); {9252#true} is VALID [2022-04-15 06:42:53,345 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 06:42:53,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959461925] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:53,345 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:53,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 19 [2022-04-15 06:42:53,509 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:53,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [995042342] [2022-04-15 06:42:53,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [995042342] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:53,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:53,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 06:42:53,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086847432] [2022-04-15 06:42:53,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:53,510 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 29 [2022-04-15 06:42:53,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:53,511 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-15 06:42:53,544 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-15 06:42:53,544 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 06:42:53,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:53,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 06:42:53,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-04-15 06:42:53,545 INFO L87 Difference]: Start difference. First operand 82 states and 112 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-15 06:42:55,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:55,711 INFO L93 Difference]: Finished difference Result 109 states and 144 transitions. [2022-04-15 06:42:55,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 06:42:55,711 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 29 [2022-04-15 06:42:55,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:55,711 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-15 06:42:55,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 56 transitions. [2022-04-15 06:42:55,712 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-15 06:42:55,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 56 transitions. [2022-04-15 06:42:55,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 56 transitions. [2022-04-15 06:42:55,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:55,833 INFO L225 Difference]: With dead ends: 109 [2022-04-15 06:42:55,833 INFO L226 Difference]: Without dead ends: 91 [2022-04-15 06:42:55,834 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=223, Invalid=1109, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 06:42:55,835 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 39 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:42:55,835 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 60 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:42:55,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-15 06:42:56,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 69. [2022-04-15 06:42:56,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:56,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 69 states, 64 states have (on average 1.375) internal successors, (88), 64 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:56,277 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 69 states, 64 states have (on average 1.375) internal successors, (88), 64 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:56,277 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 69 states, 64 states have (on average 1.375) internal successors, (88), 64 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:56,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:56,279 INFO L93 Difference]: Finished difference Result 91 states and 120 transitions. [2022-04-15 06:42:56,279 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 120 transitions. [2022-04-15 06:42:56,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:56,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:56,280 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 64 states have (on average 1.375) internal successors, (88), 64 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 91 states. [2022-04-15 06:42:56,280 INFO L87 Difference]: Start difference. First operand has 69 states, 64 states have (on average 1.375) internal successors, (88), 64 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 91 states. [2022-04-15 06:42:56,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:56,283 INFO L93 Difference]: Finished difference Result 91 states and 120 transitions. [2022-04-15 06:42:56,283 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 120 transitions. [2022-04-15 06:42:56,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:56,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:56,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:56,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:56,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.375) internal successors, (88), 64 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:56,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 92 transitions. [2022-04-15 06:42:56,284 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 92 transitions. Word has length 29 [2022-04-15 06:42:56,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:56,285 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 92 transitions. [2022-04-15 06:42:56,285 INFO L479 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-15 06:42:56,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 92 transitions. [2022-04-15 06:42:59,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 91 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:59,733 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2022-04-15 06:42:59,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 06:42:59,733 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:59,734 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:59,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-15 06:42:59,934 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-15 06:42:59,934 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:59,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:59,935 INFO L85 PathProgramCache]: Analyzing trace with hash 22222479, now seen corresponding path program 8 times [2022-04-15 06:42:59,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:59,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [161972572] [2022-04-15 06:43:00,239 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-15 06:43:00,241 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:43:00,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1217660046, now seen corresponding path program 1 times [2022-04-15 06:43:00,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:43:00,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080347055] [2022-04-15 06:43:00,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:00,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:43:00,252 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-15 06:43:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:00,269 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_19.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:43:00,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:43:00,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:00,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {10020#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10008#true} is VALID [2022-04-15 06:43:00,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {10008#true} assume true; {10008#true} is VALID [2022-04-15 06:43:00,403 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10008#true} {10008#true} #83#return; {10008#true} is VALID [2022-04-15 06:43:00,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {10008#true} call ULTIMATE.init(); {10020#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:43:00,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {10020#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10008#true} is VALID [2022-04-15 06:43:00,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {10008#true} assume true; {10008#true} is VALID [2022-04-15 06:43:00,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10008#true} {10008#true} #83#return; {10008#true} is VALID [2022-04-15 06:43:00,404 INFO L272 TraceCheckUtils]: 4: Hoare triple {10008#true} call #t~ret15 := main(); {10008#true} is VALID [2022-04-15 06:43:00,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {10008#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10008#true} is VALID [2022-04-15 06:43:00,404 INFO L290 TraceCheckUtils]: 6: Hoare triple {10008#true} [123] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_89| |v_main_#t~post5_88|)) (.cse2 (= |v_main_#t~post6_89| |v_main_#t~post6_88|)) (.cse3 (= v_main_~x~0_209 v_main_~x~0_208)) (.cse1 (mod v_main_~x~0_209 4294967296))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 (= v_main_~y~0_249 v_main_~y~0_250)) (and .cse0 .cse2 .cse3 (= v_main_~y~0_250 v_main_~y~0_249)) (and (< v_main_~x~0_208 v_main_~x~0_209) (= (+ v_main_~x~0_209 v_main_~y~0_250 (* v_main_~x~0_208 (- 1))) v_main_~y~0_249) (< 0 .cse1) (forall ((v_it_19 Int)) (or (not (<= (+ v_main_~x~0_208 v_it_19 1) v_main_~x~0_209)) (not (<= 1 v_it_19)) (< 0 (mod (+ v_main_~x~0_209 (* 4294967295 v_it_19)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_250, main_#t~post5=|v_main_#t~post5_89|, main_~x~0=v_main_~x~0_209, main_#t~post6=|v_main_#t~post6_89|} OutVars{main_~y~0=v_main_~y~0_249, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_208, main_#t~post6=|v_main_#t~post6_88|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10008#true} is VALID [2022-04-15 06:43:00,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {10008#true} [122] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {10008#true} is VALID [2022-04-15 06:43:00,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {10008#true} ~z~0 := ~y~0; {10008#true} is VALID [2022-04-15 06:43:00,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {10008#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; {10013#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:00,407 INFO L290 TraceCheckUtils]: 10: Hoare triple {10013#(<= 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; {10014#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 06:43:00,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {10014#(<= 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; {10008#true} is VALID [2022-04-15 06:43:00,407 INFO L290 TraceCheckUtils]: 12: Hoare triple {10008#true} assume !(~z~0 % 4294967296 > 0); {10015#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0)} is VALID [2022-04-15 06:43:00,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {10015#(<= (* (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; {10016#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:43:00,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {10016#(<= (+ (* (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; {10017#(<= (+ (* 4294967296 (div (+ main_~z~0 4294967293) 4294967296)) 2) main_~z~0)} is VALID [2022-04-15 06:43:00,410 INFO L290 TraceCheckUtils]: 15: Hoare triple {10017#(<= (+ (* 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; {10018#(<= (+ 3 (* (div (+ 4294967292 main_~z~0) 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:43:00,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {10018#(<= (+ 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; {10019#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-15 06:43:00,411 INFO L290 TraceCheckUtils]: 17: Hoare triple {10019#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {10019#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-15 06:43:00,411 INFO L290 TraceCheckUtils]: 18: Hoare triple {10019#(<= (+ (* (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; {10019#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-15 06:43:00,412 INFO L290 TraceCheckUtils]: 19: Hoare triple {10019#(<= (+ (* (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; {10019#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-15 06:43:00,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {10019#(<= (+ (* (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; {10019#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-15 06:43:00,412 INFO L290 TraceCheckUtils]: 21: Hoare triple {10019#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {10019#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-15 06:43:00,413 INFO L290 TraceCheckUtils]: 22: Hoare triple {10019#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {10009#false} is VALID [2022-04-15 06:43:00,413 INFO L272 TraceCheckUtils]: 23: Hoare triple {10009#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {10009#false} is VALID [2022-04-15 06:43:00,413 INFO L290 TraceCheckUtils]: 24: Hoare triple {10009#false} ~cond := #in~cond; {10009#false} is VALID [2022-04-15 06:43:00,413 INFO L290 TraceCheckUtils]: 25: Hoare triple {10009#false} assume 0 == ~cond; {10009#false} is VALID [2022-04-15 06:43:00,413 INFO L290 TraceCheckUtils]: 26: Hoare triple {10009#false} assume !false; {10009#false} is VALID [2022-04-15 06:43:00,413 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:43:00,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:43:00,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080347055] [2022-04-15 06:43:00,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080347055] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:43:00,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449795269] [2022-04-15 06:43:00,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:00,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:43:00,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:43:00,414 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-15 06:43:00,415 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-15 06:43:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:00,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 06:43:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:00,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:43:00,644 INFO L272 TraceCheckUtils]: 0: Hoare triple {10008#true} call ULTIMATE.init(); {10008#true} is VALID [2022-04-15 06:43:00,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {10008#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10008#true} is VALID [2022-04-15 06:43:00,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {10008#true} assume true; {10008#true} is VALID [2022-04-15 06:43:00,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10008#true} {10008#true} #83#return; {10008#true} is VALID [2022-04-15 06:43:00,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {10008#true} call #t~ret15 := main(); {10008#true} is VALID [2022-04-15 06:43:00,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {10008#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10008#true} is VALID [2022-04-15 06:43:00,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {10008#true} [123] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_89| |v_main_#t~post5_88|)) (.cse2 (= |v_main_#t~post6_89| |v_main_#t~post6_88|)) (.cse3 (= v_main_~x~0_209 v_main_~x~0_208)) (.cse1 (mod v_main_~x~0_209 4294967296))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 (= v_main_~y~0_249 v_main_~y~0_250)) (and .cse0 .cse2 .cse3 (= v_main_~y~0_250 v_main_~y~0_249)) (and (< v_main_~x~0_208 v_main_~x~0_209) (= (+ v_main_~x~0_209 v_main_~y~0_250 (* v_main_~x~0_208 (- 1))) v_main_~y~0_249) (< 0 .cse1) (forall ((v_it_19 Int)) (or (not (<= (+ v_main_~x~0_208 v_it_19 1) v_main_~x~0_209)) (not (<= 1 v_it_19)) (< 0 (mod (+ v_main_~x~0_209 (* 4294967295 v_it_19)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_250, main_#t~post5=|v_main_#t~post5_89|, main_~x~0=v_main_~x~0_209, main_#t~post6=|v_main_#t~post6_89|} OutVars{main_~y~0=v_main_~y~0_249, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_208, main_#t~post6=|v_main_#t~post6_88|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10008#true} is VALID [2022-04-15 06:43:00,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {10008#true} [122] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {10008#true} is VALID [2022-04-15 06:43:00,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {10008#true} ~z~0 := ~y~0; {10048#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:43:00,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {10048#(= 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; {10052#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:43:00,647 INFO L290 TraceCheckUtils]: 10: Hoare triple {10052#(= 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; {10056#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:43:00,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {10056#(= (+ 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; {10060#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-15 06:43:00,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {10060#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {10064#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:43:00,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {10064#(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; {10068#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-15 06:43:00,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {10068#(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; {10072#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:43:00,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {10072#(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; {10076#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:43:00,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {10076#(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; {10009#false} is VALID [2022-04-15 06:43:00,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {10009#false} assume !(~y~0 % 4294967296 > 0); {10009#false} is VALID [2022-04-15 06:43:00,652 INFO L290 TraceCheckUtils]: 18: Hoare triple {10009#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; {10009#false} is VALID [2022-04-15 06:43:00,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {10009#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; {10009#false} is VALID [2022-04-15 06:43:00,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {10009#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; {10009#false} is VALID [2022-04-15 06:43:00,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {10009#false} assume !(~x~0 % 4294967296 > 0); {10009#false} is VALID [2022-04-15 06:43:00,652 INFO L290 TraceCheckUtils]: 22: Hoare triple {10009#false} assume !(~z~0 % 4294967296 > 0); {10009#false} is VALID [2022-04-15 06:43:00,652 INFO L272 TraceCheckUtils]: 23: Hoare triple {10009#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {10009#false} is VALID [2022-04-15 06:43:00,652 INFO L290 TraceCheckUtils]: 24: Hoare triple {10009#false} ~cond := #in~cond; {10009#false} is VALID [2022-04-15 06:43:00,652 INFO L290 TraceCheckUtils]: 25: Hoare triple {10009#false} assume 0 == ~cond; {10009#false} is VALID [2022-04-15 06:43:00,652 INFO L290 TraceCheckUtils]: 26: Hoare triple {10009#false} assume !false; {10009#false} is VALID [2022-04-15 06:43:00,652 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 06:43:00,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:43:00,869 INFO L290 TraceCheckUtils]: 26: Hoare triple {10009#false} assume !false; {10009#false} is VALID [2022-04-15 06:43:00,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {10009#false} assume 0 == ~cond; {10009#false} is VALID [2022-04-15 06:43:00,869 INFO L290 TraceCheckUtils]: 24: Hoare triple {10009#false} ~cond := #in~cond; {10009#false} is VALID [2022-04-15 06:43:00,869 INFO L272 TraceCheckUtils]: 23: Hoare triple {10009#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {10009#false} is VALID [2022-04-15 06:43:00,869 INFO L290 TraceCheckUtils]: 22: Hoare triple {10009#false} assume !(~z~0 % 4294967296 > 0); {10009#false} is VALID [2022-04-15 06:43:00,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {10009#false} assume !(~x~0 % 4294967296 > 0); {10009#false} is VALID [2022-04-15 06:43:00,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {10009#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; {10009#false} is VALID [2022-04-15 06:43:00,869 INFO L290 TraceCheckUtils]: 19: Hoare triple {10009#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; {10009#false} is VALID [2022-04-15 06:43:00,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {10009#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; {10009#false} is VALID [2022-04-15 06:43:00,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {10009#false} assume !(~y~0 % 4294967296 > 0); {10009#false} is VALID [2022-04-15 06:43:00,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {10076#(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; {10009#false} is VALID [2022-04-15 06:43:00,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {10072#(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; {10076#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:43:00,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {10068#(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; {10072#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:43:00,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {10064#(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; {10068#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-15 06:43:00,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {10152#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {10064#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:43:00,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {10156#(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; {10152#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-15 06:43:00,881 INFO L290 TraceCheckUtils]: 10: Hoare triple {10160#(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; {10156#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:43:00,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {10164#(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; {10160#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-15 06:43:00,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {10008#true} ~z~0 := ~y~0; {10164#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:43:00,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {10008#true} [122] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {10008#true} is VALID [2022-04-15 06:43:00,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {10008#true} [123] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_89| |v_main_#t~post5_88|)) (.cse2 (= |v_main_#t~post6_89| |v_main_#t~post6_88|)) (.cse3 (= v_main_~x~0_209 v_main_~x~0_208)) (.cse1 (mod v_main_~x~0_209 4294967296))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 (= v_main_~y~0_249 v_main_~y~0_250)) (and .cse0 .cse2 .cse3 (= v_main_~y~0_250 v_main_~y~0_249)) (and (< v_main_~x~0_208 v_main_~x~0_209) (= (+ v_main_~x~0_209 v_main_~y~0_250 (* v_main_~x~0_208 (- 1))) v_main_~y~0_249) (< 0 .cse1) (forall ((v_it_19 Int)) (or (not (<= (+ v_main_~x~0_208 v_it_19 1) v_main_~x~0_209)) (not (<= 1 v_it_19)) (< 0 (mod (+ v_main_~x~0_209 (* 4294967295 v_it_19)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_250, main_#t~post5=|v_main_#t~post5_89|, main_~x~0=v_main_~x~0_209, main_#t~post6=|v_main_#t~post6_89|} OutVars{main_~y~0=v_main_~y~0_249, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_208, main_#t~post6=|v_main_#t~post6_88|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10008#true} is VALID [2022-04-15 06:43:00,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {10008#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10008#true} is VALID [2022-04-15 06:43:00,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {10008#true} call #t~ret15 := main(); {10008#true} is VALID [2022-04-15 06:43:00,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10008#true} {10008#true} #83#return; {10008#true} is VALID [2022-04-15 06:43:00,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {10008#true} assume true; {10008#true} is VALID [2022-04-15 06:43:00,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {10008#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10008#true} is VALID [2022-04-15 06:43:00,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {10008#true} call ULTIMATE.init(); {10008#true} is VALID [2022-04-15 06:43:00,885 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 06:43:00,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449795269] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:43:00,885 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:43:00,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2022-04-15 06:43:01,014 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:43:01,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [161972572] [2022-04-15 06:43:01,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [161972572] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:43:01,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:43:01,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 06:43:01,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112624953] [2022-04-15 06:43:01,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:43:01,014 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 06:43:01,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:43:01,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:01,039 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-15 06:43:01,040 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 06:43:01,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:01,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 06:43:01,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2022-04-15 06:43:01,040 INFO L87 Difference]: Start difference. First operand 69 states and 92 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:03,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:03,894 INFO L93 Difference]: Finished difference Result 155 states and 219 transitions. [2022-04-15 06:43:03,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 06:43:03,894 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 06:43:03,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:43:03,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:03,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 97 transitions. [2022-04-15 06:43:03,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:03,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 97 transitions. [2022-04-15 06:43:03,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 97 transitions. [2022-04-15 06:43:04,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:43:04,072 INFO L225 Difference]: With dead ends: 155 [2022-04-15 06:43:04,073 INFO L226 Difference]: Without dead ends: 149 [2022-04-15 06:43:04,074 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=512, Invalid=2458, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 06:43:04,074 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 95 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:43:04,074 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 38 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:43:04,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-04-15 06:43:04,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 95. [2022-04-15 06:43:04,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:43:04,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 95 states, 90 states have (on average 1.4444444444444444) internal successors, (130), 90 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:04,628 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 95 states, 90 states have (on average 1.4444444444444444) internal successors, (130), 90 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:04,628 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 95 states, 90 states have (on average 1.4444444444444444) internal successors, (130), 90 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:04,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:04,631 INFO L93 Difference]: Finished difference Result 149 states and 203 transitions. [2022-04-15 06:43:04,631 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 203 transitions. [2022-04-15 06:43:04,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:04,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:04,632 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 90 states have (on average 1.4444444444444444) internal successors, (130), 90 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 149 states. [2022-04-15 06:43:04,632 INFO L87 Difference]: Start difference. First operand has 95 states, 90 states have (on average 1.4444444444444444) internal successors, (130), 90 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 149 states. [2022-04-15 06:43:04,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:04,634 INFO L93 Difference]: Finished difference Result 149 states and 203 transitions. [2022-04-15 06:43:04,634 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 203 transitions. [2022-04-15 06:43:04,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:04,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:04,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:43:04,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:43:04,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.4444444444444444) internal successors, (130), 90 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:04,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 134 transitions. [2022-04-15 06:43:04,636 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 134 transitions. Word has length 29 [2022-04-15 06:43:04,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:43:04,637 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 134 transitions. [2022-04-15 06:43:04,637 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:04,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 134 transitions. [2022-04-15 06:43:08,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 133 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:43:08,694 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 134 transitions. [2022-04-15 06:43:08,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 06:43:08,694 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:43:08,694 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:43:08,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-15 06:43:08,894 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:43:08,895 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:43:08,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:43:08,895 INFO L85 PathProgramCache]: Analyzing trace with hash 723391956, now seen corresponding path program 8 times [2022-04-15 06:43:08,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:08,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1233808076] [2022-04-15 06:43:10,552 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:43:10,646 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-15 06:43:10,647 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:43:10,649 INFO L85 PathProgramCache]: Analyzing trace with hash -231192587, now seen corresponding path program 1 times [2022-04-15 06:43:10,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:43:10,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231091224] [2022-04-15 06:43:10,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:10,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:43:10,665 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-15 06:43:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:10,687 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-15 06:43:10,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:43:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:10,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {11069#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11056#true} is VALID [2022-04-15 06:43:10,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {11056#true} assume true; {11056#true} is VALID [2022-04-15 06:43:10,816 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11056#true} {11056#true} #83#return; {11056#true} is VALID [2022-04-15 06:43:10,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {11056#true} call ULTIMATE.init(); {11069#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:43:10,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {11069#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11056#true} is VALID [2022-04-15 06:43:10,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {11056#true} assume true; {11056#true} is VALID [2022-04-15 06:43:10,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11056#true} {11056#true} #83#return; {11056#true} is VALID [2022-04-15 06:43:10,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {11056#true} call #t~ret15 := main(); {11056#true} is VALID [2022-04-15 06:43:10,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {11056#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11056#true} is VALID [2022-04-15 06:43:10,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {11056#true} [125] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_224 4294967296)) (.cse1 (= |v_main_#t~post5_94| |v_main_#t~post5_93|)) (.cse2 (= v_main_~x~0_224 v_main_~x~0_223)) (.cse3 (= |v_main_#t~post6_94| |v_main_#t~post6_93|))) (or (and (= v_main_~y~0_268 v_main_~y~0_269) (<= .cse0 0) .cse1 .cse2 .cse3) (and (forall ((v_it_20 Int)) (or (not (<= 1 v_it_20)) (< 0 (mod (+ v_main_~x~0_224 (* 4294967295 v_it_20)) 4294967296)) (not (<= (+ v_main_~y~0_269 v_it_20 1) v_main_~y~0_268)))) (< v_main_~y~0_269 v_main_~y~0_268) (= v_main_~x~0_223 (+ v_main_~x~0_224 v_main_~y~0_269 (* (- 1) v_main_~y~0_268))) (< 0 .cse0)) (and .cse1 (= v_main_~y~0_269 v_main_~y~0_268) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_269, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_224, main_#t~post6=|v_main_#t~post6_94|} OutVars{main_~y~0=v_main_~y~0_268, main_#t~post5=|v_main_#t~post5_93|, main_~x~0=v_main_~x~0_223, main_#t~post6=|v_main_#t~post6_93|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11056#true} is VALID [2022-04-15 06:43:10,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {11056#true} [124] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {11056#true} is VALID [2022-04-15 06:43:10,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {11056#true} ~z~0 := ~y~0; {11061#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:43:10,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {11061#(= (+ 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; {11062#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:43:10,819 INFO L290 TraceCheckUtils]: 10: Hoare triple {11062#(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; {11063#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:43:10,819 INFO L290 TraceCheckUtils]: 11: Hoare triple {11063#(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; {11064#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:43:10,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {11064#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {11065#(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-15 06:43:10,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {11065#(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; {11066#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:10,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {11066#(<= 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; {11067#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:43:10,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {11067#(<= 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; {11068#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:43:10,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {11068#(<= 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; {11057#false} is VALID [2022-04-15 06:43:10,823 INFO L290 TraceCheckUtils]: 17: Hoare triple {11057#false} assume !(~y~0 % 4294967296 > 0); {11057#false} is VALID [2022-04-15 06:43:10,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {11057#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; {11057#false} is VALID [2022-04-15 06:43:10,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {11057#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; {11057#false} is VALID [2022-04-15 06:43:10,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {11057#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; {11057#false} is VALID [2022-04-15 06:43:10,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {11057#false} assume !(~x~0 % 4294967296 > 0); {11057#false} is VALID [2022-04-15 06:43:10,823 INFO L290 TraceCheckUtils]: 22: Hoare triple {11057#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11057#false} is VALID [2022-04-15 06:43:10,823 INFO L290 TraceCheckUtils]: 23: Hoare triple {11057#false} assume !(~z~0 % 4294967296 > 0); {11057#false} is VALID [2022-04-15 06:43:10,823 INFO L272 TraceCheckUtils]: 24: Hoare triple {11057#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {11057#false} is VALID [2022-04-15 06:43:10,823 INFO L290 TraceCheckUtils]: 25: Hoare triple {11057#false} ~cond := #in~cond; {11057#false} is VALID [2022-04-15 06:43:10,823 INFO L290 TraceCheckUtils]: 26: Hoare triple {11057#false} assume 0 == ~cond; {11057#false} is VALID [2022-04-15 06:43:10,824 INFO L290 TraceCheckUtils]: 27: Hoare triple {11057#false} assume !false; {11057#false} is VALID [2022-04-15 06:43:10,824 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-15 06:43:10,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:43:10,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231091224] [2022-04-15 06:43:10,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231091224] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:43:10,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014884153] [2022-04-15 06:43:10,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:10,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:43:10,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:43:10,825 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-15 06:43:10,826 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-15 06:43:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:10,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 06:43:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:10,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:43:11,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {11056#true} call ULTIMATE.init(); {11056#true} is VALID [2022-04-15 06:43:11,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {11056#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11056#true} is VALID [2022-04-15 06:43:11,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {11056#true} assume true; {11056#true} is VALID [2022-04-15 06:43:11,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11056#true} {11056#true} #83#return; {11056#true} is VALID [2022-04-15 06:43:11,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {11056#true} call #t~ret15 := main(); {11056#true} is VALID [2022-04-15 06:43:11,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {11056#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11056#true} is VALID [2022-04-15 06:43:11,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {11056#true} [125] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_224 4294967296)) (.cse1 (= |v_main_#t~post5_94| |v_main_#t~post5_93|)) (.cse2 (= v_main_~x~0_224 v_main_~x~0_223)) (.cse3 (= |v_main_#t~post6_94| |v_main_#t~post6_93|))) (or (and (= v_main_~y~0_268 v_main_~y~0_269) (<= .cse0 0) .cse1 .cse2 .cse3) (and (forall ((v_it_20 Int)) (or (not (<= 1 v_it_20)) (< 0 (mod (+ v_main_~x~0_224 (* 4294967295 v_it_20)) 4294967296)) (not (<= (+ v_main_~y~0_269 v_it_20 1) v_main_~y~0_268)))) (< v_main_~y~0_269 v_main_~y~0_268) (= v_main_~x~0_223 (+ v_main_~x~0_224 v_main_~y~0_269 (* (- 1) v_main_~y~0_268))) (< 0 .cse0)) (and .cse1 (= v_main_~y~0_269 v_main_~y~0_268) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_269, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_224, main_#t~post6=|v_main_#t~post6_94|} OutVars{main_~y~0=v_main_~y~0_268, main_#t~post5=|v_main_#t~post5_93|, main_~x~0=v_main_~x~0_223, main_#t~post6=|v_main_#t~post6_93|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11056#true} is VALID [2022-04-15 06:43:11,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {11056#true} [124] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {11056#true} is VALID [2022-04-15 06:43:11,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {11056#true} ~z~0 := ~y~0; {11061#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:43:11,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {11061#(= (+ 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; {11062#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:43:11,238 INFO L290 TraceCheckUtils]: 10: Hoare triple {11062#(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; {11063#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:43:11,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {11063#(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; {11064#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:43:11,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {11064#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {11109#(<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296))} is VALID [2022-04-15 06:43:11,241 INFO L290 TraceCheckUtils]: 13: Hoare triple {11109#(<= (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; {11066#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:11,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {11066#(<= 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; {11067#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:43:11,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {11067#(<= 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; {11068#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:43:11,243 INFO L290 TraceCheckUtils]: 16: Hoare triple {11068#(<= 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; {11057#false} is VALID [2022-04-15 06:43:11,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {11057#false} assume !(~y~0 % 4294967296 > 0); {11057#false} is VALID [2022-04-15 06:43:11,243 INFO L290 TraceCheckUtils]: 18: Hoare triple {11057#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; {11057#false} is VALID [2022-04-15 06:43:11,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {11057#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; {11057#false} is VALID [2022-04-15 06:43:11,243 INFO L290 TraceCheckUtils]: 20: Hoare triple {11057#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; {11057#false} is VALID [2022-04-15 06:43:11,243 INFO L290 TraceCheckUtils]: 21: Hoare triple {11057#false} assume !(~x~0 % 4294967296 > 0); {11057#false} is VALID [2022-04-15 06:43:11,243 INFO L290 TraceCheckUtils]: 22: Hoare triple {11057#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11057#false} is VALID [2022-04-15 06:43:11,243 INFO L290 TraceCheckUtils]: 23: Hoare triple {11057#false} assume !(~z~0 % 4294967296 > 0); {11057#false} is VALID [2022-04-15 06:43:11,243 INFO L272 TraceCheckUtils]: 24: Hoare triple {11057#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {11057#false} is VALID [2022-04-15 06:43:11,243 INFO L290 TraceCheckUtils]: 25: Hoare triple {11057#false} ~cond := #in~cond; {11057#false} is VALID [2022-04-15 06:43:11,243 INFO L290 TraceCheckUtils]: 26: Hoare triple {11057#false} assume 0 == ~cond; {11057#false} is VALID [2022-04-15 06:43:11,243 INFO L290 TraceCheckUtils]: 27: Hoare triple {11057#false} assume !false; {11057#false} is VALID [2022-04-15 06:43:11,243 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-15 06:43:11,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:43:11,954 INFO L290 TraceCheckUtils]: 27: Hoare triple {11057#false} assume !false; {11057#false} is VALID [2022-04-15 06:43:11,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {11057#false} assume 0 == ~cond; {11057#false} is VALID [2022-04-15 06:43:11,955 INFO L290 TraceCheckUtils]: 25: Hoare triple {11057#false} ~cond := #in~cond; {11057#false} is VALID [2022-04-15 06:43:11,955 INFO L272 TraceCheckUtils]: 24: Hoare triple {11057#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {11057#false} is VALID [2022-04-15 06:43:11,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {11057#false} assume !(~z~0 % 4294967296 > 0); {11057#false} is VALID [2022-04-15 06:43:11,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {11057#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11057#false} is VALID [2022-04-15 06:43:11,955 INFO L290 TraceCheckUtils]: 21: Hoare triple {11057#false} assume !(~x~0 % 4294967296 > 0); {11057#false} is VALID [2022-04-15 06:43:11,955 INFO L290 TraceCheckUtils]: 20: Hoare triple {11057#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; {11057#false} is VALID [2022-04-15 06:43:11,955 INFO L290 TraceCheckUtils]: 19: Hoare triple {11057#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; {11057#false} is VALID [2022-04-15 06:43:11,955 INFO L290 TraceCheckUtils]: 18: Hoare triple {11057#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; {11057#false} is VALID [2022-04-15 06:43:11,955 INFO L290 TraceCheckUtils]: 17: Hoare triple {11057#false} assume !(~y~0 % 4294967296 > 0); {11057#false} is VALID [2022-04-15 06:43:11,968 INFO L290 TraceCheckUtils]: 16: Hoare triple {11068#(<= 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; {11057#false} is VALID [2022-04-15 06:43:11,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {11067#(<= 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; {11068#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:43:11,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {11066#(<= 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; {11067#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:43:11,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {11109#(<= (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; {11066#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:11,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {11200#(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); {11109#(<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296))} is VALID [2022-04-15 06:43:11,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {11204#(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; {11200#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)))} is VALID [2022-04-15 06:43:11,973 INFO L290 TraceCheckUtils]: 10: Hoare triple {11208#(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; {11204#(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-15 06:43:11,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {11212#(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; {11208#(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-15 06:43:11,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {11056#true} ~z~0 := ~y~0; {11212#(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-15 06:43:11,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {11056#true} [124] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {11056#true} is VALID [2022-04-15 06:43:11,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {11056#true} [125] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_224 4294967296)) (.cse1 (= |v_main_#t~post5_94| |v_main_#t~post5_93|)) (.cse2 (= v_main_~x~0_224 v_main_~x~0_223)) (.cse3 (= |v_main_#t~post6_94| |v_main_#t~post6_93|))) (or (and (= v_main_~y~0_268 v_main_~y~0_269) (<= .cse0 0) .cse1 .cse2 .cse3) (and (forall ((v_it_20 Int)) (or (not (<= 1 v_it_20)) (< 0 (mod (+ v_main_~x~0_224 (* 4294967295 v_it_20)) 4294967296)) (not (<= (+ v_main_~y~0_269 v_it_20 1) v_main_~y~0_268)))) (< v_main_~y~0_269 v_main_~y~0_268) (= v_main_~x~0_223 (+ v_main_~x~0_224 v_main_~y~0_269 (* (- 1) v_main_~y~0_268))) (< 0 .cse0)) (and .cse1 (= v_main_~y~0_269 v_main_~y~0_268) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_269, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_224, main_#t~post6=|v_main_#t~post6_94|} OutVars{main_~y~0=v_main_~y~0_268, main_#t~post5=|v_main_#t~post5_93|, main_~x~0=v_main_~x~0_223, main_#t~post6=|v_main_#t~post6_93|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11056#true} is VALID [2022-04-15 06:43:11,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {11056#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11056#true} is VALID [2022-04-15 06:43:11,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {11056#true} call #t~ret15 := main(); {11056#true} is VALID [2022-04-15 06:43:11,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11056#true} {11056#true} #83#return; {11056#true} is VALID [2022-04-15 06:43:11,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {11056#true} assume true; {11056#true} is VALID [2022-04-15 06:43:11,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {11056#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11056#true} is VALID [2022-04-15 06:43:11,976 INFO L272 TraceCheckUtils]: 0: Hoare triple {11056#true} call ULTIMATE.init(); {11056#true} is VALID [2022-04-15 06:43:11,976 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-15 06:43:11,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014884153] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:43:11,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:43:11,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2022-04-15 06:43:12,144 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:43:12,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1233808076] [2022-04-15 06:43:12,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1233808076] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:43:12,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:43:12,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 06:43:12,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063413743] [2022-04-15 06:43:12,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:43:12,145 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 06:43:12,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:43:12,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:12,185 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-15 06:43:12,193 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 06:43:12,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:12,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 06:43:12,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-15 06:43:12,194 INFO L87 Difference]: Start difference. First operand 95 states and 134 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:14,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:14,559 INFO L93 Difference]: Finished difference Result 125 states and 167 transitions. [2022-04-15 06:43:14,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 06:43:14,559 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 06:43:14,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:43:14,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:14,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 57 transitions. [2022-04-15 06:43:14,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:14,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 57 transitions. [2022-04-15 06:43:14,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 57 transitions. [2022-04-15 06:43:14,637 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-15 06:43:14,639 INFO L225 Difference]: With dead ends: 125 [2022-04-15 06:43:14,639 INFO L226 Difference]: Without dead ends: 106 [2022-04-15 06:43:14,639 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=151, Invalid=905, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 06:43:14,639 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 30 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:43:14,640 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 70 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:43:14,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-15 06:43:15,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 91. [2022-04-15 06:43:15,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:43:15,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 91 states, 86 states have (on average 1.4069767441860466) internal successors, (121), 86 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:15,184 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 91 states, 86 states have (on average 1.4069767441860466) internal successors, (121), 86 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:15,184 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 91 states, 86 states have (on average 1.4069767441860466) internal successors, (121), 86 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:15,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:15,185 INFO L93 Difference]: Finished difference Result 106 states and 143 transitions. [2022-04-15 06:43:15,185 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 143 transitions. [2022-04-15 06:43:15,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:15,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:15,186 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 86 states have (on average 1.4069767441860466) internal successors, (121), 86 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 106 states. [2022-04-15 06:43:15,186 INFO L87 Difference]: Start difference. First operand has 91 states, 86 states have (on average 1.4069767441860466) internal successors, (121), 86 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 106 states. [2022-04-15 06:43:15,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:15,188 INFO L93 Difference]: Finished difference Result 106 states and 143 transitions. [2022-04-15 06:43:15,188 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 143 transitions. [2022-04-15 06:43:15,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:15,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:15,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:43:15,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:43:15,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.4069767441860466) internal successors, (121), 86 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:15,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 125 transitions. [2022-04-15 06:43:15,190 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 125 transitions. Word has length 30 [2022-04-15 06:43:15,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:43:15,190 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 125 transitions. [2022-04-15 06:43:15,190 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:15,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 125 transitions. [2022-04-15 06:43:19,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 124 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:43:19,144 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 125 transitions. [2022-04-15 06:43:19,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 06:43:19,144 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:43:19,144 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:43:19,160 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-15 06:43:19,345 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:43:19,345 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:43:19,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:43:19,345 INFO L85 PathProgramCache]: Analyzing trace with hash -543637167, now seen corresponding path program 9 times [2022-04-15 06:43:19,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:19,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [211951940] [2022-04-15 06:43:19,557 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-15 06:43:19,559 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:43:19,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1657570544, now seen corresponding path program 1 times [2022-04-15 06:43:19,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:43:19,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008009373] [2022-04-15 06:43:19,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:19,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:43:19,570 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-15 06:43:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:19,590 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-15 06:43:19,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:43:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:19,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {11935#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11919#true} is VALID [2022-04-15 06:43:19,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {11919#true} assume true; {11919#true} is VALID [2022-04-15 06:43:19,849 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11919#true} {11919#true} #83#return; {11919#true} is VALID [2022-04-15 06:43:19,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {11919#true} call ULTIMATE.init(); {11935#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:43:19,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {11935#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11919#true} is VALID [2022-04-15 06:43:19,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {11919#true} assume true; {11919#true} is VALID [2022-04-15 06:43:19,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11919#true} {11919#true} #83#return; {11919#true} is VALID [2022-04-15 06:43:19,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {11919#true} call #t~ret15 := main(); {11919#true} is VALID [2022-04-15 06:43:19,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {11919#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11919#true} is VALID [2022-04-15 06:43:19,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {11919#true} [127] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_99| |v_main_#t~post5_98|)) (.cse2 (= v_main_~x~0_239 v_main_~x~0_238)) (.cse3 (= |v_main_#t~post6_99| |v_main_#t~post6_98|)) (.cse0 (mod v_main_~x~0_239 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 (= v_main_~y~0_289 v_main_~y~0_290) .cse3) (and (= v_main_~y~0_290 v_main_~y~0_289) .cse1 .cse2 .cse3) (and (< v_main_~y~0_290 v_main_~y~0_289) (= v_main_~x~0_238 (+ v_main_~x~0_239 v_main_~y~0_290 (* (- 1) v_main_~y~0_289))) (forall ((v_it_21 Int)) (or (not (<= 1 v_it_21)) (not (<= (+ v_main_~y~0_290 v_it_21 1) v_main_~y~0_289)) (< 0 (mod (+ v_main_~x~0_239 (* 4294967295 v_it_21)) 4294967296)))) (< 0 .cse0)))) InVars {main_~y~0=v_main_~y~0_290, main_#t~post5=|v_main_#t~post5_99|, main_~x~0=v_main_~x~0_239, main_#t~post6=|v_main_#t~post6_99|} OutVars{main_~y~0=v_main_~y~0_289, main_#t~post5=|v_main_#t~post5_98|, main_~x~0=v_main_~x~0_238, main_#t~post6=|v_main_#t~post6_98|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11919#true} is VALID [2022-04-15 06:43:19,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {11919#true} [126] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {11919#true} is VALID [2022-04-15 06:43:19,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {11919#true} ~z~0 := ~y~0; {11924#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:43:19,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {11924#(= (+ 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; {11925#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:43:19,852 INFO L290 TraceCheckUtils]: 10: Hoare triple {11925#(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; {11926#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:43:19,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {11926#(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; {11927#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:43:19,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {11927#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {11928#(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-15 06:43:19,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {11928#(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; {11929#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:19,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {11929#(<= 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; {11930#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:43:19,857 INFO L290 TraceCheckUtils]: 15: Hoare triple {11930#(<= 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; {11931#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:43:19,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {11931#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {11931#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:43:19,859 INFO L290 TraceCheckUtils]: 17: Hoare triple {11931#(<= 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; {11930#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:43:19,860 INFO L290 TraceCheckUtils]: 18: Hoare triple {11930#(<= 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; {11929#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:19,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {11929#(<= 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; {11932#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:19,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {11932#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {11932#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:19,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {11932#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11929#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:19,864 INFO L290 TraceCheckUtils]: 22: Hoare triple {11929#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11930#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:43:19,865 INFO L290 TraceCheckUtils]: 23: Hoare triple {11930#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11931#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:43:19,865 INFO L290 TraceCheckUtils]: 24: Hoare triple {11931#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {11931#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:43:19,866 INFO L272 TraceCheckUtils]: 25: Hoare triple {11931#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {11933#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:43:19,867 INFO L290 TraceCheckUtils]: 26: Hoare triple {11933#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {11934#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:43:19,867 INFO L290 TraceCheckUtils]: 27: Hoare triple {11934#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {11920#false} is VALID [2022-04-15 06:43:19,867 INFO L290 TraceCheckUtils]: 28: Hoare triple {11920#false} assume !false; {11920#false} is VALID [2022-04-15 06:43:19,867 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:43:19,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:43:19,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008009373] [2022-04-15 06:43:19,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008009373] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:43:19,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926181377] [2022-04-15 06:43:19,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:19,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:43:19,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:43:19,869 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-15 06:43:19,897 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-15 06:43:19,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:19,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-15 06:43:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:19,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:43:20,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {11919#true} call ULTIMATE.init(); {11919#true} is VALID [2022-04-15 06:43:20,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {11919#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11919#true} is VALID [2022-04-15 06:43:20,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {11919#true} assume true; {11919#true} is VALID [2022-04-15 06:43:20,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11919#true} {11919#true} #83#return; {11919#true} is VALID [2022-04-15 06:43:20,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {11919#true} call #t~ret15 := main(); {11919#true} is VALID [2022-04-15 06:43:20,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {11919#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11919#true} is VALID [2022-04-15 06:43:20,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {11919#true} [127] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_99| |v_main_#t~post5_98|)) (.cse2 (= v_main_~x~0_239 v_main_~x~0_238)) (.cse3 (= |v_main_#t~post6_99| |v_main_#t~post6_98|)) (.cse0 (mod v_main_~x~0_239 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 (= v_main_~y~0_289 v_main_~y~0_290) .cse3) (and (= v_main_~y~0_290 v_main_~y~0_289) .cse1 .cse2 .cse3) (and (< v_main_~y~0_290 v_main_~y~0_289) (= v_main_~x~0_238 (+ v_main_~x~0_239 v_main_~y~0_290 (* (- 1) v_main_~y~0_289))) (forall ((v_it_21 Int)) (or (not (<= 1 v_it_21)) (not (<= (+ v_main_~y~0_290 v_it_21 1) v_main_~y~0_289)) (< 0 (mod (+ v_main_~x~0_239 (* 4294967295 v_it_21)) 4294967296)))) (< 0 .cse0)))) InVars {main_~y~0=v_main_~y~0_290, main_#t~post5=|v_main_#t~post5_99|, main_~x~0=v_main_~x~0_239, main_#t~post6=|v_main_#t~post6_99|} OutVars{main_~y~0=v_main_~y~0_289, main_#t~post5=|v_main_#t~post5_98|, main_~x~0=v_main_~x~0_238, main_#t~post6=|v_main_#t~post6_98|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11919#true} is VALID [2022-04-15 06:43:20,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {11919#true} [126] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {11919#true} is VALID [2022-04-15 06:43:20,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {11919#true} ~z~0 := ~y~0; {11924#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:43:20,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {11924#(= (+ 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; {11925#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:43:20,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {11925#(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; {11926#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:43:20,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {11926#(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; {11927#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:43:20,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {11927#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {11927#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:43:20,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {11927#(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; {11925#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:43:20,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {11925#(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; {11981#(and (<= (+ main_~y~0 1) main_~z~0) (<= main_~z~0 (+ main_~y~0 1)))} is VALID [2022-04-15 06:43:20,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {11981#(and (<= (+ main_~y~0 1) main_~z~0) (<= main_~z~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; {11985#(and (<= (+ main_~y~0 3) main_~z~0) (<= main_~z~0 (+ main_~y~0 3)))} is VALID [2022-04-15 06:43:20,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {11985#(and (<= (+ main_~y~0 3) main_~z~0) (<= main_~z~0 (+ main_~y~0 3)))} assume !(~y~0 % 4294967296 > 0); {11989#(and (not (< 0 (mod main_~y~0 4294967296))) (<= (+ main_~y~0 3) main_~z~0) (<= main_~z~0 (+ main_~y~0 3)))} is VALID [2022-04-15 06:43:20,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {11989#(and (not (< 0 (mod main_~y~0 4294967296))) (<= (+ main_~y~0 3) main_~z~0) (<= main_~z~0 (+ main_~y~0 3)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {11993#(and (<= main_~z~0 (+ main_~y~0 2)) (<= (+ main_~y~0 2) main_~z~0) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-15 06:43:20,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {11993#(and (<= main_~z~0 (+ main_~y~0 2)) (<= (+ main_~y~0 2) main_~z~0) (not (< 0 (mod (+ main_~y~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; {11997#(and (<= (+ main_~y~0 1) main_~z~0) (<= main_~z~0 (+ main_~y~0 1)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-15 06:43:20,566 INFO L290 TraceCheckUtils]: 19: Hoare triple {11997#(and (<= (+ main_~y~0 1) main_~z~0) (<= main_~z~0 (+ main_~y~0 1)) (not (< 0 (mod (+ main_~y~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; {12001#(and (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:43:20,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {12001#(and (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {12001#(and (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:43:20,567 INFO L290 TraceCheckUtils]: 21: Hoare triple {12001#(and (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12008#(and (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:43:20,568 INFO L290 TraceCheckUtils]: 22: Hoare triple {12008#(and (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12012#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-15 06:43:20,569 INFO L290 TraceCheckUtils]: 23: Hoare triple {12012#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11931#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:43:20,569 INFO L290 TraceCheckUtils]: 24: Hoare triple {11931#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {11931#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:43:20,570 INFO L272 TraceCheckUtils]: 25: Hoare triple {11931#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {12022#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:43:20,570 INFO L290 TraceCheckUtils]: 26: Hoare triple {12022#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12026#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:43:20,571 INFO L290 TraceCheckUtils]: 27: Hoare triple {12026#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11920#false} is VALID [2022-04-15 06:43:20,571 INFO L290 TraceCheckUtils]: 28: Hoare triple {11920#false} assume !false; {11920#false} is VALID [2022-04-15 06:43:20,571 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:43:20,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:43:20,721 INFO L290 TraceCheckUtils]: 28: Hoare triple {11920#false} assume !false; {11920#false} is VALID [2022-04-15 06:43:20,724 INFO L290 TraceCheckUtils]: 27: Hoare triple {12026#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11920#false} is VALID [2022-04-15 06:43:20,724 INFO L290 TraceCheckUtils]: 26: Hoare triple {12022#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12026#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:43:20,725 INFO L272 TraceCheckUtils]: 25: Hoare triple {11931#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {12022#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:43:20,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {11931#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {11931#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:43:20,726 INFO L290 TraceCheckUtils]: 23: Hoare triple {11930#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11931#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:43:20,727 INFO L290 TraceCheckUtils]: 22: Hoare triple {11929#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11930#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:43:20,728 INFO L290 TraceCheckUtils]: 21: Hoare triple {11932#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11929#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:20,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {11932#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {11932#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:20,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {11929#(<= 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; {11932#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:20,730 INFO L290 TraceCheckUtils]: 18: Hoare triple {11930#(<= 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; {11929#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:20,731 INFO L290 TraceCheckUtils]: 17: Hoare triple {11931#(<= 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; {11930#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:43:20,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {11919#true} assume !(~y~0 % 4294967296 > 0); {11931#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:43:20,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {11919#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; {11919#true} is VALID [2022-04-15 06:43:20,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {11919#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; {11919#true} is VALID [2022-04-15 06:43:20,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {11919#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; {11919#true} is VALID [2022-04-15 06:43:20,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {11919#true} assume !(~z~0 % 4294967296 > 0); {11919#true} is VALID [2022-04-15 06:43:20,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {11919#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; {11919#true} is VALID [2022-04-15 06:43:20,732 INFO L290 TraceCheckUtils]: 10: Hoare triple {11919#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; {11919#true} is VALID [2022-04-15 06:43:20,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {11919#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; {11919#true} is VALID [2022-04-15 06:43:20,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {11919#true} ~z~0 := ~y~0; {11919#true} is VALID [2022-04-15 06:43:20,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {11919#true} [126] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {11919#true} is VALID [2022-04-15 06:43:20,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {11919#true} [127] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_99| |v_main_#t~post5_98|)) (.cse2 (= v_main_~x~0_239 v_main_~x~0_238)) (.cse3 (= |v_main_#t~post6_99| |v_main_#t~post6_98|)) (.cse0 (mod v_main_~x~0_239 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 (= v_main_~y~0_289 v_main_~y~0_290) .cse3) (and (= v_main_~y~0_290 v_main_~y~0_289) .cse1 .cse2 .cse3) (and (< v_main_~y~0_290 v_main_~y~0_289) (= v_main_~x~0_238 (+ v_main_~x~0_239 v_main_~y~0_290 (* (- 1) v_main_~y~0_289))) (forall ((v_it_21 Int)) (or (not (<= 1 v_it_21)) (not (<= (+ v_main_~y~0_290 v_it_21 1) v_main_~y~0_289)) (< 0 (mod (+ v_main_~x~0_239 (* 4294967295 v_it_21)) 4294967296)))) (< 0 .cse0)))) InVars {main_~y~0=v_main_~y~0_290, main_#t~post5=|v_main_#t~post5_99|, main_~x~0=v_main_~x~0_239, main_#t~post6=|v_main_#t~post6_99|} OutVars{main_~y~0=v_main_~y~0_289, main_#t~post5=|v_main_#t~post5_98|, main_~x~0=v_main_~x~0_238, main_#t~post6=|v_main_#t~post6_98|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11919#true} is VALID [2022-04-15 06:43:20,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {11919#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11919#true} is VALID [2022-04-15 06:43:20,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {11919#true} call #t~ret15 := main(); {11919#true} is VALID [2022-04-15 06:43:20,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11919#true} {11919#true} #83#return; {11919#true} is VALID [2022-04-15 06:43:20,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {11919#true} assume true; {11919#true} is VALID [2022-04-15 06:43:20,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {11919#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11919#true} is VALID [2022-04-15 06:43:20,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {11919#true} call ULTIMATE.init(); {11919#true} is VALID [2022-04-15 06:43:20,738 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 06:43:20,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926181377] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:43:20,738 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:43:20,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 8] total 24 [2022-04-15 06:43:20,872 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:43:20,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [211951940] [2022-04-15 06:43:20,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [211951940] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:43:20,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:43:20,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 06:43:20,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857882416] [2022-04-15 06:43:20,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:43:20,872 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) 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 31 [2022-04-15 06:43:20,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:43:20,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.588235294117647) 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-15 06:43:20,904 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-15 06:43:20,905 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 06:43:20,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:20,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 06:43:20,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=633, Unknown=0, NotChecked=0, Total=702 [2022-04-15 06:43:20,905 INFO L87 Difference]: Start difference. First operand 91 states and 125 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) 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-15 06:43:24,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:24,247 INFO L93 Difference]: Finished difference Result 201 states and 279 transitions. [2022-04-15 06:43:24,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 06:43:24,247 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) 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 31 [2022-04-15 06:43:24,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:43:24,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.588235294117647) 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-15 06:43:24,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 75 transitions. [2022-04-15 06:43:24,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.588235294117647) 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-15 06:43:24,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 75 transitions. [2022-04-15 06:43:24,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 75 transitions. [2022-04-15 06:43:24,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:43:24,357 INFO L225 Difference]: With dead ends: 201 [2022-04-15 06:43:24,357 INFO L226 Difference]: Without dead ends: 109 [2022-04-15 06:43:24,358 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 55 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=206, Invalid=1956, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 06:43:24,359 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 54 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:43:24,359 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 84 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 06:43:24,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-15 06:43:24,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 96. [2022-04-15 06:43:24,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:43:24,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 96 states, 91 states have (on average 1.4395604395604396) internal successors, (131), 91 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:24,953 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 96 states, 91 states have (on average 1.4395604395604396) internal successors, (131), 91 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:24,953 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 96 states, 91 states have (on average 1.4395604395604396) internal successors, (131), 91 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:24,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:24,955 INFO L93 Difference]: Finished difference Result 109 states and 150 transitions. [2022-04-15 06:43:24,955 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 150 transitions. [2022-04-15 06:43:24,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:24,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:24,955 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 91 states have (on average 1.4395604395604396) internal successors, (131), 91 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 109 states. [2022-04-15 06:43:24,955 INFO L87 Difference]: Start difference. First operand has 96 states, 91 states have (on average 1.4395604395604396) internal successors, (131), 91 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 109 states. [2022-04-15 06:43:24,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:24,957 INFO L93 Difference]: Finished difference Result 109 states and 150 transitions. [2022-04-15 06:43:24,957 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 150 transitions. [2022-04-15 06:43:24,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:24,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:24,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:43:24,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:43:24,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 91 states have (on average 1.4395604395604396) internal successors, (131), 91 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:24,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions. [2022-04-15 06:43:24,959 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 31 [2022-04-15 06:43:24,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:43:24,959 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 135 transitions. [2022-04-15 06:43:24,959 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.588235294117647) 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-15 06:43:24,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 135 transitions. [2022-04-15 06:43:31,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 133 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 06:43:31,725 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions. [2022-04-15 06:43:31,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 06:43:31,725 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:43:31,725 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:43:31,741 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-15 06:43:31,925 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:43:31,926 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:43:31,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:43:31,926 INFO L85 PathProgramCache]: Analyzing trace with hash -489644828, now seen corresponding path program 10 times [2022-04-15 06:43:31,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:31,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2085752931] [2022-04-15 06:43:32,129 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-15 06:43:32,131 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:43:32,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1756115184, now seen corresponding path program 1 times [2022-04-15 06:43:32,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:43:32,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127984871] [2022-04-15 06:43:32,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:32,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:43:32,156 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-15 06:43:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:32,174 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_22.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:43:32,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:43:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:32,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {12989#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12977#true} is VALID [2022-04-15 06:43:32,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {12977#true} assume true; {12977#true} is VALID [2022-04-15 06:43:32,306 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12977#true} {12977#true} #83#return; {12977#true} is VALID [2022-04-15 06:43:32,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {12977#true} call ULTIMATE.init(); {12989#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:43:32,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {12989#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12977#true} is VALID [2022-04-15 06:43:32,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {12977#true} assume true; {12977#true} is VALID [2022-04-15 06:43:32,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12977#true} {12977#true} #83#return; {12977#true} is VALID [2022-04-15 06:43:32,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {12977#true} call #t~ret15 := main(); {12977#true} is VALID [2022-04-15 06:43:32,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {12977#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12977#true} is VALID [2022-04-15 06:43:32,307 INFO L290 TraceCheckUtils]: 6: Hoare triple {12977#true} [129] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_314 v_main_~y~0_313)) (.cse1 (= |v_main_#t~post5_104| |v_main_#t~post5_103|)) (.cse2 (= v_main_~x~0_251 v_main_~x~0_250)) (.cse3 (= |v_main_#t~post6_104| |v_main_#t~post6_103|)) (.cse4 (mod v_main_~x~0_251 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_251 v_main_~y~0_314 (* v_main_~x~0_250 (- 1))) v_main_~y~0_313) (< v_main_~x~0_250 v_main_~x~0_251) (forall ((v_it_22 Int)) (or (< 0 (mod (+ v_main_~x~0_251 (* 4294967295 v_it_22)) 4294967296)) (not (<= (+ v_main_~x~0_250 v_it_22 1) v_main_~x~0_251)) (not (<= 1 v_it_22)))) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_314, main_#t~post5=|v_main_#t~post5_104|, main_~x~0=v_main_~x~0_251, main_#t~post6=|v_main_#t~post6_104|} OutVars{main_~y~0=v_main_~y~0_313, main_#t~post5=|v_main_#t~post5_103|, main_~x~0=v_main_~x~0_250, main_#t~post6=|v_main_#t~post6_103|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12977#true} is VALID [2022-04-15 06:43:32,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {12977#true} [128] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {12982#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:43:32,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {12982#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {12982#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:43:32,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {12982#(<= 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; {12983#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:43:32,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {12983#(<= 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; {12984#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:32,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {12984#(<= 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; {12985#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:32,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {12985#(<= 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; {12986#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:32,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {12986#(<= 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; {12987#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:43:32,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {12987#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {12987#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:43:32,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {12987#(<= 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; {12987#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:43:32,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {12987#(<= 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; {12987#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:43:32,314 INFO L290 TraceCheckUtils]: 17: Hoare triple {12987#(<= 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; {12987#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:43:32,314 INFO L290 TraceCheckUtils]: 18: Hoare triple {12987#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~y~0 % 4294967296 > 0); {12987#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:43:32,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {12987#(<= 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; {12988#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 06:43:32,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {12988#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {12978#false} is VALID [2022-04-15 06:43:32,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {12978#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12978#false} is VALID [2022-04-15 06:43:32,316 INFO L290 TraceCheckUtils]: 22: Hoare triple {12978#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12978#false} is VALID [2022-04-15 06:43:32,316 INFO L290 TraceCheckUtils]: 23: Hoare triple {12978#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12978#false} is VALID [2022-04-15 06:43:32,316 INFO L290 TraceCheckUtils]: 24: Hoare triple {12978#false} assume !(~z~0 % 4294967296 > 0); {12978#false} is VALID [2022-04-15 06:43:32,316 INFO L272 TraceCheckUtils]: 25: Hoare triple {12978#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {12978#false} is VALID [2022-04-15 06:43:32,316 INFO L290 TraceCheckUtils]: 26: Hoare triple {12978#false} ~cond := #in~cond; {12978#false} is VALID [2022-04-15 06:43:32,316 INFO L290 TraceCheckUtils]: 27: Hoare triple {12978#false} assume 0 == ~cond; {12978#false} is VALID [2022-04-15 06:43:32,316 INFO L290 TraceCheckUtils]: 28: Hoare triple {12978#false} assume !false; {12978#false} is VALID [2022-04-15 06:43:32,316 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-15 06:43:32,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:43:32,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127984871] [2022-04-15 06:43:32,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127984871] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:43:32,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092816700] [2022-04-15 06:43:32,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:32,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:43:32,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:43:32,318 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-15 06:43:32,318 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-15 06:43:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:32,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 06:43:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:32,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:43:32,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {12977#true} call ULTIMATE.init(); {12977#true} is VALID [2022-04-15 06:43:32,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {12977#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12977#true} is VALID [2022-04-15 06:43:32,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {12977#true} assume true; {12977#true} is VALID [2022-04-15 06:43:32,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12977#true} {12977#true} #83#return; {12977#true} is VALID [2022-04-15 06:43:32,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {12977#true} call #t~ret15 := main(); {12977#true} is VALID [2022-04-15 06:43:32,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {12977#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12977#true} is VALID [2022-04-15 06:43:32,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {12977#true} [129] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_314 v_main_~y~0_313)) (.cse1 (= |v_main_#t~post5_104| |v_main_#t~post5_103|)) (.cse2 (= v_main_~x~0_251 v_main_~x~0_250)) (.cse3 (= |v_main_#t~post6_104| |v_main_#t~post6_103|)) (.cse4 (mod v_main_~x~0_251 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_251 v_main_~y~0_314 (* v_main_~x~0_250 (- 1))) v_main_~y~0_313) (< v_main_~x~0_250 v_main_~x~0_251) (forall ((v_it_22 Int)) (or (< 0 (mod (+ v_main_~x~0_251 (* 4294967295 v_it_22)) 4294967296)) (not (<= (+ v_main_~x~0_250 v_it_22 1) v_main_~x~0_251)) (not (<= 1 v_it_22)))) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_314, main_#t~post5=|v_main_#t~post5_104|, main_~x~0=v_main_~x~0_251, main_#t~post6=|v_main_#t~post6_104|} OutVars{main_~y~0=v_main_~y~0_313, main_#t~post5=|v_main_#t~post5_103|, main_~x~0=v_main_~x~0_250, main_#t~post6=|v_main_#t~post6_103|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12977#true} is VALID [2022-04-15 06:43:32,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {12977#true} [128] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {12977#true} is VALID [2022-04-15 06:43:32,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {12977#true} ~z~0 := ~y~0; {13017#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:43:32,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {13017#(= 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; {13021#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:43:32,562 INFO L290 TraceCheckUtils]: 10: Hoare triple {13021#(= 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; {13025#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-15 06:43:32,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {13025#(= 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; {13029#(= main_~y~0 (+ main_~z~0 3))} is VALID [2022-04-15 06:43:32,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {13029#(= 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; {13033#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-15 06:43:32,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {13033#(< 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; {13033#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-15 06:43:32,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {13033#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~z~0 % 4294967296 > 0); {13033#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-15 06:43:32,565 INFO L290 TraceCheckUtils]: 15: Hoare triple {13033#(< 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; {13043#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:43:32,566 INFO L290 TraceCheckUtils]: 16: Hoare triple {13043#(< 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; {13047#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:43:32,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {13047#(< 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; {13051#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:43:32,567 INFO L290 TraceCheckUtils]: 18: Hoare triple {13051#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {12978#false} is VALID [2022-04-15 06:43:32,567 INFO L290 TraceCheckUtils]: 19: Hoare triple {12978#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; {12978#false} is VALID [2022-04-15 06:43:32,567 INFO L290 TraceCheckUtils]: 20: Hoare triple {12978#false} assume !(~x~0 % 4294967296 > 0); {12978#false} is VALID [2022-04-15 06:43:32,568 INFO L290 TraceCheckUtils]: 21: Hoare triple {12978#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12978#false} is VALID [2022-04-15 06:43:32,568 INFO L290 TraceCheckUtils]: 22: Hoare triple {12978#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12978#false} is VALID [2022-04-15 06:43:32,568 INFO L290 TraceCheckUtils]: 23: Hoare triple {12978#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12978#false} is VALID [2022-04-15 06:43:32,568 INFO L290 TraceCheckUtils]: 24: Hoare triple {12978#false} assume !(~z~0 % 4294967296 > 0); {12978#false} is VALID [2022-04-15 06:43:32,568 INFO L272 TraceCheckUtils]: 25: Hoare triple {12978#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {12978#false} is VALID [2022-04-15 06:43:32,568 INFO L290 TraceCheckUtils]: 26: Hoare triple {12978#false} ~cond := #in~cond; {12978#false} is VALID [2022-04-15 06:43:32,568 INFO L290 TraceCheckUtils]: 27: Hoare triple {12978#false} assume 0 == ~cond; {12978#false} is VALID [2022-04-15 06:43:32,568 INFO L290 TraceCheckUtils]: 28: Hoare triple {12978#false} assume !false; {12978#false} is VALID [2022-04-15 06:43:32,568 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 06:43:32,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:43:32,797 INFO L290 TraceCheckUtils]: 28: Hoare triple {12978#false} assume !false; {12978#false} is VALID [2022-04-15 06:43:32,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {12978#false} assume 0 == ~cond; {12978#false} is VALID [2022-04-15 06:43:32,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {12978#false} ~cond := #in~cond; {12978#false} is VALID [2022-04-15 06:43:32,797 INFO L272 TraceCheckUtils]: 25: Hoare triple {12978#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {12978#false} is VALID [2022-04-15 06:43:32,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {12978#false} assume !(~z~0 % 4294967296 > 0); {12978#false} is VALID [2022-04-15 06:43:32,797 INFO L290 TraceCheckUtils]: 23: Hoare triple {12978#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12978#false} is VALID [2022-04-15 06:43:32,797 INFO L290 TraceCheckUtils]: 22: Hoare triple {12978#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12978#false} is VALID [2022-04-15 06:43:32,797 INFO L290 TraceCheckUtils]: 21: Hoare triple {12978#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12978#false} is VALID [2022-04-15 06:43:32,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {12978#false} assume !(~x~0 % 4294967296 > 0); {12978#false} is VALID [2022-04-15 06:43:32,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {12978#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; {12978#false} is VALID [2022-04-15 06:43:32,798 INFO L290 TraceCheckUtils]: 18: Hoare triple {13051#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {12978#false} is VALID [2022-04-15 06:43:32,799 INFO L290 TraceCheckUtils]: 17: Hoare triple {13047#(< 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; {13051#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:43:32,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {13043#(< 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; {13047#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:43:32,801 INFO L290 TraceCheckUtils]: 15: Hoare triple {13033#(< 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; {13043#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:43:32,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {13033#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~z~0 % 4294967296 > 0); {13033#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-15 06:43:32,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {13033#(< 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; {13033#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-15 06:43:32,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {13133#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13033#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-15 06:43:32,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {13137#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13133#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:43:32,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {13141#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13137#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:43:32,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {13145#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13141#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:43:32,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {12977#true} ~z~0 := ~y~0; {13145#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:43:32,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {12977#true} [128] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {12977#true} is VALID [2022-04-15 06:43:32,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {12977#true} [129] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_314 v_main_~y~0_313)) (.cse1 (= |v_main_#t~post5_104| |v_main_#t~post5_103|)) (.cse2 (= v_main_~x~0_251 v_main_~x~0_250)) (.cse3 (= |v_main_#t~post6_104| |v_main_#t~post6_103|)) (.cse4 (mod v_main_~x~0_251 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_251 v_main_~y~0_314 (* v_main_~x~0_250 (- 1))) v_main_~y~0_313) (< v_main_~x~0_250 v_main_~x~0_251) (forall ((v_it_22 Int)) (or (< 0 (mod (+ v_main_~x~0_251 (* 4294967295 v_it_22)) 4294967296)) (not (<= (+ v_main_~x~0_250 v_it_22 1) v_main_~x~0_251)) (not (<= 1 v_it_22)))) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_314, main_#t~post5=|v_main_#t~post5_104|, main_~x~0=v_main_~x~0_251, main_#t~post6=|v_main_#t~post6_104|} OutVars{main_~y~0=v_main_~y~0_313, main_#t~post5=|v_main_#t~post5_103|, main_~x~0=v_main_~x~0_250, main_#t~post6=|v_main_#t~post6_103|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12977#true} is VALID [2022-04-15 06:43:32,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {12977#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12977#true} is VALID [2022-04-15 06:43:32,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {12977#true} call #t~ret15 := main(); {12977#true} is VALID [2022-04-15 06:43:32,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12977#true} {12977#true} #83#return; {12977#true} is VALID [2022-04-15 06:43:32,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {12977#true} assume true; {12977#true} is VALID [2022-04-15 06:43:32,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {12977#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12977#true} is VALID [2022-04-15 06:43:32,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {12977#true} call ULTIMATE.init(); {12977#true} is VALID [2022-04-15 06:43:32,807 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 06:43:32,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092816700] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:43:32,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:43:32,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2022-04-15 06:43:33,087 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:43:33,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2085752931] [2022-04-15 06:43:33,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2085752931] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:43:33,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:43:33,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 06:43:33,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337077329] [2022-04-15 06:43:33,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:43:33,088 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 06:43:33,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:43:33,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:33,120 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-15 06:43:33,120 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 06:43:33,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:33,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 06:43:33,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2022-04-15 06:43:33,121 INFO L87 Difference]: Start difference. First operand 96 states and 135 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:35,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:35,950 INFO L93 Difference]: Finished difference Result 206 states and 315 transitions. [2022-04-15 06:43:35,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 06:43:35,950 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 06:43:35,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:43:35,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:35,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 91 transitions. [2022-04-15 06:43:35,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:35,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 91 transitions. [2022-04-15 06:43:35,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 91 transitions. [2022-04-15 06:43:36,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:43:36,140 INFO L225 Difference]: With dead ends: 206 [2022-04-15 06:43:36,140 INFO L226 Difference]: Without dead ends: 186 [2022-04-15 06:43:36,141 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=251, Invalid=1389, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 06:43:36,141 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 101 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:43:36,141 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 37 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:43:36,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-15 06:43:36,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 109. [2022-04-15 06:43:36,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:43:36,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 109 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 104 states have internal predecessors, (151), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:36,879 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 109 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 104 states have internal predecessors, (151), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:36,879 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 109 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 104 states have internal predecessors, (151), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:36,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:36,882 INFO L93 Difference]: Finished difference Result 186 states and 269 transitions. [2022-04-15 06:43:36,882 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 269 transitions. [2022-04-15 06:43:36,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:36,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:36,882 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 104 states have internal predecessors, (151), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 186 states. [2022-04-15 06:43:36,883 INFO L87 Difference]: Start difference. First operand has 109 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 104 states have internal predecessors, (151), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 186 states. [2022-04-15 06:43:36,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:36,885 INFO L93 Difference]: Finished difference Result 186 states and 269 transitions. [2022-04-15 06:43:36,885 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 269 transitions. [2022-04-15 06:43:36,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:36,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:36,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:43:36,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:43:36,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 104 states have internal predecessors, (151), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:36,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 155 transitions. [2022-04-15 06:43:36,888 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 155 transitions. Word has length 32 [2022-04-15 06:43:36,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:43:36,888 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 155 transitions. [2022-04-15 06:43:36,888 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:36,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 155 transitions. [2022-04-15 06:43:43,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 153 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 06:43:43,407 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 155 transitions. [2022-04-15 06:43:43,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 06:43:43,407 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:43:43,407 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:43:43,426 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-15 06:43:43,615 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-15 06:43:43,615 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:43:43,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:43:43,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1347809343, now seen corresponding path program 11 times [2022-04-15 06:43:43,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:43,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1459012968] [2022-04-15 06:43:43,847 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-15 06:43:43,849 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:43:43,851 INFO L85 PathProgramCache]: Analyzing trace with hash 401830741, now seen corresponding path program 1 times [2022-04-15 06:43:43,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:43:43,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586621600] [2022-04-15 06:43:43,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:43,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:43:43,869 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-15 06:43:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:43,909 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-15 06:43:44,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:43:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:44,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {14225#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14211#true} is VALID [2022-04-15 06:43:44,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {14211#true} assume true; {14211#true} is VALID [2022-04-15 06:43:44,069 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14211#true} {14211#true} #83#return; {14211#true} is VALID [2022-04-15 06:43:44,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {14211#true} call ULTIMATE.init(); {14225#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:43:44,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {14225#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14211#true} is VALID [2022-04-15 06:43:44,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {14211#true} assume true; {14211#true} is VALID [2022-04-15 06:43:44,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14211#true} {14211#true} #83#return; {14211#true} is VALID [2022-04-15 06:43:44,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {14211#true} call #t~ret15 := main(); {14211#true} is VALID [2022-04-15 06:43:44,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {14211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14211#true} is VALID [2022-04-15 06:43:44,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {14211#true} [131] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_334 v_main_~y~0_333)) (.cse1 (= v_main_~x~0_267 v_main_~x~0_266)) (.cse3 (= |v_main_#t~post6_109| |v_main_#t~post6_108|)) (.cse4 (= |v_main_#t~post5_109| |v_main_#t~post5_108|)) (.cse2 (mod v_main_~x~0_267 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (< 0 .cse2) (= v_main_~x~0_266 (+ v_main_~x~0_267 v_main_~y~0_334 (* (- 1) v_main_~y~0_333))) (< v_main_~y~0_334 v_main_~y~0_333) (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ v_main_~x~0_267 (* 4294967295 v_it_23)) 4294967296)) (not (<= (+ v_main_~y~0_334 v_it_23 1) v_main_~y~0_333))))))) InVars {main_~y~0=v_main_~y~0_334, main_#t~post5=|v_main_#t~post5_109|, main_~x~0=v_main_~x~0_267, main_#t~post6=|v_main_#t~post6_109|} OutVars{main_~y~0=v_main_~y~0_333, main_#t~post5=|v_main_#t~post5_108|, main_~x~0=v_main_~x~0_266, main_#t~post6=|v_main_#t~post6_108|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14211#true} is VALID [2022-04-15 06:43:44,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {14211#true} [130] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {14211#true} is VALID [2022-04-15 06:43:44,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {14211#true} ~z~0 := ~y~0; {14211#true} is VALID [2022-04-15 06:43:44,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {14211#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; {14216#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:44,072 INFO L290 TraceCheckUtils]: 10: Hoare triple {14216#(<= 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; {14217#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 06:43:44,073 INFO L290 TraceCheckUtils]: 11: Hoare triple {14217#(<= 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; {14218#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:44,074 INFO L290 TraceCheckUtils]: 12: Hoare triple {14218#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14219#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:44,074 INFO L290 TraceCheckUtils]: 13: Hoare triple {14219#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {14219#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:44,075 INFO L290 TraceCheckUtils]: 14: Hoare triple {14219#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14220#(<= main_~z~0 (+ 4294967292 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 06:43:44,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {14220#(<= main_~z~0 (+ 4294967292 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14221#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967293))} is VALID [2022-04-15 06:43:44,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {14221#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14222#(<= main_~z~0 (+ 4294967294 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:44,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {14222#(<= main_~z~0 (+ 4294967294 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14223#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-15 06:43:44,079 INFO L290 TraceCheckUtils]: 18: Hoare triple {14223#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} assume !(~y~0 % 4294967296 > 0); {14223#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-15 06:43:44,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {14223#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14223#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-15 06:43:44,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {14223#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14223#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-15 06:43:44,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {14223#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14223#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-15 06:43:44,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {14223#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14223#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-15 06:43:44,080 INFO L290 TraceCheckUtils]: 23: Hoare triple {14223#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} assume !(~x~0 % 4294967296 > 0); {14223#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-15 06:43:44,082 INFO L290 TraceCheckUtils]: 24: Hoare triple {14223#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14224#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:43:44,082 INFO L290 TraceCheckUtils]: 25: Hoare triple {14224#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {14212#false} is VALID [2022-04-15 06:43:44,082 INFO L272 TraceCheckUtils]: 26: Hoare triple {14212#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {14212#false} is VALID [2022-04-15 06:43:44,082 INFO L290 TraceCheckUtils]: 27: Hoare triple {14212#false} ~cond := #in~cond; {14212#false} is VALID [2022-04-15 06:43:44,082 INFO L290 TraceCheckUtils]: 28: Hoare triple {14212#false} assume 0 == ~cond; {14212#false} is VALID [2022-04-15 06:43:44,082 INFO L290 TraceCheckUtils]: 29: Hoare triple {14212#false} assume !false; {14212#false} is VALID [2022-04-15 06:43:44,083 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:43:44,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:43:44,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586621600] [2022-04-15 06:43:44,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586621600] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:43:44,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465246663] [2022-04-15 06:43:44,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:44,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:43:44,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:43:44,084 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-15 06:43:44,085 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-15 06:43:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:44,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 06:43:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:44,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:43:44,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {14211#true} call ULTIMATE.init(); {14211#true} is VALID [2022-04-15 06:43:44,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {14211#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14211#true} is VALID [2022-04-15 06:43:44,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {14211#true} assume true; {14211#true} is VALID [2022-04-15 06:43:44,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14211#true} {14211#true} #83#return; {14211#true} is VALID [2022-04-15 06:43:44,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {14211#true} call #t~ret15 := main(); {14211#true} is VALID [2022-04-15 06:43:44,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {14211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14211#true} is VALID [2022-04-15 06:43:44,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {14211#true} [131] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_334 v_main_~y~0_333)) (.cse1 (= v_main_~x~0_267 v_main_~x~0_266)) (.cse3 (= |v_main_#t~post6_109| |v_main_#t~post6_108|)) (.cse4 (= |v_main_#t~post5_109| |v_main_#t~post5_108|)) (.cse2 (mod v_main_~x~0_267 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (< 0 .cse2) (= v_main_~x~0_266 (+ v_main_~x~0_267 v_main_~y~0_334 (* (- 1) v_main_~y~0_333))) (< v_main_~y~0_334 v_main_~y~0_333) (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ v_main_~x~0_267 (* 4294967295 v_it_23)) 4294967296)) (not (<= (+ v_main_~y~0_334 v_it_23 1) v_main_~y~0_333))))))) InVars {main_~y~0=v_main_~y~0_334, main_#t~post5=|v_main_#t~post5_109|, main_~x~0=v_main_~x~0_267, main_#t~post6=|v_main_#t~post6_109|} OutVars{main_~y~0=v_main_~y~0_333, main_#t~post5=|v_main_#t~post5_108|, main_~x~0=v_main_~x~0_266, main_#t~post6=|v_main_#t~post6_108|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14211#true} is VALID [2022-04-15 06:43:44,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {14211#true} [130] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {14211#true} is VALID [2022-04-15 06:43:44,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {14211#true} ~z~0 := ~y~0; {14253#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:43:44,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {14253#(= 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; {14257#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:43:44,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {14257#(= 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; {14261#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:43:44,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {14261#(= (+ 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; {14265#(= (+ main_~z~0 2) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:43:44,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {14265#(= (+ 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; {14269#(= (+ main_~y~0 (- 3)) (+ main_~z~0 1))} is VALID [2022-04-15 06:43:44,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {14269#(= (+ main_~y~0 (- 3)) (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {14269#(= (+ main_~y~0 (- 3)) (+ main_~z~0 1))} is VALID [2022-04-15 06:43:44,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {14269#(= (+ 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; {14261#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:43:44,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {14261#(= (+ 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; {14216#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:44,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {14216#(<= 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; {14282#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 06:43:44,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {14282#(<= main_~z~0 (+ 4294967295 (* 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; {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:43:44,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~y~0 % 4294967296 > 0); {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:43:44,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) 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; {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:43:44,590 INFO L290 TraceCheckUtils]: 20: Hoare triple {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) 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; {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:43:44,591 INFO L290 TraceCheckUtils]: 21: Hoare triple {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) 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; {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:43:44,591 INFO L290 TraceCheckUtils]: 22: Hoare triple {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) 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; {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:43:44,591 INFO L290 TraceCheckUtils]: 23: Hoare triple {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~x~0 % 4294967296 > 0); {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:43:44,592 INFO L290 TraceCheckUtils]: 24: Hoare triple {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14282#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 06:43:44,593 INFO L290 TraceCheckUtils]: 25: Hoare triple {14282#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {14212#false} is VALID [2022-04-15 06:43:44,593 INFO L272 TraceCheckUtils]: 26: Hoare triple {14212#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {14212#false} is VALID [2022-04-15 06:43:44,593 INFO L290 TraceCheckUtils]: 27: Hoare triple {14212#false} ~cond := #in~cond; {14212#false} is VALID [2022-04-15 06:43:44,593 INFO L290 TraceCheckUtils]: 28: Hoare triple {14212#false} assume 0 == ~cond; {14212#false} is VALID [2022-04-15 06:43:44,593 INFO L290 TraceCheckUtils]: 29: Hoare triple {14212#false} assume !false; {14212#false} is VALID [2022-04-15 06:43:44,594 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-15 06:43:44,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:43:45,065 INFO L290 TraceCheckUtils]: 29: Hoare triple {14212#false} assume !false; {14212#false} is VALID [2022-04-15 06:43:45,065 INFO L290 TraceCheckUtils]: 28: Hoare triple {14212#false} assume 0 == ~cond; {14212#false} is VALID [2022-04-15 06:43:45,065 INFO L290 TraceCheckUtils]: 27: Hoare triple {14212#false} ~cond := #in~cond; {14212#false} is VALID [2022-04-15 06:43:45,065 INFO L272 TraceCheckUtils]: 26: Hoare triple {14212#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {14212#false} is VALID [2022-04-15 06:43:45,066 INFO L290 TraceCheckUtils]: 25: Hoare triple {14282#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {14212#false} is VALID [2022-04-15 06:43:45,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14282#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 06:43:45,068 INFO L290 TraceCheckUtils]: 23: Hoare triple {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~x~0 % 4294967296 > 0); {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:43:45,068 INFO L290 TraceCheckUtils]: 22: Hoare triple {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) 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; {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:43:45,068 INFO L290 TraceCheckUtils]: 21: Hoare triple {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) 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; {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:43:45,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) 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; {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:43:45,069 INFO L290 TraceCheckUtils]: 19: Hoare triple {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) 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; {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:43:45,069 INFO L290 TraceCheckUtils]: 18: Hoare triple {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~y~0 % 4294967296 > 0); {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:43:45,070 INFO L290 TraceCheckUtils]: 17: Hoare triple {14282#(<= main_~z~0 (+ 4294967295 (* 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; {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:43:45,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {14216#(<= 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; {14282#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 06:43:45,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {14365#(or (not (< 0 (mod main_~y~0 4294967296))) (<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14216#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:45,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {14369#(or (<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 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; {14365#(or (not (< 0 (mod main_~y~0 4294967296))) (<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-15 06:43:45,074 INFO L290 TraceCheckUtils]: 13: Hoare triple {14369#(or (<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {14369#(or (<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-15 06:43:45,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {14376#(or (<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293)) (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; {14369#(or (<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-15 06:43:45,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {14380#(or (<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 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; {14376#(or (<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-15 06:43:45,077 INFO L290 TraceCheckUtils]: 10: Hoare triple {14384#(or (<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {14380#(or (<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296))) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-15 06:43:45,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {14388#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {14384#(or (<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)))) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-15 06:43:45,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {14211#true} ~z~0 := ~y~0; {14388#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-15 06:43:45,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {14211#true} [130] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {14211#true} is VALID [2022-04-15 06:43:45,080 INFO L290 TraceCheckUtils]: 6: Hoare triple {14211#true} [131] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_334 v_main_~y~0_333)) (.cse1 (= v_main_~x~0_267 v_main_~x~0_266)) (.cse3 (= |v_main_#t~post6_109| |v_main_#t~post6_108|)) (.cse4 (= |v_main_#t~post5_109| |v_main_#t~post5_108|)) (.cse2 (mod v_main_~x~0_267 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (< 0 .cse2) (= v_main_~x~0_266 (+ v_main_~x~0_267 v_main_~y~0_334 (* (- 1) v_main_~y~0_333))) (< v_main_~y~0_334 v_main_~y~0_333) (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ v_main_~x~0_267 (* 4294967295 v_it_23)) 4294967296)) (not (<= (+ v_main_~y~0_334 v_it_23 1) v_main_~y~0_333))))))) InVars {main_~y~0=v_main_~y~0_334, main_#t~post5=|v_main_#t~post5_109|, main_~x~0=v_main_~x~0_267, main_#t~post6=|v_main_#t~post6_109|} OutVars{main_~y~0=v_main_~y~0_333, main_#t~post5=|v_main_#t~post5_108|, main_~x~0=v_main_~x~0_266, main_#t~post6=|v_main_#t~post6_108|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14211#true} is VALID [2022-04-15 06:43:45,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {14211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14211#true} is VALID [2022-04-15 06:43:45,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {14211#true} call #t~ret15 := main(); {14211#true} is VALID [2022-04-15 06:43:45,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14211#true} {14211#true} #83#return; {14211#true} is VALID [2022-04-15 06:43:45,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {14211#true} assume true; {14211#true} is VALID [2022-04-15 06:43:45,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {14211#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14211#true} is VALID [2022-04-15 06:43:45,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {14211#true} call ULTIMATE.init(); {14211#true} is VALID [2022-04-15 06:43:45,080 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-15 06:43:45,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465246663] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:43:45,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:43:45,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 25 [2022-04-15 06:43:45,324 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:43:45,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1459012968] [2022-04-15 06:43:45,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1459012968] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:43:45,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:43:45,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 06:43:45,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694023915] [2022-04-15 06:43:45,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:43:45,325 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-15 06:43:45,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:43:45,325 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-15 06:43:45,369 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-15 06:43:45,369 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 06:43:45,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:45,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 06:43:45,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2022-04-15 06:43:45,370 INFO L87 Difference]: Start difference. First operand 109 states and 155 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-15 06:43:49,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:49,451 INFO L93 Difference]: Finished difference Result 165 states and 228 transitions. [2022-04-15 06:43:49,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 06:43:49,451 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-15 06:43:49,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:43:49,451 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-15 06:43:49,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 82 transitions. [2022-04-15 06:43:49,452 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-15 06:43:49,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 82 transitions. [2022-04-15 06:43:49,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 82 transitions. [2022-04-15 06:43:49,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:43:49,611 INFO L225 Difference]: With dead ends: 165 [2022-04-15 06:43:49,611 INFO L226 Difference]: Without dead ends: 160 [2022-04-15 06:43:49,612 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=520, Invalid=2450, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 06:43:49,612 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 57 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:43:49,612 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 58 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 06:43:49,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-15 06:43:50,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 119. [2022-04-15 06:43:50,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:43:50,494 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 119 states, 114 states have (on average 1.4210526315789473) internal successors, (162), 114 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:50,495 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 119 states, 114 states have (on average 1.4210526315789473) internal successors, (162), 114 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:50,495 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 119 states, 114 states have (on average 1.4210526315789473) internal successors, (162), 114 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:50,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:50,497 INFO L93 Difference]: Finished difference Result 160 states and 218 transitions. [2022-04-15 06:43:50,497 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 218 transitions. [2022-04-15 06:43:50,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:50,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:50,497 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 114 states have (on average 1.4210526315789473) internal successors, (162), 114 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 160 states. [2022-04-15 06:43:50,497 INFO L87 Difference]: Start difference. First operand has 119 states, 114 states have (on average 1.4210526315789473) internal successors, (162), 114 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 160 states. [2022-04-15 06:43:50,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:50,499 INFO L93 Difference]: Finished difference Result 160 states and 218 transitions. [2022-04-15 06:43:50,499 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 218 transitions. [2022-04-15 06:43:50,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:50,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:50,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:43:50,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:43:50,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.4210526315789473) internal successors, (162), 114 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:50,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 166 transitions. [2022-04-15 06:43:50,501 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 166 transitions. Word has length 33 [2022-04-15 06:43:50,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:43:50,501 INFO L478 AbstractCegarLoop]: Abstraction has 119 states and 166 transitions. [2022-04-15 06:43:50,501 INFO L479 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-15 06:43:50,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 166 transitions. [2022-04-15 06:43:56,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 165 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:43:56,147 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 166 transitions. [2022-04-15 06:43:56,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 06:43:56,148 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:43:56,148 INFO L499 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:43:56,164 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-15 06:43:56,351 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-15 06:43:56,352 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:43:56,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:43:56,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1926224206, now seen corresponding path program 12 times [2022-04-15 06:43:56,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:56,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1462917532] [2022-04-15 06:43:58,572 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-15 06:43:58,574 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:43:58,576 INFO L85 PathProgramCache]: Analyzing trace with hash -2116035962, now seen corresponding path program 1 times [2022-04-15 06:43:58,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:43:58,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102721168] [2022-04-15 06:43:58,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:58,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:43:58,585 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-15 06:43:58,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:58,601 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-15 06:43:58,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:43:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:58,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {15376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15363#true} is VALID [2022-04-15 06:43:58,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {15363#true} assume true; {15363#true} is VALID [2022-04-15 06:43:58,765 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15363#true} {15363#true} #83#return; {15363#true} is VALID [2022-04-15 06:43:58,765 INFO L272 TraceCheckUtils]: 0: Hoare triple {15363#true} call ULTIMATE.init(); {15376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:43:58,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {15376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15363#true} is VALID [2022-04-15 06:43:58,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {15363#true} assume true; {15363#true} is VALID [2022-04-15 06:43:58,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15363#true} {15363#true} #83#return; {15363#true} is VALID [2022-04-15 06:43:58,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {15363#true} call #t~ret15 := main(); {15363#true} is VALID [2022-04-15 06:43:58,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {15363#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15363#true} is VALID [2022-04-15 06:43:58,766 INFO L290 TraceCheckUtils]: 6: Hoare triple {15363#true} [133] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_114| |v_main_#t~post5_113|)) (.cse1 (= |v_main_#t~post6_114| |v_main_#t~post6_113|)) (.cse2 (= v_main_~y~0_354 v_main_~y~0_353)) (.cse3 (= v_main_~x~0_285 v_main_~x~0_284)) (.cse4 (mod v_main_~x~0_285 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (< v_main_~y~0_354 v_main_~y~0_353) (forall ((v_it_24 Int)) (or (< 0 (mod (+ v_main_~x~0_285 (* 4294967295 v_it_24)) 4294967296)) (not (<= (+ v_main_~y~0_354 v_it_24 1) v_main_~y~0_353)) (not (<= 1 v_it_24)))) (= v_main_~x~0_284 (+ v_main_~x~0_285 v_main_~y~0_354 (* (- 1) v_main_~y~0_353))) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_354, main_#t~post5=|v_main_#t~post5_114|, main_~x~0=v_main_~x~0_285, main_#t~post6=|v_main_#t~post6_114|} OutVars{main_~y~0=v_main_~y~0_353, main_#t~post5=|v_main_#t~post5_113|, main_~x~0=v_main_~x~0_284, main_#t~post6=|v_main_#t~post6_113|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15363#true} is VALID [2022-04-15 06:43:58,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {15363#true} [132] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {15368#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:43:58,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {15368#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {15368#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:43:58,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {15368#(<= 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; {15369#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:43:58,769 INFO L290 TraceCheckUtils]: 10: Hoare triple {15369#(<= 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; {15370#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:58,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {15370#(<= 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; {15371#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:58,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {15371#(<= 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; {15372#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:58,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {15372#(<= 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; {15373#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:43:58,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {15373#(<= 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; {15374#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:58,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {15374#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {15374#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:58,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {15374#(<= 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; {15374#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:58,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {15374#(<= 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; {15374#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:58,773 INFO L290 TraceCheckUtils]: 18: Hoare triple {15374#(<= 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; {15374#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:58,774 INFO L290 TraceCheckUtils]: 19: Hoare triple {15374#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {15374#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:58,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {15374#(<= 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; {15375#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 06:43:58,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {15375#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {15364#false} is VALID [2022-04-15 06:43:58,775 INFO L290 TraceCheckUtils]: 22: Hoare triple {15364#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15364#false} is VALID [2022-04-15 06:43:58,775 INFO L290 TraceCheckUtils]: 23: Hoare triple {15364#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15364#false} is VALID [2022-04-15 06:43:58,775 INFO L290 TraceCheckUtils]: 24: Hoare triple {15364#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15364#false} is VALID [2022-04-15 06:43:58,775 INFO L290 TraceCheckUtils]: 25: Hoare triple {15364#false} assume !(~z~0 % 4294967296 > 0); {15364#false} is VALID [2022-04-15 06:43:58,775 INFO L272 TraceCheckUtils]: 26: Hoare triple {15364#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {15364#false} is VALID [2022-04-15 06:43:58,776 INFO L290 TraceCheckUtils]: 27: Hoare triple {15364#false} ~cond := #in~cond; {15364#false} is VALID [2022-04-15 06:43:58,776 INFO L290 TraceCheckUtils]: 28: Hoare triple {15364#false} assume 0 == ~cond; {15364#false} is VALID [2022-04-15 06:43:58,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {15364#false} assume !false; {15364#false} is VALID [2022-04-15 06:43:58,776 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 06:43:58,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:43:58,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102721168] [2022-04-15 06:43:58,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102721168] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:43:58,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375976656] [2022-04-15 06:43:58,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:58,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:43:58,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:43:58,779 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-15 06:43:58,780 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-15 06:43:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:58,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 06:43:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:58,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:43:59,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {15363#true} call ULTIMATE.init(); {15363#true} is VALID [2022-04-15 06:43:59,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {15363#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15363#true} is VALID [2022-04-15 06:43:59,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {15363#true} assume true; {15363#true} is VALID [2022-04-15 06:43:59,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15363#true} {15363#true} #83#return; {15363#true} is VALID [2022-04-15 06:43:59,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {15363#true} call #t~ret15 := main(); {15363#true} is VALID [2022-04-15 06:43:59,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {15363#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15363#true} is VALID [2022-04-15 06:43:59,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {15363#true} [133] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_114| |v_main_#t~post5_113|)) (.cse1 (= |v_main_#t~post6_114| |v_main_#t~post6_113|)) (.cse2 (= v_main_~y~0_354 v_main_~y~0_353)) (.cse3 (= v_main_~x~0_285 v_main_~x~0_284)) (.cse4 (mod v_main_~x~0_285 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (< v_main_~y~0_354 v_main_~y~0_353) (forall ((v_it_24 Int)) (or (< 0 (mod (+ v_main_~x~0_285 (* 4294967295 v_it_24)) 4294967296)) (not (<= (+ v_main_~y~0_354 v_it_24 1) v_main_~y~0_353)) (not (<= 1 v_it_24)))) (= v_main_~x~0_284 (+ v_main_~x~0_285 v_main_~y~0_354 (* (- 1) v_main_~y~0_353))) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_354, main_#t~post5=|v_main_#t~post5_114|, main_~x~0=v_main_~x~0_285, main_#t~post6=|v_main_#t~post6_114|} OutVars{main_~y~0=v_main_~y~0_353, main_#t~post5=|v_main_#t~post5_113|, main_~x~0=v_main_~x~0_284, main_#t~post6=|v_main_#t~post6_113|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15363#true} is VALID [2022-04-15 06:43:59,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {15363#true} [132] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {15363#true} is VALID [2022-04-15 06:43:59,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {15363#true} ~z~0 := ~y~0; {15404#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:43:59,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {15404#(= 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; {15408#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:43:59,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {15408#(= 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; {15412#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:43:59,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {15412#(= (+ 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; {15416#(= (+ main_~z~0 2) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:43:59,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {15416#(= (+ 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; {15420#(= (+ main_~z~0 3) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:43:59,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {15420#(= (+ 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; {15424#(= (+ main_~y~0 (- 4)) (+ main_~z~0 1))} is VALID [2022-04-15 06:43:59,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {15424#(= (+ 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; {15428#(= (+ main_~y~0 (- 5)) (+ main_~z~0 1))} is VALID [2022-04-15 06:43:59,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {15428#(= (+ main_~y~0 (- 5)) (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {15428#(= (+ main_~y~0 (- 5)) (+ main_~z~0 1))} is VALID [2022-04-15 06:43:59,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {15428#(= (+ main_~y~0 (- 5)) (+ 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; {15420#(= (+ main_~z~0 3) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:43:59,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {15420#(= (+ main_~z~0 3) (+ (- 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; {15412#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:43:59,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {15412#(= (+ 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; {15404#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:43:59,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {15404#(= main_~z~0 main_~y~0)} assume !(~y~0 % 4294967296 > 0); {15444#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 06:43:59,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {15444#(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; {15444#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 06:43:59,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {15444#(not (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {15444#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 06:43:59,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {15444#(not (< 0 (mod main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15364#false} is VALID [2022-04-15 06:43:59,097 INFO L290 TraceCheckUtils]: 23: Hoare triple {15364#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15364#false} is VALID [2022-04-15 06:43:59,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {15364#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15364#false} is VALID [2022-04-15 06:43:59,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {15364#false} assume !(~z~0 % 4294967296 > 0); {15364#false} is VALID [2022-04-15 06:43:59,097 INFO L272 TraceCheckUtils]: 26: Hoare triple {15364#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {15364#false} is VALID [2022-04-15 06:43:59,097 INFO L290 TraceCheckUtils]: 27: Hoare triple {15364#false} ~cond := #in~cond; {15364#false} is VALID [2022-04-15 06:43:59,097 INFO L290 TraceCheckUtils]: 28: Hoare triple {15364#false} assume 0 == ~cond; {15364#false} is VALID [2022-04-15 06:43:59,097 INFO L290 TraceCheckUtils]: 29: Hoare triple {15364#false} assume !false; {15364#false} is VALID [2022-04-15 06:43:59,097 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 06:43:59,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:43:59,625 INFO L290 TraceCheckUtils]: 29: Hoare triple {15364#false} assume !false; {15364#false} is VALID [2022-04-15 06:43:59,625 INFO L290 TraceCheckUtils]: 28: Hoare triple {15364#false} assume 0 == ~cond; {15364#false} is VALID [2022-04-15 06:43:59,626 INFO L290 TraceCheckUtils]: 27: Hoare triple {15364#false} ~cond := #in~cond; {15364#false} is VALID [2022-04-15 06:43:59,626 INFO L272 TraceCheckUtils]: 26: Hoare triple {15364#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {15364#false} is VALID [2022-04-15 06:43:59,626 INFO L290 TraceCheckUtils]: 25: Hoare triple {15364#false} assume !(~z~0 % 4294967296 > 0); {15364#false} is VALID [2022-04-15 06:43:59,626 INFO L290 TraceCheckUtils]: 24: Hoare triple {15364#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15364#false} is VALID [2022-04-15 06:43:59,626 INFO L290 TraceCheckUtils]: 23: Hoare triple {15364#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15364#false} is VALID [2022-04-15 06:43:59,626 INFO L290 TraceCheckUtils]: 22: Hoare triple {15444#(not (< 0 (mod main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15364#false} is VALID [2022-04-15 06:43:59,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {15444#(not (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {15444#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 06:43:59,627 INFO L290 TraceCheckUtils]: 20: Hoare triple {15444#(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; {15444#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 06:43:59,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {15505#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {15444#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 06:43:59,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {15509#(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; {15505#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:43:59,631 INFO L290 TraceCheckUtils]: 17: Hoare triple {15513#(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; {15509#(or (not (< 0 (mod (+ main_~z~0 1) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:43:59,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {15517#(or (not (< 0 (mod (+ 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; {15513#(or (not (< 0 (mod (+ main_~z~0 2) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-15 06:43:59,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {15517#(or (not (< 0 (mod (+ main_~z~0 3) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {15517#(or (not (< 0 (mod (+ main_~z~0 3) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:43:59,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {15524#(or (not (< 0 (mod (+ main_~z~0 2) 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; {15517#(or (not (< 0 (mod (+ main_~z~0 3) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:43:59,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {15528#(or (not (< 0 (mod (+ main_~z~0 1) 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; {15524#(or (not (< 0 (mod (+ main_~z~0 2) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:43:59,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {15532#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15528#(or (not (< 0 (mod (+ main_~z~0 1) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:43:59,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {15536#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15532#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:43:59,640 INFO L290 TraceCheckUtils]: 10: Hoare triple {15540#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15536#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:43:59,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {15544#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15540#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:43:59,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {15363#true} ~z~0 := ~y~0; {15544#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:43:59,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {15363#true} [132] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {15363#true} is VALID [2022-04-15 06:43:59,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {15363#true} [133] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_114| |v_main_#t~post5_113|)) (.cse1 (= |v_main_#t~post6_114| |v_main_#t~post6_113|)) (.cse2 (= v_main_~y~0_354 v_main_~y~0_353)) (.cse3 (= v_main_~x~0_285 v_main_~x~0_284)) (.cse4 (mod v_main_~x~0_285 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (< v_main_~y~0_354 v_main_~y~0_353) (forall ((v_it_24 Int)) (or (< 0 (mod (+ v_main_~x~0_285 (* 4294967295 v_it_24)) 4294967296)) (not (<= (+ v_main_~y~0_354 v_it_24 1) v_main_~y~0_353)) (not (<= 1 v_it_24)))) (= v_main_~x~0_284 (+ v_main_~x~0_285 v_main_~y~0_354 (* (- 1) v_main_~y~0_353))) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_354, main_#t~post5=|v_main_#t~post5_114|, main_~x~0=v_main_~x~0_285, main_#t~post6=|v_main_#t~post6_114|} OutVars{main_~y~0=v_main_~y~0_353, main_#t~post5=|v_main_#t~post5_113|, main_~x~0=v_main_~x~0_284, main_#t~post6=|v_main_#t~post6_113|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15363#true} is VALID [2022-04-15 06:43:59,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {15363#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15363#true} is VALID [2022-04-15 06:43:59,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {15363#true} call #t~ret15 := main(); {15363#true} is VALID [2022-04-15 06:43:59,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15363#true} {15363#true} #83#return; {15363#true} is VALID [2022-04-15 06:43:59,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {15363#true} assume true; {15363#true} is VALID [2022-04-15 06:43:59,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {15363#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15363#true} is VALID [2022-04-15 06:43:59,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {15363#true} call ULTIMATE.init(); {15363#true} is VALID [2022-04-15 06:43:59,643 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 06:43:59,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375976656] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:43:59,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:43:59,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 29 [2022-04-15 06:43:59,977 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:43:59,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1462917532] [2022-04-15 06:43:59,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1462917532] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:43:59,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:43:59,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 06:43:59,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591175033] [2022-04-15 06:43:59,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:43:59,978 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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 33 [2022-04-15 06:43:59,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:43:59,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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-15 06:44:00,012 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-15 06:44:00,012 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 06:44:00,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:44:00,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 06:44:00,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=945, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 06:44:00,013 INFO L87 Difference]: Start difference. First operand 119 states and 166 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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-15 06:44:03,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:03,930 INFO L93 Difference]: Finished difference Result 249 states and 377 transitions. [2022-04-15 06:44:03,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 06:44:03,930 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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 33 [2022-04-15 06:44:03,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:44:03,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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-15 06:44:03,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 96 transitions. [2022-04-15 06:44:03,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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-15 06:44:03,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 96 transitions. [2022-04-15 06:44:03,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 96 transitions. [2022-04-15 06:44:04,143 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-15 06:44:04,145 INFO L225 Difference]: With dead ends: 249 [2022-04-15 06:44:04,145 INFO L226 Difference]: Without dead ends: 226 [2022-04-15 06:44:04,146 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=285, Invalid=2067, Unknown=0, NotChecked=0, Total=2352 [2022-04-15 06:44:04,146 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 119 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:44:04,147 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 40 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 06:44:04,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-04-15 06:44:05,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 132. [2022-04-15 06:44:05,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:44:05,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand has 132 states, 127 states have (on average 1.4251968503937007) internal successors, (181), 127 states have internal predecessors, (181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:44:05,179 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand has 132 states, 127 states have (on average 1.4251968503937007) internal successors, (181), 127 states have internal predecessors, (181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:44:05,179 INFO L87 Difference]: Start difference. First operand 226 states. Second operand has 132 states, 127 states have (on average 1.4251968503937007) internal successors, (181), 127 states have internal predecessors, (181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:44:05,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:05,183 INFO L93 Difference]: Finished difference Result 226 states and 320 transitions. [2022-04-15 06:44:05,183 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 320 transitions. [2022-04-15 06:44:05,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:44:05,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:44:05,184 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 127 states have (on average 1.4251968503937007) internal successors, (181), 127 states have internal predecessors, (181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 226 states. [2022-04-15 06:44:05,184 INFO L87 Difference]: Start difference. First operand has 132 states, 127 states have (on average 1.4251968503937007) internal successors, (181), 127 states have internal predecessors, (181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 226 states. [2022-04-15 06:44:05,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:05,187 INFO L93 Difference]: Finished difference Result 226 states and 320 transitions. [2022-04-15 06:44:05,187 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 320 transitions. [2022-04-15 06:44:05,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:44:05,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:44:05,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:44:05,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:44:05,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 127 states have (on average 1.4251968503937007) internal successors, (181), 127 states have internal predecessors, (181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:44:05,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 185 transitions. [2022-04-15 06:44:05,190 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 185 transitions. Word has length 33 [2022-04-15 06:44:05,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:44:05,190 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 185 transitions. [2022-04-15 06:44:05,191 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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-15 06:44:05,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 185 transitions. [2022-04-15 06:44:12,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 183 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 06:44:12,339 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 185 transitions. [2022-04-15 06:44:12,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 06:44:12,339 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:44:12,339 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:44:12,363 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-15 06:44:12,563 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-15 06:44:12,563 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:44:12,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:44:12,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1099403902, now seen corresponding path program 13 times [2022-04-15 06:44:12,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:44:12,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1729807336] [2022-04-15 06:44:12,769 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-15 06:44:12,770 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:44:12,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1612901358, now seen corresponding path program 1 times [2022-04-15 06:44:12,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:44:12,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979942547] [2022-04-15 06:44:12,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:44:12,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:44:12,783 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-15 06:44:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:12,803 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-15 06:44:12,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:44:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:12,975 INFO L290 TraceCheckUtils]: 0: Hoare triple {16837#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16824#true} is VALID [2022-04-15 06:44:12,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {16824#true} assume true; {16824#true} is VALID [2022-04-15 06:44:12,975 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16824#true} {16824#true} #83#return; {16824#true} is VALID [2022-04-15 06:44:12,976 INFO L272 TraceCheckUtils]: 0: Hoare triple {16824#true} call ULTIMATE.init(); {16837#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:44:12,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {16837#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16824#true} is VALID [2022-04-15 06:44:12,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {16824#true} assume true; {16824#true} is VALID [2022-04-15 06:44:12,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16824#true} {16824#true} #83#return; {16824#true} is VALID [2022-04-15 06:44:12,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {16824#true} call #t~ret15 := main(); {16824#true} is VALID [2022-04-15 06:44:12,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {16824#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16824#true} is VALID [2022-04-15 06:44:12,976 INFO L290 TraceCheckUtils]: 6: Hoare triple {16824#true} [135] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_302 4294967296)) (.cse1 (= v_main_~y~0_374 v_main_~y~0_373)) (.cse2 (= v_main_~x~0_302 v_main_~x~0_301)) (.cse3 (= |v_main_#t~post5_119| |v_main_#t~post5_118|))) (or (and (< v_main_~x~0_301 v_main_~x~0_302) (< 0 .cse0) (forall ((v_it_25 Int)) (or (< 0 (mod (+ v_main_~x~0_302 (* 4294967295 v_it_25)) 4294967296)) (not (<= 1 v_it_25)) (not (<= (+ v_main_~x~0_301 v_it_25 1) v_main_~x~0_302)))) (= v_main_~y~0_373 (+ v_main_~x~0_302 v_main_~y~0_374 (* v_main_~x~0_301 (- 1))))) (and .cse1 .cse2 .cse3 (= |v_main_#t~post6_119| |v_main_#t~post6_118|)) (and (= |v_main_#t~post6_118| |v_main_#t~post6_119|) (<= .cse0 0) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_374, main_#t~post5=|v_main_#t~post5_119|, main_~x~0=v_main_~x~0_302, main_#t~post6=|v_main_#t~post6_119|} OutVars{main_~y~0=v_main_~y~0_373, main_#t~post5=|v_main_#t~post5_118|, main_~x~0=v_main_~x~0_301, main_#t~post6=|v_main_#t~post6_118|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16824#true} is VALID [2022-04-15 06:44:12,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {16824#true} [134] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {16824#true} is VALID [2022-04-15 06:44:12,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {16824#true} ~z~0 := ~y~0; {16829#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:44:12,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {16829#(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; {16830#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:44:12,978 INFO L290 TraceCheckUtils]: 10: Hoare triple {16830#(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; {16831#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:44:12,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {16831#(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; {16832#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:44:12,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {16832#(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; {16833#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:44:12,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {16833#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {16833#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:44:12,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {16833#(<= 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; {16834#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:44:12,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {16834#(<= 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; {16835#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:44:12,984 INFO L290 TraceCheckUtils]: 16: Hoare triple {16835#(<= 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; {16836#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:44:12,985 INFO L290 TraceCheckUtils]: 17: Hoare triple {16836#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {16825#false} is VALID [2022-04-15 06:44:12,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {16825#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; {16825#false} is VALID [2022-04-15 06:44:12,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {16825#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; {16825#false} is VALID [2022-04-15 06:44:12,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {16825#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; {16825#false} is VALID [2022-04-15 06:44:12,985 INFO L290 TraceCheckUtils]: 21: Hoare triple {16825#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; {16825#false} is VALID [2022-04-15 06:44:12,985 INFO L290 TraceCheckUtils]: 22: Hoare triple {16825#false} assume !(~x~0 % 4294967296 > 0); {16825#false} is VALID [2022-04-15 06:44:12,986 INFO L290 TraceCheckUtils]: 23: Hoare triple {16825#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {16825#false} is VALID [2022-04-15 06:44:12,986 INFO L290 TraceCheckUtils]: 24: Hoare triple {16825#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {16825#false} is VALID [2022-04-15 06:44:12,986 INFO L290 TraceCheckUtils]: 25: Hoare triple {16825#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {16825#false} is VALID [2022-04-15 06:44:12,986 INFO L290 TraceCheckUtils]: 26: Hoare triple {16825#false} assume !(~z~0 % 4294967296 > 0); {16825#false} is VALID [2022-04-15 06:44:12,986 INFO L272 TraceCheckUtils]: 27: Hoare triple {16825#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {16825#false} is VALID [2022-04-15 06:44:12,986 INFO L290 TraceCheckUtils]: 28: Hoare triple {16825#false} ~cond := #in~cond; {16825#false} is VALID [2022-04-15 06:44:12,986 INFO L290 TraceCheckUtils]: 29: Hoare triple {16825#false} assume 0 == ~cond; {16825#false} is VALID [2022-04-15 06:44:12,986 INFO L290 TraceCheckUtils]: 30: Hoare triple {16825#false} assume !false; {16825#false} is VALID [2022-04-15 06:44:12,986 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-15 06:44:12,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:44:12,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979942547] [2022-04-15 06:44:12,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979942547] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:44:12,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815991686] [2022-04-15 06:44:12,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:44:12,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:44:12,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:44:12,992 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-15 06:44:12,993 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-15 06:44:13,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:13,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 06:44:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:13,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:44:13,410 INFO L272 TraceCheckUtils]: 0: Hoare triple {16824#true} call ULTIMATE.init(); {16824#true} is VALID [2022-04-15 06:44:13,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {16824#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16824#true} is VALID [2022-04-15 06:44:13,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {16824#true} assume true; {16824#true} is VALID [2022-04-15 06:44:13,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16824#true} {16824#true} #83#return; {16824#true} is VALID [2022-04-15 06:44:13,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {16824#true} call #t~ret15 := main(); {16824#true} is VALID [2022-04-15 06:44:13,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {16824#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16824#true} is VALID [2022-04-15 06:44:13,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {16824#true} [135] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_302 4294967296)) (.cse1 (= v_main_~y~0_374 v_main_~y~0_373)) (.cse2 (= v_main_~x~0_302 v_main_~x~0_301)) (.cse3 (= |v_main_#t~post5_119| |v_main_#t~post5_118|))) (or (and (< v_main_~x~0_301 v_main_~x~0_302) (< 0 .cse0) (forall ((v_it_25 Int)) (or (< 0 (mod (+ v_main_~x~0_302 (* 4294967295 v_it_25)) 4294967296)) (not (<= 1 v_it_25)) (not (<= (+ v_main_~x~0_301 v_it_25 1) v_main_~x~0_302)))) (= v_main_~y~0_373 (+ v_main_~x~0_302 v_main_~y~0_374 (* v_main_~x~0_301 (- 1))))) (and .cse1 .cse2 .cse3 (= |v_main_#t~post6_119| |v_main_#t~post6_118|)) (and (= |v_main_#t~post6_118| |v_main_#t~post6_119|) (<= .cse0 0) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_374, main_#t~post5=|v_main_#t~post5_119|, main_~x~0=v_main_~x~0_302, main_#t~post6=|v_main_#t~post6_119|} OutVars{main_~y~0=v_main_~y~0_373, main_#t~post5=|v_main_#t~post5_118|, main_~x~0=v_main_~x~0_301, main_#t~post6=|v_main_#t~post6_118|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16824#true} is VALID [2022-04-15 06:44:13,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {16824#true} [134] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {16824#true} is VALID [2022-04-15 06:44:13,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {16824#true} ~z~0 := ~y~0; {16829#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:44:13,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {16829#(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; {16830#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:44:13,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {16830#(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; {16831#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:44:13,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {16831#(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; {16832#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:44:13,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {16832#(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; {16877#(and (<= main_~y~0 (+ main_~z~0 4)) (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:44:13,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {16877#(and (<= main_~y~0 (+ main_~z~0 4)) (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (+ main_~z~0 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {16877#(and (<= main_~y~0 (+ main_~z~0 4)) (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:44:13,420 INFO L290 TraceCheckUtils]: 14: Hoare triple {16877#(and (<= main_~y~0 (+ main_~z~0 4)) (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (+ 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; {16884#(and (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:44:13,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {16884#(and (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16888#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:44:13,422 INFO L290 TraceCheckUtils]: 16: Hoare triple {16888#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0) (< 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; {16892#(and (<= main_~z~0 (+ main_~y~0 2)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (+ main_~y~0 2) main_~z~0))} is VALID [2022-04-15 06:44:13,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {16892#(and (<= main_~z~0 (+ main_~y~0 2)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (+ main_~y~0 2) main_~z~0))} assume !(~y~0 % 4294967296 > 0); {16825#false} is VALID [2022-04-15 06:44:13,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {16825#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; {16825#false} is VALID [2022-04-15 06:44:13,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {16825#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; {16825#false} is VALID [2022-04-15 06:44:13,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {16825#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; {16825#false} is VALID [2022-04-15 06:44:13,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {16825#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; {16825#false} is VALID [2022-04-15 06:44:13,423 INFO L290 TraceCheckUtils]: 22: Hoare triple {16825#false} assume !(~x~0 % 4294967296 > 0); {16825#false} is VALID [2022-04-15 06:44:13,423 INFO L290 TraceCheckUtils]: 23: Hoare triple {16825#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {16825#false} is VALID [2022-04-15 06:44:13,423 INFO L290 TraceCheckUtils]: 24: Hoare triple {16825#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {16825#false} is VALID [2022-04-15 06:44:13,423 INFO L290 TraceCheckUtils]: 25: Hoare triple {16825#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {16825#false} is VALID [2022-04-15 06:44:13,423 INFO L290 TraceCheckUtils]: 26: Hoare triple {16825#false} assume !(~z~0 % 4294967296 > 0); {16825#false} is VALID [2022-04-15 06:44:13,423 INFO L272 TraceCheckUtils]: 27: Hoare triple {16825#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {16825#false} is VALID [2022-04-15 06:44:13,423 INFO L290 TraceCheckUtils]: 28: Hoare triple {16825#false} ~cond := #in~cond; {16825#false} is VALID [2022-04-15 06:44:13,423 INFO L290 TraceCheckUtils]: 29: Hoare triple {16825#false} assume 0 == ~cond; {16825#false} is VALID [2022-04-15 06:44:13,423 INFO L290 TraceCheckUtils]: 30: Hoare triple {16825#false} assume !false; {16825#false} is VALID [2022-04-15 06:44:13,423 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-15 06:44:13,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:44:13,822 INFO L290 TraceCheckUtils]: 30: Hoare triple {16825#false} assume !false; {16825#false} is VALID [2022-04-15 06:44:13,822 INFO L290 TraceCheckUtils]: 29: Hoare triple {16825#false} assume 0 == ~cond; {16825#false} is VALID [2022-04-15 06:44:13,822 INFO L290 TraceCheckUtils]: 28: Hoare triple {16825#false} ~cond := #in~cond; {16825#false} is VALID [2022-04-15 06:44:13,822 INFO L272 TraceCheckUtils]: 27: Hoare triple {16825#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {16825#false} is VALID [2022-04-15 06:44:13,822 INFO L290 TraceCheckUtils]: 26: Hoare triple {16825#false} assume !(~z~0 % 4294967296 > 0); {16825#false} is VALID [2022-04-15 06:44:13,822 INFO L290 TraceCheckUtils]: 25: Hoare triple {16825#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {16825#false} is VALID [2022-04-15 06:44:13,822 INFO L290 TraceCheckUtils]: 24: Hoare triple {16825#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {16825#false} is VALID [2022-04-15 06:44:13,822 INFO L290 TraceCheckUtils]: 23: Hoare triple {16825#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {16825#false} is VALID [2022-04-15 06:44:13,822 INFO L290 TraceCheckUtils]: 22: Hoare triple {16825#false} assume !(~x~0 % 4294967296 > 0); {16825#false} is VALID [2022-04-15 06:44:13,822 INFO L290 TraceCheckUtils]: 21: Hoare triple {16825#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; {16825#false} is VALID [2022-04-15 06:44:13,822 INFO L290 TraceCheckUtils]: 20: Hoare triple {16825#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; {16825#false} is VALID [2022-04-15 06:44:13,822 INFO L290 TraceCheckUtils]: 19: Hoare triple {16825#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; {16825#false} is VALID [2022-04-15 06:44:13,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {16825#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; {16825#false} is VALID [2022-04-15 06:44:13,823 INFO L290 TraceCheckUtils]: 17: Hoare triple {16836#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {16825#false} is VALID [2022-04-15 06:44:13,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {16835#(<= 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; {16836#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:44:13,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {16834#(<= 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; {16835#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:44:13,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {16833#(<= 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; {16834#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:44:13,826 INFO L290 TraceCheckUtils]: 13: Hoare triple {16833#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {16833#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:44:13,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {16989#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)) (<= (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; {16833#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:44:13,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {16993#(or (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (<= 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; {16989#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-15 06:44:13,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {16997#(or (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= 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; {16993#(or (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-15 06:44:13,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {17001#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)) (<= (mod (+ main_~z~0 4294967293) 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; {16997#(or (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-15 06:44:13,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {16824#true} ~z~0 := ~y~0; {17001#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0))} is VALID [2022-04-15 06:44:13,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {16824#true} [134] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {16824#true} is VALID [2022-04-15 06:44:13,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {16824#true} [135] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_302 4294967296)) (.cse1 (= v_main_~y~0_374 v_main_~y~0_373)) (.cse2 (= v_main_~x~0_302 v_main_~x~0_301)) (.cse3 (= |v_main_#t~post5_119| |v_main_#t~post5_118|))) (or (and (< v_main_~x~0_301 v_main_~x~0_302) (< 0 .cse0) (forall ((v_it_25 Int)) (or (< 0 (mod (+ v_main_~x~0_302 (* 4294967295 v_it_25)) 4294967296)) (not (<= 1 v_it_25)) (not (<= (+ v_main_~x~0_301 v_it_25 1) v_main_~x~0_302)))) (= v_main_~y~0_373 (+ v_main_~x~0_302 v_main_~y~0_374 (* v_main_~x~0_301 (- 1))))) (and .cse1 .cse2 .cse3 (= |v_main_#t~post6_119| |v_main_#t~post6_118|)) (and (= |v_main_#t~post6_118| |v_main_#t~post6_119|) (<= .cse0 0) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_374, main_#t~post5=|v_main_#t~post5_119|, main_~x~0=v_main_~x~0_302, main_#t~post6=|v_main_#t~post6_119|} OutVars{main_~y~0=v_main_~y~0_373, main_#t~post5=|v_main_#t~post5_118|, main_~x~0=v_main_~x~0_301, main_#t~post6=|v_main_#t~post6_118|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16824#true} is VALID [2022-04-15 06:44:13,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {16824#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16824#true} is VALID [2022-04-15 06:44:13,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {16824#true} call #t~ret15 := main(); {16824#true} is VALID [2022-04-15 06:44:13,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16824#true} {16824#true} #83#return; {16824#true} is VALID [2022-04-15 06:44:13,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {16824#true} assume true; {16824#true} is VALID [2022-04-15 06:44:13,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {16824#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16824#true} is VALID [2022-04-15 06:44:13,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {16824#true} call ULTIMATE.init(); {16824#true} is VALID [2022-04-15 06:44:13,832 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-15 06:44:13,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815991686] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:44:13,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:44:13,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19 [2022-04-15 06:44:14,019 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:44:14,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1729807336] [2022-04-15 06:44:14,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1729807336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:44:14,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:44:14,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 06:44:14,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660885519] [2022-04-15 06:44:14,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:44:14,020 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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-15 06:44:14,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:44:14,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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-15 06:44:14,049 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-15 06:44:14,049 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 06:44:14,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:44:14,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 06:44:14,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2022-04-15 06:44:14,050 INFO L87 Difference]: Start difference. First operand 132 states and 185 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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-15 06:44:19,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:19,004 INFO L93 Difference]: Finished difference Result 190 states and 252 transitions. [2022-04-15 06:44:19,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 06:44:19,004 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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-15 06:44:19,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:44:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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-15 06:44:19,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 71 transitions. [2022-04-15 06:44:19,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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-15 06:44:19,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 71 transitions. [2022-04-15 06:44:19,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 71 transitions. [2022-04-15 06:44:19,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:44:19,220 INFO L225 Difference]: With dead ends: 190 [2022-04-15 06:44:19,220 INFO L226 Difference]: Without dead ends: 168 [2022-04-15 06:44:19,221 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=328, Invalid=1652, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 06:44:19,221 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 54 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:44:19,221 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 77 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 06:44:19,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-04-15 06:44:20,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 115. [2022-04-15 06:44:20,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:44:20,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand has 115 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 110 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:44:20,083 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand has 115 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 110 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:44:20,083 INFO L87 Difference]: Start difference. First operand 168 states. Second operand has 115 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 110 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:44:20,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:20,085 INFO L93 Difference]: Finished difference Result 168 states and 222 transitions. [2022-04-15 06:44:20,085 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 222 transitions. [2022-04-15 06:44:20,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:44:20,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:44:20,085 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 110 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 168 states. [2022-04-15 06:44:20,085 INFO L87 Difference]: Start difference. First operand has 115 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 110 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 168 states. [2022-04-15 06:44:20,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:20,087 INFO L93 Difference]: Finished difference Result 168 states and 222 transitions. [2022-04-15 06:44:20,087 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 222 transitions. [2022-04-15 06:44:20,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:44:20,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:44:20,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:44:20,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:44:20,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 110 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:44:20,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 159 transitions. [2022-04-15 06:44:20,090 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 159 transitions. Word has length 34 [2022-04-15 06:44:20,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:44:20,090 INFO L478 AbstractCegarLoop]: Abstraction has 115 states and 159 transitions. [2022-04-15 06:44:20,090 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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-15 06:44:20,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 115 states and 159 transitions. [2022-04-15 06:44:28,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 157 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 06:44:28,447 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 159 transitions. [2022-04-15 06:44:28,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 06:44:28,447 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:44:28,447 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:44:28,464 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-15 06:44:28,648 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:44:28,648 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:44:28,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:44:28,648 INFO L85 PathProgramCache]: Analyzing trace with hash -524795518, now seen corresponding path program 14 times [2022-04-15 06:44:28,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:44:28,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2126629438] [2022-04-15 06:44:28,900 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-15 06:44:28,902 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:44:28,904 INFO L85 PathProgramCache]: Analyzing trace with hash -2100922450, now seen corresponding path program 1 times [2022-04-15 06:44:28,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:44:28,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170220838] [2022-04-15 06:44:28,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:44:28,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:44:28,916 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-15 06:44:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:28,938 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-15 06:44:29,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:44:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:29,112 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18027#true} is VALID [2022-04-15 06:44:29,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {18027#true} assume true; {18027#true} is VALID [2022-04-15 06:44:29,112 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18027#true} {18027#true} #83#return; {18027#true} is VALID [2022-04-15 06:44:29,112 INFO L272 TraceCheckUtils]: 0: Hoare triple {18027#true} call ULTIMATE.init(); {18041#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:44:29,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18027#true} is VALID [2022-04-15 06:44:29,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {18027#true} assume true; {18027#true} is VALID [2022-04-15 06:44:29,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18027#true} {18027#true} #83#return; {18027#true} is VALID [2022-04-15 06:44:29,113 INFO L272 TraceCheckUtils]: 4: Hoare triple {18027#true} call #t~ret15 := main(); {18027#true} is VALID [2022-04-15 06:44:29,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {18027#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18027#true} is VALID [2022-04-15 06:44:29,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {18027#true} [137] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_124| |v_main_#t~post6_123|)) (.cse1 (= |v_main_#t~post5_124| |v_main_#t~post5_123|)) (.cse3 (= v_main_~y~0_397 v_main_~y~0_396)) (.cse2 (mod v_main_~x~0_320 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) (= v_main_~x~0_319 v_main_~x~0_320) .cse3) (and (= v_main_~x~0_320 v_main_~x~0_319) .cse0 .cse1 .cse3) (and (< v_main_~x~0_319 v_main_~x~0_320) (= v_main_~y~0_396 (+ v_main_~x~0_320 (* v_main_~x~0_319 (- 1)) v_main_~y~0_397)) (< 0 .cse2) (forall ((v_it_26 Int)) (or (not (<= 1 v_it_26)) (< 0 (mod (+ v_main_~x~0_320 (* 4294967295 v_it_26)) 4294967296)) (not (<= (+ v_main_~x~0_319 v_it_26 1) v_main_~x~0_320))))))) InVars {main_~y~0=v_main_~y~0_397, main_#t~post5=|v_main_#t~post5_124|, main_~x~0=v_main_~x~0_320, main_#t~post6=|v_main_#t~post6_124|} OutVars{main_~y~0=v_main_~y~0_396, main_#t~post5=|v_main_#t~post5_123|, main_~x~0=v_main_~x~0_319, main_#t~post6=|v_main_#t~post6_123|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {18027#true} is VALID [2022-04-15 06:44:29,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {18027#true} [136] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {18027#true} is VALID [2022-04-15 06:44:29,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {18027#true} ~z~0 := ~y~0; {18027#true} is VALID [2022-04-15 06:44:29,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {18027#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; {18032#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:29,115 INFO L290 TraceCheckUtils]: 10: Hoare triple {18032#(<= 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; {18033#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 06:44:29,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {18033#(<= 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; {18034#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:29,118 INFO L290 TraceCheckUtils]: 12: Hoare triple {18034#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18035#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:29,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {18035#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {18035#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:29,119 INFO L290 TraceCheckUtils]: 14: Hoare triple {18035#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18036#(<= main_~z~0 (+ 4294967292 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 06:44:29,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {18036#(<= main_~z~0 (+ 4294967292 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18037#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967293))} is VALID [2022-04-15 06:44:29,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {18037#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18038#(<= main_~z~0 (+ 4294967294 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:29,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {18038#(<= main_~z~0 (+ 4294967294 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18039#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-15 06:44:29,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {18039#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18040#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:44:29,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {18040#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {18040#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:44:29,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {18040#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {18040#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:44:29,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {18040#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {18040#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:44:29,127 INFO L290 TraceCheckUtils]: 22: Hoare triple {18040#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {18040#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:44:29,127 INFO L290 TraceCheckUtils]: 23: Hoare triple {18040#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {18040#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:44:29,128 INFO L290 TraceCheckUtils]: 24: Hoare triple {18040#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {18040#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:44:29,129 INFO L290 TraceCheckUtils]: 25: Hoare triple {18040#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {18039#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-15 06:44:29,130 INFO L290 TraceCheckUtils]: 26: Hoare triple {18039#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} assume !(~z~0 % 4294967296 > 0); {18028#false} is VALID [2022-04-15 06:44:29,130 INFO L272 TraceCheckUtils]: 27: Hoare triple {18028#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {18028#false} is VALID [2022-04-15 06:44:29,130 INFO L290 TraceCheckUtils]: 28: Hoare triple {18028#false} ~cond := #in~cond; {18028#false} is VALID [2022-04-15 06:44:29,130 INFO L290 TraceCheckUtils]: 29: Hoare triple {18028#false} assume 0 == ~cond; {18028#false} is VALID [2022-04-15 06:44:29,130 INFO L290 TraceCheckUtils]: 30: Hoare triple {18028#false} assume !false; {18028#false} is VALID [2022-04-15 06:44:29,131 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:44:29,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:44:29,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170220838] [2022-04-15 06:44:29,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170220838] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:44:29,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166711380] [2022-04-15 06:44:29,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:44:29,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:44:29,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:44:29,136 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-15 06:44:29,140 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-15 06:44:29,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:29,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 06:44:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:29,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:44:29,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {18027#true} call ULTIMATE.init(); {18027#true} is VALID [2022-04-15 06:44:29,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {18027#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18027#true} is VALID [2022-04-15 06:44:29,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {18027#true} assume true; {18027#true} is VALID [2022-04-15 06:44:29,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18027#true} {18027#true} #83#return; {18027#true} is VALID [2022-04-15 06:44:29,500 INFO L272 TraceCheckUtils]: 4: Hoare triple {18027#true} call #t~ret15 := main(); {18027#true} is VALID [2022-04-15 06:44:29,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {18027#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18027#true} is VALID [2022-04-15 06:44:29,500 INFO L290 TraceCheckUtils]: 6: Hoare triple {18027#true} [137] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_124| |v_main_#t~post6_123|)) (.cse1 (= |v_main_#t~post5_124| |v_main_#t~post5_123|)) (.cse3 (= v_main_~y~0_397 v_main_~y~0_396)) (.cse2 (mod v_main_~x~0_320 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) (= v_main_~x~0_319 v_main_~x~0_320) .cse3) (and (= v_main_~x~0_320 v_main_~x~0_319) .cse0 .cse1 .cse3) (and (< v_main_~x~0_319 v_main_~x~0_320) (= v_main_~y~0_396 (+ v_main_~x~0_320 (* v_main_~x~0_319 (- 1)) v_main_~y~0_397)) (< 0 .cse2) (forall ((v_it_26 Int)) (or (not (<= 1 v_it_26)) (< 0 (mod (+ v_main_~x~0_320 (* 4294967295 v_it_26)) 4294967296)) (not (<= (+ v_main_~x~0_319 v_it_26 1) v_main_~x~0_320))))))) InVars {main_~y~0=v_main_~y~0_397, main_#t~post5=|v_main_#t~post5_124|, main_~x~0=v_main_~x~0_320, main_#t~post6=|v_main_#t~post6_124|} OutVars{main_~y~0=v_main_~y~0_396, main_#t~post5=|v_main_#t~post5_123|, main_~x~0=v_main_~x~0_319, main_#t~post6=|v_main_#t~post6_123|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {18027#true} is VALID [2022-04-15 06:44:29,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {18027#true} [136] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {18027#true} is VALID [2022-04-15 06:44:29,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {18027#true} ~z~0 := ~y~0; {18069#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:44:29,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {18069#(= 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; {18073#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:44:29,502 INFO L290 TraceCheckUtils]: 10: Hoare triple {18073#(= 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; {18077#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-15 06:44:29,502 INFO L290 TraceCheckUtils]: 11: Hoare triple {18077#(= 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; {18081#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-15 06:44:29,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {18081#(= (+ (- 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; {18085#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} is VALID [2022-04-15 06:44:29,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {18085#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} assume !(~z~0 % 4294967296 > 0); {18089#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:44:29,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {18089#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18093#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:44:29,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {18093#(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; {18097#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-15 06:44:29,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {18097#(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; {18101#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:44:29,507 INFO L290 TraceCheckUtils]: 17: Hoare triple {18101#(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; {18105#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:44:29,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {18105#(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; {18028#false} is VALID [2022-04-15 06:44:29,507 INFO L290 TraceCheckUtils]: 19: Hoare triple {18028#false} assume !(~y~0 % 4294967296 > 0); {18028#false} is VALID [2022-04-15 06:44:29,507 INFO L290 TraceCheckUtils]: 20: Hoare triple {18028#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; {18028#false} is VALID [2022-04-15 06:44:29,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {18028#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; {18028#false} is VALID [2022-04-15 06:44:29,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {18028#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; {18028#false} is VALID [2022-04-15 06:44:29,507 INFO L290 TraceCheckUtils]: 23: Hoare triple {18028#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; {18028#false} is VALID [2022-04-15 06:44:29,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {18028#false} assume !(~x~0 % 4294967296 > 0); {18028#false} is VALID [2022-04-15 06:44:29,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {18028#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {18028#false} is VALID [2022-04-15 06:44:29,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {18028#false} assume !(~z~0 % 4294967296 > 0); {18028#false} is VALID [2022-04-15 06:44:29,508 INFO L272 TraceCheckUtils]: 27: Hoare triple {18028#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {18028#false} is VALID [2022-04-15 06:44:29,508 INFO L290 TraceCheckUtils]: 28: Hoare triple {18028#false} ~cond := #in~cond; {18028#false} is VALID [2022-04-15 06:44:29,508 INFO L290 TraceCheckUtils]: 29: Hoare triple {18028#false} assume 0 == ~cond; {18028#false} is VALID [2022-04-15 06:44:29,508 INFO L290 TraceCheckUtils]: 30: Hoare triple {18028#false} assume !false; {18028#false} is VALID [2022-04-15 06:44:29,508 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-15 06:44:29,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:44:29,839 INFO L290 TraceCheckUtils]: 30: Hoare triple {18028#false} assume !false; {18028#false} is VALID [2022-04-15 06:44:29,839 INFO L290 TraceCheckUtils]: 29: Hoare triple {18028#false} assume 0 == ~cond; {18028#false} is VALID [2022-04-15 06:44:29,839 INFO L290 TraceCheckUtils]: 28: Hoare triple {18028#false} ~cond := #in~cond; {18028#false} is VALID [2022-04-15 06:44:29,839 INFO L272 TraceCheckUtils]: 27: Hoare triple {18028#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {18028#false} is VALID [2022-04-15 06:44:29,839 INFO L290 TraceCheckUtils]: 26: Hoare triple {18028#false} assume !(~z~0 % 4294967296 > 0); {18028#false} is VALID [2022-04-15 06:44:29,839 INFO L290 TraceCheckUtils]: 25: Hoare triple {18028#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {18028#false} is VALID [2022-04-15 06:44:29,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {18028#false} assume !(~x~0 % 4294967296 > 0); {18028#false} is VALID [2022-04-15 06:44:29,839 INFO L290 TraceCheckUtils]: 23: Hoare triple {18028#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; {18028#false} is VALID [2022-04-15 06:44:29,840 INFO L290 TraceCheckUtils]: 22: Hoare triple {18028#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; {18028#false} is VALID [2022-04-15 06:44:29,840 INFO L290 TraceCheckUtils]: 21: Hoare triple {18028#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; {18028#false} is VALID [2022-04-15 06:44:29,840 INFO L290 TraceCheckUtils]: 20: Hoare triple {18028#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; {18028#false} is VALID [2022-04-15 06:44:29,840 INFO L290 TraceCheckUtils]: 19: Hoare triple {18028#false} assume !(~y~0 % 4294967296 > 0); {18028#false} is VALID [2022-04-15 06:44:29,840 INFO L290 TraceCheckUtils]: 18: Hoare triple {18105#(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; {18028#false} is VALID [2022-04-15 06:44:29,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {18101#(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; {18105#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:44:29,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {18097#(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; {18101#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:44:29,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {18093#(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; {18097#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-15 06:44:29,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {18089#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18093#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:44:29,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {18196#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {18089#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:44:29,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {18200#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18196#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-15 06:44:29,847 INFO L290 TraceCheckUtils]: 11: Hoare triple {18204#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18200#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-15 06:44:29,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {18208#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18204#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-15 06:44:29,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {18212#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18208#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-15 06:44:29,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {18027#true} ~z~0 := ~y~0; {18212#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-15 06:44:29,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {18027#true} [136] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {18027#true} is VALID [2022-04-15 06:44:29,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {18027#true} [137] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_124| |v_main_#t~post6_123|)) (.cse1 (= |v_main_#t~post5_124| |v_main_#t~post5_123|)) (.cse3 (= v_main_~y~0_397 v_main_~y~0_396)) (.cse2 (mod v_main_~x~0_320 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) (= v_main_~x~0_319 v_main_~x~0_320) .cse3) (and (= v_main_~x~0_320 v_main_~x~0_319) .cse0 .cse1 .cse3) (and (< v_main_~x~0_319 v_main_~x~0_320) (= v_main_~y~0_396 (+ v_main_~x~0_320 (* v_main_~x~0_319 (- 1)) v_main_~y~0_397)) (< 0 .cse2) (forall ((v_it_26 Int)) (or (not (<= 1 v_it_26)) (< 0 (mod (+ v_main_~x~0_320 (* 4294967295 v_it_26)) 4294967296)) (not (<= (+ v_main_~x~0_319 v_it_26 1) v_main_~x~0_320))))))) InVars {main_~y~0=v_main_~y~0_397, main_#t~post5=|v_main_#t~post5_124|, main_~x~0=v_main_~x~0_320, main_#t~post6=|v_main_#t~post6_124|} OutVars{main_~y~0=v_main_~y~0_396, main_#t~post5=|v_main_#t~post5_123|, main_~x~0=v_main_~x~0_319, main_#t~post6=|v_main_#t~post6_123|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {18027#true} is VALID [2022-04-15 06:44:29,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {18027#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18027#true} is VALID [2022-04-15 06:44:29,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {18027#true} call #t~ret15 := main(); {18027#true} is VALID [2022-04-15 06:44:29,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18027#true} {18027#true} #83#return; {18027#true} is VALID [2022-04-15 06:44:29,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {18027#true} assume true; {18027#true} is VALID [2022-04-15 06:44:29,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {18027#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18027#true} is VALID [2022-04-15 06:44:29,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {18027#true} call ULTIMATE.init(); {18027#true} is VALID [2022-04-15 06:44:29,852 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-15 06:44:29,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166711380] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:44:29,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:44:29,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2022-04-15 06:44:30,111 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:44:30,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2126629438] [2022-04-15 06:44:30,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2126629438] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:44:30,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:44:30,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 06:44:30,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338408098] [2022-04-15 06:44:30,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:44:30,114 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-15 06:44:30,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:44:30,115 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-15 06:44:30,173 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-15 06:44:30,173 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 06:44:30,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:44:30,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 06:44:30,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2022-04-15 06:44:30,174 INFO L87 Difference]: Start difference. First operand 115 states and 159 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-15 06:44:35,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:35,732 INFO L93 Difference]: Finished difference Result 195 states and 261 transitions. [2022-04-15 06:44:35,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 06:44:35,733 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-15 06:44:35,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:44:35,733 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-15 06:44:35,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 90 transitions. [2022-04-15 06:44:35,734 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-15 06:44:35,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 90 transitions. [2022-04-15 06:44:35,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 90 transitions. [2022-04-15 06:44:35,935 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-15 06:44:35,937 INFO L225 Difference]: With dead ends: 195 [2022-04-15 06:44:35,937 INFO L226 Difference]: Without dead ends: 190 [2022-04-15 06:44:35,938 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=616, Invalid=3544, Unknown=0, NotChecked=0, Total=4160 [2022-04-15 06:44:35,939 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 50 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:44:35,939 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 68 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 06:44:35,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-04-15 06:44:36,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 125. [2022-04-15 06:44:36,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:44:36,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 190 states. Second operand has 125 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 120 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:44:36,952 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand has 125 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 120 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:44:36,952 INFO L87 Difference]: Start difference. First operand 190 states. Second operand has 125 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 120 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:44:36,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:36,955 INFO L93 Difference]: Finished difference Result 190 states and 250 transitions. [2022-04-15 06:44:36,955 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 250 transitions. [2022-04-15 06:44:36,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:44:36,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:44:36,955 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 120 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 190 states. [2022-04-15 06:44:36,955 INFO L87 Difference]: Start difference. First operand has 125 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 120 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 190 states. [2022-04-15 06:44:36,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:36,958 INFO L93 Difference]: Finished difference Result 190 states and 250 transitions. [2022-04-15 06:44:36,958 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 250 transitions. [2022-04-15 06:44:36,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:44:36,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:44:36,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:44:36,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:44:36,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 120 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:44:36,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 170 transitions. [2022-04-15 06:44:36,960 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 170 transitions. Word has length 34 [2022-04-15 06:44:36,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:44:36,961 INFO L478 AbstractCegarLoop]: Abstraction has 125 states and 170 transitions. [2022-04-15 06:44:36,961 INFO L479 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-15 06:44:36,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 125 states and 170 transitions. [2022-04-15 06:44:43,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 169 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:44:43,880 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 170 transitions. [2022-04-15 06:44:43,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 06:44:43,880 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:44:43,880 INFO L499 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:44:43,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-04-15 06:44:44,081 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:44:44,081 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:44:44,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:44:44,081 INFO L85 PathProgramCache]: Analyzing trace with hash -781170719, now seen corresponding path program 15 times [2022-04-15 06:44:44,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:44:44,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2118161270] [2022-04-15 06:44:44,307 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-15 06:44:44,309 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:44:44,311 INFO L85 PathProgramCache]: Analyzing trace with hash 2101090165, now seen corresponding path program 1 times [2022-04-15 06:44:44,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:44:44,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9576199] [2022-04-15 06:44:44,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:44:44,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:44:44,321 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-15 06:44:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:44,342 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_27.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:44:44,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:44:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:44,504 INFO L290 TraceCheckUtils]: 0: Hoare triple {19348#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19335#true} is VALID [2022-04-15 06:44:44,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {19335#true} assume true; {19335#true} is VALID [2022-04-15 06:44:44,504 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19335#true} {19335#true} #83#return; {19335#true} is VALID [2022-04-15 06:44:44,505 INFO L272 TraceCheckUtils]: 0: Hoare triple {19335#true} call ULTIMATE.init(); {19348#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:44:44,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {19348#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19335#true} is VALID [2022-04-15 06:44:44,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {19335#true} assume true; {19335#true} is VALID [2022-04-15 06:44:44,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19335#true} {19335#true} #83#return; {19335#true} is VALID [2022-04-15 06:44:44,505 INFO L272 TraceCheckUtils]: 4: Hoare triple {19335#true} call #t~ret15 := main(); {19335#true} is VALID [2022-04-15 06:44:44,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {19335#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19335#true} is VALID [2022-04-15 06:44:44,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {19335#true} [139] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_129| |v_main_#t~post5_128|)) (.cse1 (= |v_main_#t~post6_129| |v_main_#t~post6_128|)) (.cse2 (= v_main_~y~0_421 v_main_~y~0_420)) (.cse3 (= v_main_~x~0_338 v_main_~x~0_337)) (.cse4 (mod v_main_~x~0_338 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3) (and (< 0 .cse4) (= v_main_~y~0_420 (+ v_main_~x~0_338 (* v_main_~x~0_337 (- 1)) v_main_~y~0_421)) (< v_main_~x~0_337 v_main_~x~0_338) (forall ((v_it_27 Int)) (or (not (<= 1 v_it_27)) (< 0 (mod (+ v_main_~x~0_338 (* 4294967295 v_it_27)) 4294967296)) (not (<= (+ v_main_~x~0_337 v_it_27 1) v_main_~x~0_338))))))) InVars {main_~y~0=v_main_~y~0_421, main_#t~post5=|v_main_#t~post5_129|, main_~x~0=v_main_~x~0_338, main_#t~post6=|v_main_#t~post6_129|} OutVars{main_~y~0=v_main_~y~0_420, main_#t~post5=|v_main_#t~post5_128|, main_~x~0=v_main_~x~0_337, main_#t~post6=|v_main_#t~post6_128|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {19335#true} is VALID [2022-04-15 06:44:44,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {19335#true} [138] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {19335#true} is VALID [2022-04-15 06:44:44,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {19335#true} ~z~0 := ~y~0; {19335#true} is VALID [2022-04-15 06:44:44,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {19335#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; {19335#true} is VALID [2022-04-15 06:44:44,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {19335#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; {19335#true} is VALID [2022-04-15 06:44:44,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {19335#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; {19335#true} is VALID [2022-04-15 06:44:44,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {19335#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; {19335#true} is VALID [2022-04-15 06:44:44,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {19335#true} assume !(~z~0 % 4294967296 > 0); {19340#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 06:44:44,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {19340#(<= 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; {19341#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 06:44:44,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {19341#(<= 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; {19342#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 06:44:44,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {19342#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {19343#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:44,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {19343#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19344#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 06:44:44,512 INFO L290 TraceCheckUtils]: 18: Hoare triple {19344#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19345#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 5))} is VALID [2022-04-15 06:44:44,513 INFO L290 TraceCheckUtils]: 19: Hoare triple {19345#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 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; {19346#(<= main_~z~0 (+ 6 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:44,513 INFO L290 TraceCheckUtils]: 20: Hoare triple {19346#(<= main_~z~0 (+ 6 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {19346#(<= main_~z~0 (+ 6 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:44,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {19346#(<= main_~z~0 (+ 6 (* (div (+ main_~z~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; {19346#(<= main_~z~0 (+ 6 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:44,514 INFO L290 TraceCheckUtils]: 22: Hoare triple {19346#(<= main_~z~0 (+ 6 (* (div (+ main_~z~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; {19346#(<= main_~z~0 (+ 6 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:44,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {19346#(<= main_~z~0 (+ 6 (* (div (+ main_~z~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; {19346#(<= main_~z~0 (+ 6 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:44,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {19346#(<= main_~z~0 (+ 6 (* (div (+ main_~z~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; {19346#(<= main_~z~0 (+ 6 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:44,516 INFO L290 TraceCheckUtils]: 25: Hoare triple {19346#(<= main_~z~0 (+ 6 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {19346#(<= main_~z~0 (+ 6 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:44,517 INFO L290 TraceCheckUtils]: 26: Hoare triple {19346#(<= main_~z~0 (+ 6 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {19347#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:44:44,518 INFO L290 TraceCheckUtils]: 27: Hoare triple {19347#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {19336#false} is VALID [2022-04-15 06:44:44,518 INFO L272 TraceCheckUtils]: 28: Hoare triple {19336#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {19336#false} is VALID [2022-04-15 06:44:44,518 INFO L290 TraceCheckUtils]: 29: Hoare triple {19336#false} ~cond := #in~cond; {19336#false} is VALID [2022-04-15 06:44:44,518 INFO L290 TraceCheckUtils]: 30: Hoare triple {19336#false} assume 0 == ~cond; {19336#false} is VALID [2022-04-15 06:44:44,518 INFO L290 TraceCheckUtils]: 31: Hoare triple {19336#false} assume !false; {19336#false} is VALID [2022-04-15 06:44:44,518 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-15 06:44:44,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:44:44,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9576199] [2022-04-15 06:44:44,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9576199] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:44:44,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230998403] [2022-04-15 06:44:44,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:44:44,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:44:44,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:44:44,528 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-15 06:44:44,574 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-15 06:44:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:44,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 06:44:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:44,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:44:44,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {19335#true} call ULTIMATE.init(); {19335#true} is VALID [2022-04-15 06:44:44,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {19335#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19335#true} is VALID [2022-04-15 06:44:44,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {19335#true} assume true; {19335#true} is VALID [2022-04-15 06:44:44,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19335#true} {19335#true} #83#return; {19335#true} is VALID [2022-04-15 06:44:44,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {19335#true} call #t~ret15 := main(); {19335#true} is VALID [2022-04-15 06:44:44,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {19335#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19335#true} is VALID [2022-04-15 06:44:44,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {19335#true} [139] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_129| |v_main_#t~post5_128|)) (.cse1 (= |v_main_#t~post6_129| |v_main_#t~post6_128|)) (.cse2 (= v_main_~y~0_421 v_main_~y~0_420)) (.cse3 (= v_main_~x~0_338 v_main_~x~0_337)) (.cse4 (mod v_main_~x~0_338 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3) (and (< 0 .cse4) (= v_main_~y~0_420 (+ v_main_~x~0_338 (* v_main_~x~0_337 (- 1)) v_main_~y~0_421)) (< v_main_~x~0_337 v_main_~x~0_338) (forall ((v_it_27 Int)) (or (not (<= 1 v_it_27)) (< 0 (mod (+ v_main_~x~0_338 (* 4294967295 v_it_27)) 4294967296)) (not (<= (+ v_main_~x~0_337 v_it_27 1) v_main_~x~0_338))))))) InVars {main_~y~0=v_main_~y~0_421, main_#t~post5=|v_main_#t~post5_129|, main_~x~0=v_main_~x~0_338, main_#t~post6=|v_main_#t~post6_129|} OutVars{main_~y~0=v_main_~y~0_420, main_#t~post5=|v_main_#t~post5_128|, main_~x~0=v_main_~x~0_337, main_#t~post6=|v_main_#t~post6_128|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {19335#true} is VALID [2022-04-15 06:44:44,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {19335#true} [138] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {19335#true} is VALID [2022-04-15 06:44:44,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {19335#true} ~z~0 := ~y~0; {19376#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:44:44,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {19376#(= 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; {19380#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:44:44,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {19380#(= 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; {19384#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-15 06:44:44,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {19384#(= 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; {19388#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-15 06:44:44,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {19388#(= (+ (- 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; {19392#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} is VALID [2022-04-15 06:44:44,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {19392#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} assume !(~z~0 % 4294967296 > 0); {19396#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:44:44,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {19396#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19400#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:44:44,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {19400#(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; {19404#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-15 06:44:44,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {19404#(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; {19408#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:44:44,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {19408#(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; {19412#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:44:44,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {19412#(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; {19336#false} is VALID [2022-04-15 06:44:44,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {19336#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19336#false} is VALID [2022-04-15 06:44:44,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {19336#false} assume !(~y~0 % 4294967296 > 0); {19336#false} is VALID [2022-04-15 06:44:44,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {19336#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; {19336#false} is VALID [2022-04-15 06:44:44,904 INFO L290 TraceCheckUtils]: 22: Hoare triple {19336#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; {19336#false} is VALID [2022-04-15 06:44:44,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {19336#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; {19336#false} is VALID [2022-04-15 06:44:44,905 INFO L290 TraceCheckUtils]: 24: Hoare triple {19336#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; {19336#false} is VALID [2022-04-15 06:44:44,905 INFO L290 TraceCheckUtils]: 25: Hoare triple {19336#false} assume !(~x~0 % 4294967296 > 0); {19336#false} is VALID [2022-04-15 06:44:44,905 INFO L290 TraceCheckUtils]: 26: Hoare triple {19336#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {19336#false} is VALID [2022-04-15 06:44:44,905 INFO L290 TraceCheckUtils]: 27: Hoare triple {19336#false} assume !(~z~0 % 4294967296 > 0); {19336#false} is VALID [2022-04-15 06:44:44,905 INFO L272 TraceCheckUtils]: 28: Hoare triple {19336#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {19336#false} is VALID [2022-04-15 06:44:44,905 INFO L290 TraceCheckUtils]: 29: Hoare triple {19336#false} ~cond := #in~cond; {19336#false} is VALID [2022-04-15 06:44:44,905 INFO L290 TraceCheckUtils]: 30: Hoare triple {19336#false} assume 0 == ~cond; {19336#false} is VALID [2022-04-15 06:44:44,905 INFO L290 TraceCheckUtils]: 31: Hoare triple {19336#false} assume !false; {19336#false} is VALID [2022-04-15 06:44:44,905 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 06:44:44,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:44:45,268 INFO L290 TraceCheckUtils]: 31: Hoare triple {19336#false} assume !false; {19336#false} is VALID [2022-04-15 06:44:45,268 INFO L290 TraceCheckUtils]: 30: Hoare triple {19336#false} assume 0 == ~cond; {19336#false} is VALID [2022-04-15 06:44:45,269 INFO L290 TraceCheckUtils]: 29: Hoare triple {19336#false} ~cond := #in~cond; {19336#false} is VALID [2022-04-15 06:44:45,269 INFO L272 TraceCheckUtils]: 28: Hoare triple {19336#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {19336#false} is VALID [2022-04-15 06:44:45,269 INFO L290 TraceCheckUtils]: 27: Hoare triple {19336#false} assume !(~z~0 % 4294967296 > 0); {19336#false} is VALID [2022-04-15 06:44:45,269 INFO L290 TraceCheckUtils]: 26: Hoare triple {19336#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {19336#false} is VALID [2022-04-15 06:44:45,269 INFO L290 TraceCheckUtils]: 25: Hoare triple {19336#false} assume !(~x~0 % 4294967296 > 0); {19336#false} is VALID [2022-04-15 06:44:45,269 INFO L290 TraceCheckUtils]: 24: Hoare triple {19336#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; {19336#false} is VALID [2022-04-15 06:44:45,269 INFO L290 TraceCheckUtils]: 23: Hoare triple {19336#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; {19336#false} is VALID [2022-04-15 06:44:45,269 INFO L290 TraceCheckUtils]: 22: Hoare triple {19336#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; {19336#false} is VALID [2022-04-15 06:44:45,269 INFO L290 TraceCheckUtils]: 21: Hoare triple {19336#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; {19336#false} is VALID [2022-04-15 06:44:45,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {19336#false} assume !(~y~0 % 4294967296 > 0); {19336#false} is VALID [2022-04-15 06:44:45,269 INFO L290 TraceCheckUtils]: 19: Hoare triple {19336#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19336#false} is VALID [2022-04-15 06:44:45,270 INFO L290 TraceCheckUtils]: 18: Hoare triple {19412#(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; {19336#false} is VALID [2022-04-15 06:44:45,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {19408#(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; {19412#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:44:45,272 INFO L290 TraceCheckUtils]: 16: Hoare triple {19404#(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; {19408#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:44:45,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {19400#(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; {19404#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-15 06:44:45,274 INFO L290 TraceCheckUtils]: 14: Hoare triple {19396#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19400#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:44:45,275 INFO L290 TraceCheckUtils]: 13: Hoare triple {19509#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {19396#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:44:45,276 INFO L290 TraceCheckUtils]: 12: Hoare triple {19513#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19509#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-15 06:44:45,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {19517#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19513#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-15 06:44:45,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {19521#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19517#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-15 06:44:45,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {19525#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19521#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-15 06:44:45,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {19335#true} ~z~0 := ~y~0; {19525#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-15 06:44:45,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {19335#true} [138] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {19335#true} is VALID [2022-04-15 06:44:45,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {19335#true} [139] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_129| |v_main_#t~post5_128|)) (.cse1 (= |v_main_#t~post6_129| |v_main_#t~post6_128|)) (.cse2 (= v_main_~y~0_421 v_main_~y~0_420)) (.cse3 (= v_main_~x~0_338 v_main_~x~0_337)) (.cse4 (mod v_main_~x~0_338 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3) (and (< 0 .cse4) (= v_main_~y~0_420 (+ v_main_~x~0_338 (* v_main_~x~0_337 (- 1)) v_main_~y~0_421)) (< v_main_~x~0_337 v_main_~x~0_338) (forall ((v_it_27 Int)) (or (not (<= 1 v_it_27)) (< 0 (mod (+ v_main_~x~0_338 (* 4294967295 v_it_27)) 4294967296)) (not (<= (+ v_main_~x~0_337 v_it_27 1) v_main_~x~0_338))))))) InVars {main_~y~0=v_main_~y~0_421, main_#t~post5=|v_main_#t~post5_129|, main_~x~0=v_main_~x~0_338, main_#t~post6=|v_main_#t~post6_129|} OutVars{main_~y~0=v_main_~y~0_420, main_#t~post5=|v_main_#t~post5_128|, main_~x~0=v_main_~x~0_337, main_#t~post6=|v_main_#t~post6_128|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {19335#true} is VALID [2022-04-15 06:44:45,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {19335#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19335#true} is VALID [2022-04-15 06:44:45,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {19335#true} call #t~ret15 := main(); {19335#true} is VALID [2022-04-15 06:44:45,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19335#true} {19335#true} #83#return; {19335#true} is VALID [2022-04-15 06:44:45,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {19335#true} assume true; {19335#true} is VALID [2022-04-15 06:44:45,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {19335#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19335#true} is VALID [2022-04-15 06:44:45,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {19335#true} call ULTIMATE.init(); {19335#true} is VALID [2022-04-15 06:44:45,281 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 06:44:45,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230998403] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:44:45,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:44:45,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 26 [2022-04-15 06:44:45,555 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:44:45,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2118161270] [2022-04-15 06:44:45,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2118161270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:44:45,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:44:45,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 06:44:45,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538887678] [2022-04-15 06:44:45,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:44:45,555 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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 35 [2022-04-15 06:44:45,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:44:45,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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-15 06:44:45,586 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-15 06:44:45,586 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 06:44:45,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:44:45,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 06:44:45,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2022-04-15 06:44:45,587 INFO L87 Difference]: Start difference. First operand 125 states and 170 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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-15 06:44:50,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:50,854 INFO L93 Difference]: Finished difference Result 217 states and 293 transitions. [2022-04-15 06:44:50,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 06:44:50,854 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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 35 [2022-04-15 06:44:50,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:44:50,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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-15 06:44:50,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 110 transitions. [2022-04-15 06:44:50,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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-15 06:44:50,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 110 transitions. [2022-04-15 06:44:50,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 110 transitions. [2022-04-15 06:44:51,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:44:51,083 INFO L225 Difference]: With dead ends: 217 [2022-04-15 06:44:51,083 INFO L226 Difference]: Without dead ends: 211 [2022-04-15 06:44:51,084 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=573, Invalid=3209, Unknown=0, NotChecked=0, Total=3782 [2022-04-15 06:44:51,084 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 74 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:44:51,084 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 66 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 06:44:51,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-04-15 06:44:52,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 143. [2022-04-15 06:44:52,251 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:44:52,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 211 states. Second operand has 143 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 138 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:44:52,251 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand has 143 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 138 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:44:52,252 INFO L87 Difference]: Start difference. First operand 211 states. Second operand has 143 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 138 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:44:52,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:52,254 INFO L93 Difference]: Finished difference Result 211 states and 274 transitions. [2022-04-15 06:44:52,254 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 274 transitions. [2022-04-15 06:44:52,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:44:52,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:44:52,254 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 138 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 211 states. [2022-04-15 06:44:52,254 INFO L87 Difference]: Start difference. First operand has 143 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 138 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 211 states. [2022-04-15 06:44:52,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:52,257 INFO L93 Difference]: Finished difference Result 211 states and 274 transitions. [2022-04-15 06:44:52,257 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 274 transitions. [2022-04-15 06:44:52,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:44:52,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:44:52,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:44:52,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:44:52,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 138 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:44:52,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 194 transitions. [2022-04-15 06:44:52,260 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 194 transitions. Word has length 35 [2022-04-15 06:44:52,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:44:52,260 INFO L478 AbstractCegarLoop]: Abstraction has 143 states and 194 transitions. [2022-04-15 06:44:52,261 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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-15 06:44:52,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 143 states and 194 transitions. [2022-04-15 06:45:00,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 192 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 06:45:00,746 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 194 transitions. [2022-04-15 06:45:00,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 06:45:00,747 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:45:00,747 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:45:00,764 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-15 06:45:00,951 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-04-15 06:45:00,951 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:45:00,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:45:00,952 INFO L85 PathProgramCache]: Analyzing trace with hash 955015874, now seen corresponding path program 16 times [2022-04-15 06:45:00,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:45:00,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [375216702] [2022-04-15 06:45:01,148 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-15 06:45:01,150 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:45:01,152 INFO L85 PathProgramCache]: Analyzing trace with hash 2096057710, now seen corresponding path program 1 times [2022-04-15 06:45:01,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:45:01,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373310187] [2022-04-15 06:45:01,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:45:01,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:45:01,162 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-15 06:45:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:01,187 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-15 06:45:01,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:45:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:01,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {20787#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20769#true} is VALID [2022-04-15 06:45:01,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {20769#true} assume true; {20769#true} is VALID [2022-04-15 06:45:01,492 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20769#true} {20769#true} #83#return; {20769#true} is VALID [2022-04-15 06:45:01,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {20769#true} call ULTIMATE.init(); {20787#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:45:01,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {20787#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20769#true} is VALID [2022-04-15 06:45:01,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {20769#true} assume true; {20769#true} is VALID [2022-04-15 06:45:01,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20769#true} {20769#true} #83#return; {20769#true} is VALID [2022-04-15 06:45:01,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {20769#true} call #t~ret15 := main(); {20769#true} is VALID [2022-04-15 06:45:01,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {20769#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20769#true} is VALID [2022-04-15 06:45:01,493 INFO L290 TraceCheckUtils]: 6: Hoare triple {20769#true} [141] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_356 4294967296)) (.cse1 (= |v_main_#t~post5_134| |v_main_#t~post5_133|)) (.cse2 (= |v_main_#t~post6_134| |v_main_#t~post6_133|)) (.cse3 (= v_main_~y~0_446 v_main_~y~0_445)) (.cse4 (= v_main_~x~0_356 v_main_~x~0_355))) (or (and (= v_main_~y~0_445 (+ v_main_~x~0_356 (* v_main_~x~0_355 (- 1)) v_main_~y~0_446)) (forall ((v_it_28 Int)) (or (< 0 (mod (+ v_main_~x~0_356 (* 4294967295 v_it_28)) 4294967296)) (not (<= (+ v_main_~x~0_355 v_it_28 1) v_main_~x~0_356)) (not (<= 1 v_it_28)))) (< v_main_~x~0_355 v_main_~x~0_356) (< 0 .cse0)) (and .cse1 .cse2 .cse3 .cse4) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_446, main_#t~post5=|v_main_#t~post5_134|, main_~x~0=v_main_~x~0_356, main_#t~post6=|v_main_#t~post6_134|} OutVars{main_~y~0=v_main_~y~0_445, main_#t~post5=|v_main_#t~post5_133|, main_~x~0=v_main_~x~0_355, main_#t~post6=|v_main_#t~post6_133|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20769#true} is VALID [2022-04-15 06:45:01,493 INFO L290 TraceCheckUtils]: 7: Hoare triple {20769#true} [140] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {20769#true} is VALID [2022-04-15 06:45:01,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {20769#true} ~z~0 := ~y~0; {20774#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:45:01,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {20774#(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; {20775#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:45:01,495 INFO L290 TraceCheckUtils]: 10: Hoare triple {20775#(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; {20776#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:45:01,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {20776#(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; {20777#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:45:01,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {20777#(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; {20778#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:45:01,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {20778#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {20779#(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-15 06:45:01,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {20779#(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; {20780#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:01,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {20780#(<= 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; {20781#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:01,500 INFO L290 TraceCheckUtils]: 16: Hoare triple {20781#(<= 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; {20782#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:45:01,501 INFO L290 TraceCheckUtils]: 17: Hoare triple {20782#(<= 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; {20783#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:45:01,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {20783#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {20783#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:45:01,502 INFO L290 TraceCheckUtils]: 19: Hoare triple {20783#(<= 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; {20782#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:45:01,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {20782#(<= 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; {20781#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:01,503 INFO L290 TraceCheckUtils]: 21: Hoare triple {20781#(<= 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; {20780#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:01,504 INFO L290 TraceCheckUtils]: 22: Hoare triple {20780#(<= main_~y~0 (+ 3 (* (div (+ main_~y~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; {20784#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:01,505 INFO L290 TraceCheckUtils]: 23: Hoare triple {20784#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {20784#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:01,505 INFO L290 TraceCheckUtils]: 24: Hoare triple {20784#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20780#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:01,506 INFO L290 TraceCheckUtils]: 25: Hoare triple {20780#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20781#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:01,507 INFO L290 TraceCheckUtils]: 26: Hoare triple {20781#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20782#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:45:01,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {20782#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20783#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:45:01,508 INFO L290 TraceCheckUtils]: 28: Hoare triple {20783#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {20783#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:45:01,509 INFO L272 TraceCheckUtils]: 29: Hoare triple {20783#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {20785#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:45:01,509 INFO L290 TraceCheckUtils]: 30: Hoare triple {20785#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {20786#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:45:01,510 INFO L290 TraceCheckUtils]: 31: Hoare triple {20786#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {20770#false} is VALID [2022-04-15 06:45:01,510 INFO L290 TraceCheckUtils]: 32: Hoare triple {20770#false} assume !false; {20770#false} is VALID [2022-04-15 06:45:01,510 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:45:01,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:45:01,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373310187] [2022-04-15 06:45:01,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373310187] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:45:01,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734005215] [2022-04-15 06:45:01,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:45:01,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:45:01,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:45:01,511 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-15 06:45:01,512 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-15 06:45:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:01,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-15 06:45:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:01,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:45:02,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {20769#true} call ULTIMATE.init(); {20769#true} is VALID [2022-04-15 06:45:02,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {20769#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20769#true} is VALID [2022-04-15 06:45:02,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {20769#true} assume true; {20769#true} is VALID [2022-04-15 06:45:02,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20769#true} {20769#true} #83#return; {20769#true} is VALID [2022-04-15 06:45:02,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {20769#true} call #t~ret15 := main(); {20769#true} is VALID [2022-04-15 06:45:02,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {20769#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20769#true} is VALID [2022-04-15 06:45:02,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {20769#true} [141] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_356 4294967296)) (.cse1 (= |v_main_#t~post5_134| |v_main_#t~post5_133|)) (.cse2 (= |v_main_#t~post6_134| |v_main_#t~post6_133|)) (.cse3 (= v_main_~y~0_446 v_main_~y~0_445)) (.cse4 (= v_main_~x~0_356 v_main_~x~0_355))) (or (and (= v_main_~y~0_445 (+ v_main_~x~0_356 (* v_main_~x~0_355 (- 1)) v_main_~y~0_446)) (forall ((v_it_28 Int)) (or (< 0 (mod (+ v_main_~x~0_356 (* 4294967295 v_it_28)) 4294967296)) (not (<= (+ v_main_~x~0_355 v_it_28 1) v_main_~x~0_356)) (not (<= 1 v_it_28)))) (< v_main_~x~0_355 v_main_~x~0_356) (< 0 .cse0)) (and .cse1 .cse2 .cse3 .cse4) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_446, main_#t~post5=|v_main_#t~post5_134|, main_~x~0=v_main_~x~0_356, main_#t~post6=|v_main_#t~post6_134|} OutVars{main_~y~0=v_main_~y~0_445, main_#t~post5=|v_main_#t~post5_133|, main_~x~0=v_main_~x~0_355, main_#t~post6=|v_main_#t~post6_133|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20769#true} is VALID [2022-04-15 06:45:02,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {20769#true} [140] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {20769#true} is VALID [2022-04-15 06:45:02,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {20769#true} ~z~0 := ~y~0; {20774#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:45:02,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {20774#(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; {20775#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:45:02,199 INFO L290 TraceCheckUtils]: 10: Hoare triple {20775#(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; {20776#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:45:02,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {20776#(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; {20777#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:45:02,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {20777#(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; {20778#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:45:02,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {20778#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {20778#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:45:02,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {20778#(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; {20776#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:45:02,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {20776#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20774#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:45:02,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {20774#(and (<= main_~y~0 main_~z~0) (<= 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; {20839#(and (<= main_~z~0 (+ main_~y~0 2)) (<= (+ main_~y~0 2) main_~z~0))} is VALID [2022-04-15 06:45:02,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {20839#(and (<= main_~z~0 (+ main_~y~0 2)) (<= (+ main_~y~0 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; {20843#(and (<= main_~z~0 (+ main_~y~0 4)) (<= (+ main_~y~0 4) main_~z~0))} is VALID [2022-04-15 06:45:02,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {20843#(and (<= main_~z~0 (+ main_~y~0 4)) (<= (+ main_~y~0 4) main_~z~0))} assume !(~y~0 % 4294967296 > 0); {20843#(and (<= main_~z~0 (+ main_~y~0 4)) (<= (+ main_~y~0 4) main_~z~0))} is VALID [2022-04-15 06:45:02,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {20843#(and (<= main_~z~0 (+ main_~y~0 4)) (<= (+ main_~y~0 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; {20850#(and (<= (+ main_~y~0 3) main_~z~0) (<= main_~z~0 (+ main_~y~0 3)))} is VALID [2022-04-15 06:45:02,205 INFO L290 TraceCheckUtils]: 20: Hoare triple {20850#(and (<= (+ main_~y~0 3) main_~z~0) (<= main_~z~0 (+ main_~y~0 3)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20839#(and (<= main_~z~0 (+ main_~y~0 2)) (<= (+ main_~y~0 2) main_~z~0))} is VALID [2022-04-15 06:45:02,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {20839#(and (<= main_~z~0 (+ main_~y~0 2)) (<= (+ main_~y~0 2) 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; {20857#(and (<= (+ main_~y~0 1) main_~z~0) (<= main_~z~0 (+ main_~y~0 1)))} is VALID [2022-04-15 06:45:02,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {20857#(and (<= (+ main_~y~0 1) main_~z~0) (<= 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; {20774#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:45:02,207 INFO L290 TraceCheckUtils]: 23: Hoare triple {20774#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {20774#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:45:02,207 INFO L290 TraceCheckUtils]: 24: Hoare triple {20774#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20774#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:45:02,208 INFO L290 TraceCheckUtils]: 25: Hoare triple {20774#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20774#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:45:02,208 INFO L290 TraceCheckUtils]: 26: Hoare triple {20774#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20774#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:45:02,209 INFO L290 TraceCheckUtils]: 27: Hoare triple {20774#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20774#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:45:02,210 INFO L290 TraceCheckUtils]: 28: Hoare triple {20774#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {20783#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:45:02,210 INFO L272 TraceCheckUtils]: 29: Hoare triple {20783#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {20882#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:45:02,211 INFO L290 TraceCheckUtils]: 30: Hoare triple {20882#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20886#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:45:02,212 INFO L290 TraceCheckUtils]: 31: Hoare triple {20886#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20770#false} is VALID [2022-04-15 06:45:02,212 INFO L290 TraceCheckUtils]: 32: Hoare triple {20770#false} assume !false; {20770#false} is VALID [2022-04-15 06:45:02,213 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:45:02,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:45:03,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {20770#false} assume !false; {20770#false} is VALID [2022-04-15 06:45:03,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {20886#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20770#false} is VALID [2022-04-15 06:45:03,319 INFO L290 TraceCheckUtils]: 30: Hoare triple {20882#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20886#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:45:03,320 INFO L272 TraceCheckUtils]: 29: Hoare triple {20783#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {20882#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:45:03,321 INFO L290 TraceCheckUtils]: 28: Hoare triple {20905#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {20783#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:45:03,322 INFO L290 TraceCheckUtils]: 27: Hoare triple {20909#(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~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20905#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 06:45:03,324 INFO L290 TraceCheckUtils]: 26: Hoare triple {20913#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20909#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:45:03,325 INFO L290 TraceCheckUtils]: 25: Hoare triple {20917#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20913#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-15 06:45:03,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {20921#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20917#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 06:45:03,327 INFO L290 TraceCheckUtils]: 23: Hoare triple {20921#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {20921#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-15 06:45:03,328 INFO L290 TraceCheckUtils]: 22: Hoare triple {20928#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~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; {20921#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-15 06:45:03,329 INFO L290 TraceCheckUtils]: 21: Hoare triple {20932#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ 4294967292 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; {20928#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 06:45:03,330 INFO L290 TraceCheckUtils]: 20: Hoare triple {20936#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 0 (mod (+ 4294967292 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; {20932#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-15 06:45:03,330 INFO L290 TraceCheckUtils]: 19: Hoare triple {20940#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (< 0 (mod (+ 4294967292 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; {20936#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-15 06:45:03,331 INFO L290 TraceCheckUtils]: 18: Hoare triple {20940#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {20940#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-15 06:45:03,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {20947#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 0 (mod (+ main_~z~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; {20940#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-15 06:45:03,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {20913#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~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; {20947#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:45:03,334 INFO L290 TraceCheckUtils]: 15: Hoare triple {20954#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= 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; {20913#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-15 06:45:03,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {20958#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~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; {20954#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 06:45:03,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {20958#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {20958#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-15 06:45:03,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {20965#(or (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 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; {20958#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-15 06:45:03,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {20969#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~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; {20965#(or (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:45:03,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {20973#(or (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 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; {20969#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-15 06:45:03,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {20921#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~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; {20973#(or (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:45:03,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {20769#true} ~z~0 := ~y~0; {20921#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-15 06:45:03,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {20769#true} [140] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {20769#true} is VALID [2022-04-15 06:45:03,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {20769#true} [141] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_356 4294967296)) (.cse1 (= |v_main_#t~post5_134| |v_main_#t~post5_133|)) (.cse2 (= |v_main_#t~post6_134| |v_main_#t~post6_133|)) (.cse3 (= v_main_~y~0_446 v_main_~y~0_445)) (.cse4 (= v_main_~x~0_356 v_main_~x~0_355))) (or (and (= v_main_~y~0_445 (+ v_main_~x~0_356 (* v_main_~x~0_355 (- 1)) v_main_~y~0_446)) (forall ((v_it_28 Int)) (or (< 0 (mod (+ v_main_~x~0_356 (* 4294967295 v_it_28)) 4294967296)) (not (<= (+ v_main_~x~0_355 v_it_28 1) v_main_~x~0_356)) (not (<= 1 v_it_28)))) (< v_main_~x~0_355 v_main_~x~0_356) (< 0 .cse0)) (and .cse1 .cse2 .cse3 .cse4) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_446, main_#t~post5=|v_main_#t~post5_134|, main_~x~0=v_main_~x~0_356, main_#t~post6=|v_main_#t~post6_134|} OutVars{main_~y~0=v_main_~y~0_445, main_#t~post5=|v_main_#t~post5_133|, main_~x~0=v_main_~x~0_355, main_#t~post6=|v_main_#t~post6_133|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20769#true} is VALID [2022-04-15 06:45:03,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {20769#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20769#true} is VALID [2022-04-15 06:45:03,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {20769#true} call #t~ret15 := main(); {20769#true} is VALID [2022-04-15 06:45:03,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20769#true} {20769#true} #83#return; {20769#true} is VALID [2022-04-15 06:45:03,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {20769#true} assume true; {20769#true} is VALID [2022-04-15 06:45:03,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {20769#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20769#true} is VALID [2022-04-15 06:45:03,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {20769#true} call ULTIMATE.init(); {20769#true} is VALID [2022-04-15 06:45:03,342 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:45:03,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734005215] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:45:03,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:45:03,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 20] total 37 [2022-04-15 06:45:03,636 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:45:03,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [375216702] [2022-04-15 06:45:03,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [375216702] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:45:03,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:45:03,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 06:45:03,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623535073] [2022-04-15 06:45:03,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:45:03,637 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 18 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-15 06:45:03,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:45:03,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.6) internal successors, (32), 18 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:45:03,676 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-15 06:45:03,676 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 06:45:03,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:45:03,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 06:45:03,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1517, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 06:45:03,677 INFO L87 Difference]: Start difference. First operand 143 states and 194 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 18 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:45:10,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:10,590 INFO L93 Difference]: Finished difference Result 353 states and 472 transitions. [2022-04-15 06:45:10,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 06:45:10,590 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 18 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-15 06:45:10,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:45:10,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 18 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:45:10,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 85 transitions. [2022-04-15 06:45:10,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 18 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:45:10,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 85 transitions. [2022-04-15 06:45:10,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 85 transitions. [2022-04-15 06:45:10,810 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-15 06:45:10,812 INFO L225 Difference]: With dead ends: 353 [2022-04-15 06:45:10,812 INFO L226 Difference]: Without dead ends: 208 [2022-04-15 06:45:10,814 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=435, Invalid=3855, Unknown=0, NotChecked=0, Total=4290 [2022-04-15 06:45:10,814 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 47 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:45:10,814 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 101 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-15 06:45:10,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-04-15 06:45:12,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 144. [2022-04-15 06:45:12,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:45:12,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 208 states. Second operand has 144 states, 139 states have (on average 1.381294964028777) internal successors, (192), 139 states have internal predecessors, (192), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:45:12,040 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand has 144 states, 139 states have (on average 1.381294964028777) internal successors, (192), 139 states have internal predecessors, (192), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:45:12,041 INFO L87 Difference]: Start difference. First operand 208 states. Second operand has 144 states, 139 states have (on average 1.381294964028777) internal successors, (192), 139 states have internal predecessors, (192), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:45:12,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:12,043 INFO L93 Difference]: Finished difference Result 208 states and 273 transitions. [2022-04-15 06:45:12,043 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 273 transitions. [2022-04-15 06:45:12,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:45:12,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:45:12,043 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 139 states have (on average 1.381294964028777) internal successors, (192), 139 states have internal predecessors, (192), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 208 states. [2022-04-15 06:45:12,044 INFO L87 Difference]: Start difference. First operand has 144 states, 139 states have (on average 1.381294964028777) internal successors, (192), 139 states have internal predecessors, (192), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 208 states. [2022-04-15 06:45:12,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:12,047 INFO L93 Difference]: Finished difference Result 208 states and 273 transitions. [2022-04-15 06:45:12,047 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 273 transitions. [2022-04-15 06:45:12,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:45:12,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:45:12,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:45:12,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:45:12,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 139 states have (on average 1.381294964028777) internal successors, (192), 139 states have internal predecessors, (192), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:45:12,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 196 transitions. [2022-04-15 06:45:12,050 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 196 transitions. Word has length 36 [2022-04-15 06:45:12,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:45:12,050 INFO L478 AbstractCegarLoop]: Abstraction has 144 states and 196 transitions. [2022-04-15 06:45:12,050 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 18 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:45:12,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 144 states and 196 transitions. [2022-04-15 06:45:22,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 193 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 06:45:22,315 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 196 transitions. [2022-04-15 06:45:22,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 06:45:22,315 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:45:22,315 INFO L499 BasicCegarLoop]: trace histogram [7, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:45:22,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-04-15 06:45:22,516 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-04-15 06:45:22,516 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:45:22,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:45:22,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1121793873, now seen corresponding path program 17 times [2022-04-15 06:45:22,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:45:22,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [515251264] [2022-04-15 06:45:24,630 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:45:24,714 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-15 06:45:24,716 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:45:24,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1126625650, now seen corresponding path program 1 times [2022-04-15 06:45:24,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:45:24,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735168307] [2022-04-15 06:45:24,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:45:24,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:45:24,727 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-15 06:45:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:24,745 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-15 06:45:24,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:45:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:24,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {22487#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22473#true} is VALID [2022-04-15 06:45:24,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {22473#true} assume true; {22473#true} is VALID [2022-04-15 06:45:24,924 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22473#true} {22473#true} #83#return; {22473#true} is VALID [2022-04-15 06:45:24,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {22473#true} call ULTIMATE.init(); {22487#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:45:24,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {22487#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22473#true} is VALID [2022-04-15 06:45:24,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {22473#true} assume true; {22473#true} is VALID [2022-04-15 06:45:24,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22473#true} {22473#true} #83#return; {22473#true} is VALID [2022-04-15 06:45:24,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {22473#true} call #t~ret15 := main(); {22473#true} is VALID [2022-04-15 06:45:24,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {22473#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22473#true} is VALID [2022-04-15 06:45:24,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {22473#true} [143] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_374 v_main_~x~0_373)) (.cse1 (= |v_main_#t~post5_139| |v_main_#t~post5_138|)) (.cse2 (= |v_main_#t~post6_139| |v_main_#t~post6_138|)) (.cse3 (mod v_main_~x~0_374 4294967296))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_480 v_main_~y~0_479)) (and .cse0 (= v_main_~y~0_479 v_main_~y~0_480) .cse1 .cse2 (<= .cse3 0)) (and (< v_main_~y~0_480 v_main_~y~0_479) (forall ((v_it_29 Int)) (or (not (<= (+ v_main_~y~0_480 v_it_29 1) v_main_~y~0_479)) (< 0 (mod (+ v_main_~x~0_374 (* 4294967295 v_it_29)) 4294967296)) (not (<= 1 v_it_29)))) (< 0 .cse3) (= v_main_~x~0_373 (+ v_main_~x~0_374 v_main_~y~0_480 (* (- 1) v_main_~y~0_479)))))) InVars {main_~y~0=v_main_~y~0_480, main_#t~post5=|v_main_#t~post5_139|, main_~x~0=v_main_~x~0_374, main_#t~post6=|v_main_#t~post6_139|} OutVars{main_~y~0=v_main_~y~0_479, main_#t~post5=|v_main_#t~post5_138|, main_~x~0=v_main_~x~0_373, main_#t~post6=|v_main_#t~post6_138|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {22473#true} is VALID [2022-04-15 06:45:24,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {22473#true} [142] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {22478#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:45:24,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {22478#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {22478#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:45:24,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {22478#(<= 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; {22479#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:45:24,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {22479#(<= 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; {22480#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:24,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {22480#(<= 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; {22481#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:24,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {22481#(<= 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; {22482#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:24,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {22482#(<= 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; {22483#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:45:24,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {22483#(<= 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; {22484#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:24,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {22484#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22485#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:24,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {22485#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {22485#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:24,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {22485#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22485#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:24,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {22485#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22485#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:24,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {22485#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22485#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:24,937 INFO L290 TraceCheckUtils]: 20: Hoare triple {22485#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22485#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:24,937 INFO L290 TraceCheckUtils]: 21: Hoare triple {22485#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {22485#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:24,939 INFO L290 TraceCheckUtils]: 22: Hoare triple {22485#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {22486#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 06:45:24,939 INFO L290 TraceCheckUtils]: 23: Hoare triple {22486#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {22474#false} is VALID [2022-04-15 06:45:24,939 INFO L290 TraceCheckUtils]: 24: Hoare triple {22474#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {22474#false} is VALID [2022-04-15 06:45:24,939 INFO L290 TraceCheckUtils]: 25: Hoare triple {22474#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {22474#false} is VALID [2022-04-15 06:45:24,940 INFO L290 TraceCheckUtils]: 26: Hoare triple {22474#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {22474#false} is VALID [2022-04-15 06:45:24,940 INFO L290 TraceCheckUtils]: 27: Hoare triple {22474#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {22474#false} is VALID [2022-04-15 06:45:24,940 INFO L290 TraceCheckUtils]: 28: Hoare triple {22474#false} assume !(~z~0 % 4294967296 > 0); {22474#false} is VALID [2022-04-15 06:45:24,940 INFO L272 TraceCheckUtils]: 29: Hoare triple {22474#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {22474#false} is VALID [2022-04-15 06:45:24,940 INFO L290 TraceCheckUtils]: 30: Hoare triple {22474#false} ~cond := #in~cond; {22474#false} is VALID [2022-04-15 06:45:24,940 INFO L290 TraceCheckUtils]: 31: Hoare triple {22474#false} assume 0 == ~cond; {22474#false} is VALID [2022-04-15 06:45:24,940 INFO L290 TraceCheckUtils]: 32: Hoare triple {22474#false} assume !false; {22474#false} is VALID [2022-04-15 06:45:24,940 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-15 06:45:24,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:45:24,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735168307] [2022-04-15 06:45:24,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735168307] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:45:24,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004296893] [2022-04-15 06:45:24,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:45:24,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:45:24,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:45:24,944 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-15 06:45:24,971 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-15 06:45:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:25,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 06:45:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:25,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:45:25,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {22473#true} call ULTIMATE.init(); {22473#true} is VALID [2022-04-15 06:45:25,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {22473#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22473#true} is VALID [2022-04-15 06:45:25,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {22473#true} assume true; {22473#true} is VALID [2022-04-15 06:45:25,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22473#true} {22473#true} #83#return; {22473#true} is VALID [2022-04-15 06:45:25,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {22473#true} call #t~ret15 := main(); {22473#true} is VALID [2022-04-15 06:45:25,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {22473#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22473#true} is VALID [2022-04-15 06:45:25,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {22473#true} [143] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_374 v_main_~x~0_373)) (.cse1 (= |v_main_#t~post5_139| |v_main_#t~post5_138|)) (.cse2 (= |v_main_#t~post6_139| |v_main_#t~post6_138|)) (.cse3 (mod v_main_~x~0_374 4294967296))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_480 v_main_~y~0_479)) (and .cse0 (= v_main_~y~0_479 v_main_~y~0_480) .cse1 .cse2 (<= .cse3 0)) (and (< v_main_~y~0_480 v_main_~y~0_479) (forall ((v_it_29 Int)) (or (not (<= (+ v_main_~y~0_480 v_it_29 1) v_main_~y~0_479)) (< 0 (mod (+ v_main_~x~0_374 (* 4294967295 v_it_29)) 4294967296)) (not (<= 1 v_it_29)))) (< 0 .cse3) (= v_main_~x~0_373 (+ v_main_~x~0_374 v_main_~y~0_480 (* (- 1) v_main_~y~0_479)))))) InVars {main_~y~0=v_main_~y~0_480, main_#t~post5=|v_main_#t~post5_139|, main_~x~0=v_main_~x~0_374, main_#t~post6=|v_main_#t~post6_139|} OutVars{main_~y~0=v_main_~y~0_479, main_#t~post5=|v_main_#t~post5_138|, main_~x~0=v_main_~x~0_373, main_#t~post6=|v_main_#t~post6_138|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {22473#true} is VALID [2022-04-15 06:45:25,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {22473#true} [142] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {22473#true} is VALID [2022-04-15 06:45:25,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {22473#true} ~z~0 := ~y~0; {22515#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:45:25,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {22515#(= 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; {22519#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:45:25,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {22519#(= 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; {22523#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:45:25,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {22523#(= (+ 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; {22527#(= (+ main_~z~0 2) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:45:25,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {22527#(= (+ 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; {22531#(= (+ main_~y~0 (- 3)) (+ main_~z~0 1))} is VALID [2022-04-15 06:45:25,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {22531#(= (+ 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; {22535#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-15 06:45:25,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {22535#(< 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; {22535#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-15 06:45:25,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {22535#(< 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; {22535#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-15 06:45:25,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {22535#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {22535#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-15 06:45:25,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {22535#(< 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; {22548#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-15 06:45:25,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {22548#(< 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; {22552#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:45:25,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {22552#(< 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; {22556#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:45:25,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {22556#(< 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; {22560#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:45:25,361 INFO L290 TraceCheckUtils]: 21: Hoare triple {22560#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {22474#false} is VALID [2022-04-15 06:45:25,361 INFO L290 TraceCheckUtils]: 22: Hoare triple {22474#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; {22474#false} is VALID [2022-04-15 06:45:25,361 INFO L290 TraceCheckUtils]: 23: Hoare triple {22474#false} assume !(~x~0 % 4294967296 > 0); {22474#false} is VALID [2022-04-15 06:45:25,361 INFO L290 TraceCheckUtils]: 24: Hoare triple {22474#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {22474#false} is VALID [2022-04-15 06:45:25,361 INFO L290 TraceCheckUtils]: 25: Hoare triple {22474#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {22474#false} is VALID [2022-04-15 06:45:25,362 INFO L290 TraceCheckUtils]: 26: Hoare triple {22474#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {22474#false} is VALID [2022-04-15 06:45:25,362 INFO L290 TraceCheckUtils]: 27: Hoare triple {22474#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {22474#false} is VALID [2022-04-15 06:45:25,362 INFO L290 TraceCheckUtils]: 28: Hoare triple {22474#false} assume !(~z~0 % 4294967296 > 0); {22474#false} is VALID [2022-04-15 06:45:25,362 INFO L272 TraceCheckUtils]: 29: Hoare triple {22474#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {22474#false} is VALID [2022-04-15 06:45:25,362 INFO L290 TraceCheckUtils]: 30: Hoare triple {22474#false} ~cond := #in~cond; {22474#false} is VALID [2022-04-15 06:45:25,362 INFO L290 TraceCheckUtils]: 31: Hoare triple {22474#false} assume 0 == ~cond; {22474#false} is VALID [2022-04-15 06:45:25,362 INFO L290 TraceCheckUtils]: 32: Hoare triple {22474#false} assume !false; {22474#false} is VALID [2022-04-15 06:45:25,362 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-15 06:45:25,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:45:25,690 INFO L290 TraceCheckUtils]: 32: Hoare triple {22474#false} assume !false; {22474#false} is VALID [2022-04-15 06:45:25,690 INFO L290 TraceCheckUtils]: 31: Hoare triple {22474#false} assume 0 == ~cond; {22474#false} is VALID [2022-04-15 06:45:25,690 INFO L290 TraceCheckUtils]: 30: Hoare triple {22474#false} ~cond := #in~cond; {22474#false} is VALID [2022-04-15 06:45:25,690 INFO L272 TraceCheckUtils]: 29: Hoare triple {22474#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {22474#false} is VALID [2022-04-15 06:45:25,690 INFO L290 TraceCheckUtils]: 28: Hoare triple {22474#false} assume !(~z~0 % 4294967296 > 0); {22474#false} is VALID [2022-04-15 06:45:25,690 INFO L290 TraceCheckUtils]: 27: Hoare triple {22474#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {22474#false} is VALID [2022-04-15 06:45:25,690 INFO L290 TraceCheckUtils]: 26: Hoare triple {22474#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {22474#false} is VALID [2022-04-15 06:45:25,690 INFO L290 TraceCheckUtils]: 25: Hoare triple {22474#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {22474#false} is VALID [2022-04-15 06:45:25,691 INFO L290 TraceCheckUtils]: 24: Hoare triple {22474#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {22474#false} is VALID [2022-04-15 06:45:25,691 INFO L290 TraceCheckUtils]: 23: Hoare triple {22474#false} assume !(~x~0 % 4294967296 > 0); {22474#false} is VALID [2022-04-15 06:45:25,691 INFO L290 TraceCheckUtils]: 22: Hoare triple {22474#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; {22474#false} is VALID [2022-04-15 06:45:25,691 INFO L290 TraceCheckUtils]: 21: Hoare triple {22560#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {22474#false} is VALID [2022-04-15 06:45:25,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {22556#(< 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; {22560#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:45:25,693 INFO L290 TraceCheckUtils]: 19: Hoare triple {22552#(< 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; {22556#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:45:25,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {22548#(< 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; {22552#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:45:25,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {22535#(< 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; {22548#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-15 06:45:25,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {22535#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {22535#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-15 06:45:25,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {22535#(< 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; {22535#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-15 06:45:25,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {22535#(< 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; {22535#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-15 06:45:25,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {22654#(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; {22535#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-15 06:45:25,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {22658#(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; {22654#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:45:25,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {22662#(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; {22658#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:45:25,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {22666#(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; {22662#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:45:25,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {22670#(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; {22666#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:45:25,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {22473#true} ~z~0 := ~y~0; {22670#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:45:25,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {22473#true} [142] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {22473#true} is VALID [2022-04-15 06:45:25,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {22473#true} [143] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_374 v_main_~x~0_373)) (.cse1 (= |v_main_#t~post5_139| |v_main_#t~post5_138|)) (.cse2 (= |v_main_#t~post6_139| |v_main_#t~post6_138|)) (.cse3 (mod v_main_~x~0_374 4294967296))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_480 v_main_~y~0_479)) (and .cse0 (= v_main_~y~0_479 v_main_~y~0_480) .cse1 .cse2 (<= .cse3 0)) (and (< v_main_~y~0_480 v_main_~y~0_479) (forall ((v_it_29 Int)) (or (not (<= (+ v_main_~y~0_480 v_it_29 1) v_main_~y~0_479)) (< 0 (mod (+ v_main_~x~0_374 (* 4294967295 v_it_29)) 4294967296)) (not (<= 1 v_it_29)))) (< 0 .cse3) (= v_main_~x~0_373 (+ v_main_~x~0_374 v_main_~y~0_480 (* (- 1) v_main_~y~0_479)))))) InVars {main_~y~0=v_main_~y~0_480, main_#t~post5=|v_main_#t~post5_139|, main_~x~0=v_main_~x~0_374, main_#t~post6=|v_main_#t~post6_139|} OutVars{main_~y~0=v_main_~y~0_479, main_#t~post5=|v_main_#t~post5_138|, main_~x~0=v_main_~x~0_373, main_#t~post6=|v_main_#t~post6_138|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {22473#true} is VALID [2022-04-15 06:45:25,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {22473#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22473#true} is VALID [2022-04-15 06:45:25,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {22473#true} call #t~ret15 := main(); {22473#true} is VALID [2022-04-15 06:45:25,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22473#true} {22473#true} #83#return; {22473#true} is VALID [2022-04-15 06:45:25,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {22473#true} assume true; {22473#true} is VALID [2022-04-15 06:45:25,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {22473#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22473#true} is VALID [2022-04-15 06:45:25,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {22473#true} call ULTIMATE.init(); {22473#true} is VALID [2022-04-15 06:45:25,701 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-15 06:45:25,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004296893] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:45:25,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:45:25,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2022-04-15 06:45:26,164 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:45:26,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [515251264] [2022-04-15 06:45:26,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [515251264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:45:26,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:45:26,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 06:45:26,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546992215] [2022-04-15 06:45:26,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:45:26,165 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 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 37 [2022-04-15 06:45:26,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:45:26,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 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-15 06:45:26,196 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-15 06:45:26,196 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 06:45:26,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:45:26,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 06:45:26,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=869, Unknown=0, NotChecked=0, Total=992 [2022-04-15 06:45:26,197 INFO L87 Difference]: Start difference. First operand 144 states and 196 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 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-15 06:45:31,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:31,780 INFO L93 Difference]: Finished difference Result 332 states and 508 transitions. [2022-04-15 06:45:31,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 06:45:31,780 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 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 37 [2022-04-15 06:45:31,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:45:31,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 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-15 06:45:31,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 108 transitions. [2022-04-15 06:45:31,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 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-15 06:45:31,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 108 transitions. [2022-04-15 06:45:31,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 108 transitions. [2022-04-15 06:45:32,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:45:32,047 INFO L225 Difference]: With dead ends: 332 [2022-04-15 06:45:32,047 INFO L226 Difference]: Without dead ends: 305 [2022-04-15 06:45:32,047 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=358, Invalid=2192, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 06:45:32,048 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 116 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:45:32,048 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 65 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 06:45:32,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-04-15 06:45:33,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 160. [2022-04-15 06:45:33,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:45:33,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 305 states. Second operand has 160 states, 155 states have (on average 1.3870967741935485) internal successors, (215), 155 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:45:33,515 INFO L74 IsIncluded]: Start isIncluded. First operand 305 states. Second operand has 160 states, 155 states have (on average 1.3870967741935485) internal successors, (215), 155 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:45:33,516 INFO L87 Difference]: Start difference. First operand 305 states. Second operand has 160 states, 155 states have (on average 1.3870967741935485) internal successors, (215), 155 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:45:33,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:33,521 INFO L93 Difference]: Finished difference Result 305 states and 428 transitions. [2022-04-15 06:45:33,521 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 428 transitions. [2022-04-15 06:45:33,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:45:33,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:45:33,522 INFO L74 IsIncluded]: Start isIncluded. First operand has 160 states, 155 states have (on average 1.3870967741935485) internal successors, (215), 155 states have internal predecessors, (215), 3 states have call successors, (3), 3 states 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-15 06:45:33,522 INFO L87 Difference]: Start difference. First operand has 160 states, 155 states have (on average 1.3870967741935485) internal successors, (215), 155 states have internal predecessors, (215), 3 states have call successors, (3), 3 states 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-15 06:45:33,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:33,527 INFO L93 Difference]: Finished difference Result 305 states and 428 transitions. [2022-04-15 06:45:33,528 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 428 transitions. [2022-04-15 06:45:33,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:45:33,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:45:33,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:45:33,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:45:33,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 155 states have (on average 1.3870967741935485) internal successors, (215), 155 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:45:33,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 219 transitions. [2022-04-15 06:45:33,531 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 219 transitions. Word has length 37 [2022-04-15 06:45:33,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:45:33,531 INFO L478 AbstractCegarLoop]: Abstraction has 160 states and 219 transitions. [2022-04-15 06:45:33,531 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 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-15 06:45:33,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 160 states and 219 transitions. [2022-04-15 06:45:45,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 216 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 06:45:45,611 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 219 transitions. [2022-04-15 06:45:45,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 06:45:45,611 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:45:45,612 INFO L499 BasicCegarLoop]: trace histogram [8, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:45:45,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-04-15 06:45:45,812 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:45:45,812 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:45:45,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:45:45,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1797819389, now seen corresponding path program 18 times [2022-04-15 06:45:45,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:45:45,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2123432684] [2022-04-15 06:45:47,918 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:45:48,150 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-15 06:45:48,152 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:45:48,154 INFO L85 PathProgramCache]: Analyzing trace with hash -533849532, now seen corresponding path program 1 times [2022-04-15 06:45:48,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:45:48,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362235901] [2022-04-15 06:45:48,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:45:48,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:45:48,174 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-15 06:45:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:48,195 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-15 06:45:48,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:45:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:48,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {24352#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24337#true} is VALID [2022-04-15 06:45:48,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {24337#true} assume true; {24337#true} is VALID [2022-04-15 06:45:48,404 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24337#true} {24337#true} #83#return; {24337#true} is VALID [2022-04-15 06:45:48,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {24337#true} call ULTIMATE.init(); {24352#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:45:48,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {24352#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24337#true} is VALID [2022-04-15 06:45:48,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {24337#true} assume true; {24337#true} is VALID [2022-04-15 06:45:48,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24337#true} {24337#true} #83#return; {24337#true} is VALID [2022-04-15 06:45:48,404 INFO L272 TraceCheckUtils]: 4: Hoare triple {24337#true} call #t~ret15 := main(); {24337#true} is VALID [2022-04-15 06:45:48,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {24337#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24337#true} is VALID [2022-04-15 06:45:48,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {24337#true} [145] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_504 v_main_~y~0_503)) (.cse1 (= |v_main_#t~post6_144| |v_main_#t~post6_143|)) (.cse2 (= v_main_~x~0_393 v_main_~x~0_392)) (.cse3 (= |v_main_#t~post5_144| |v_main_#t~post5_143|)) (.cse4 (mod v_main_~x~0_393 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3) (and (< 0 .cse4) (= v_main_~y~0_503 (+ v_main_~x~0_393 (* v_main_~x~0_392 (- 1)) v_main_~y~0_504)) (< v_main_~x~0_392 v_main_~x~0_393) (forall ((v_it_30 Int)) (or (< 0 (mod (+ v_main_~x~0_393 (* 4294967295 v_it_30)) 4294967296)) (not (<= 1 v_it_30)) (not (<= (+ v_main_~x~0_392 v_it_30 1) v_main_~x~0_393))))))) InVars {main_~y~0=v_main_~y~0_504, main_#t~post5=|v_main_#t~post5_144|, main_~x~0=v_main_~x~0_393, main_#t~post6=|v_main_#t~post6_144|} OutVars{main_~y~0=v_main_~y~0_503, main_#t~post5=|v_main_#t~post5_143|, main_~x~0=v_main_~x~0_392, main_#t~post6=|v_main_#t~post6_143|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {24337#true} is VALID [2022-04-15 06:45:48,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {24337#true} [144] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {24342#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:45:48,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {24342#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {24342#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:45:48,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {24342#(<= 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; {24343#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:45:48,407 INFO L290 TraceCheckUtils]: 10: Hoare triple {24343#(<= 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; {24344#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:48,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {24344#(<= 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; {24345#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:48,409 INFO L290 TraceCheckUtils]: 12: Hoare triple {24345#(<= 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; {24346#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:48,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {24346#(<= 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; {24347#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:45:48,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {24347#(<= 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; {24348#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:48,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {24348#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24349#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:48,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {24349#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24350#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:48,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {24350#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {24350#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:48,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {24350#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24350#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:48,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {24350#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24350#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:48,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {24350#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24350#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:48,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {24350#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24350#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:48,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {24350#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {24350#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:48,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {24350#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {24351#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 06:45:48,416 INFO L290 TraceCheckUtils]: 24: Hoare triple {24351#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {24338#false} is VALID [2022-04-15 06:45:48,416 INFO L290 TraceCheckUtils]: 25: Hoare triple {24338#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24338#false} is VALID [2022-04-15 06:45:48,416 INFO L290 TraceCheckUtils]: 26: Hoare triple {24338#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24338#false} is VALID [2022-04-15 06:45:48,416 INFO L290 TraceCheckUtils]: 27: Hoare triple {24338#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24338#false} is VALID [2022-04-15 06:45:48,416 INFO L290 TraceCheckUtils]: 28: Hoare triple {24338#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24338#false} is VALID [2022-04-15 06:45:48,416 INFO L290 TraceCheckUtils]: 29: Hoare triple {24338#false} assume !(~z~0 % 4294967296 > 0); {24338#false} is VALID [2022-04-15 06:45:48,416 INFO L272 TraceCheckUtils]: 30: Hoare triple {24338#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {24338#false} is VALID [2022-04-15 06:45:48,416 INFO L290 TraceCheckUtils]: 31: Hoare triple {24338#false} ~cond := #in~cond; {24338#false} is VALID [2022-04-15 06:45:48,416 INFO L290 TraceCheckUtils]: 32: Hoare triple {24338#false} assume 0 == ~cond; {24338#false} is VALID [2022-04-15 06:45:48,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {24338#false} assume !false; {24338#false} is VALID [2022-04-15 06:45:48,417 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-15 06:45:48,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:45:48,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362235901] [2022-04-15 06:45:48,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362235901] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:45:48,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617076496] [2022-04-15 06:45:48,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:45:48,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:45:48,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:45:48,418 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-15 06:45:48,420 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-15 06:45:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:48,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 06:45:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:48,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:45:48,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {24337#true} call ULTIMATE.init(); {24337#true} is VALID [2022-04-15 06:45:48,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {24337#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24337#true} is VALID [2022-04-15 06:45:48,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {24337#true} assume true; {24337#true} is VALID [2022-04-15 06:45:48,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24337#true} {24337#true} #83#return; {24337#true} is VALID [2022-04-15 06:45:48,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {24337#true} call #t~ret15 := main(); {24337#true} is VALID [2022-04-15 06:45:48,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {24337#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24337#true} is VALID [2022-04-15 06:45:48,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {24337#true} [145] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_504 v_main_~y~0_503)) (.cse1 (= |v_main_#t~post6_144| |v_main_#t~post6_143|)) (.cse2 (= v_main_~x~0_393 v_main_~x~0_392)) (.cse3 (= |v_main_#t~post5_144| |v_main_#t~post5_143|)) (.cse4 (mod v_main_~x~0_393 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3) (and (< 0 .cse4) (= v_main_~y~0_503 (+ v_main_~x~0_393 (* v_main_~x~0_392 (- 1)) v_main_~y~0_504)) (< v_main_~x~0_392 v_main_~x~0_393) (forall ((v_it_30 Int)) (or (< 0 (mod (+ v_main_~x~0_393 (* 4294967295 v_it_30)) 4294967296)) (not (<= 1 v_it_30)) (not (<= (+ v_main_~x~0_392 v_it_30 1) v_main_~x~0_393))))))) InVars {main_~y~0=v_main_~y~0_504, main_#t~post5=|v_main_#t~post5_144|, main_~x~0=v_main_~x~0_393, main_#t~post6=|v_main_#t~post6_144|} OutVars{main_~y~0=v_main_~y~0_503, main_#t~post5=|v_main_#t~post5_143|, main_~x~0=v_main_~x~0_392, main_#t~post6=|v_main_#t~post6_143|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {24337#true} is VALID [2022-04-15 06:45:48,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {24337#true} [144] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {24337#true} is VALID [2022-04-15 06:45:48,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {24337#true} ~z~0 := ~y~0; {24380#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:45:48,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {24380#(= 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; {24384#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:45:48,816 INFO L290 TraceCheckUtils]: 10: Hoare triple {24384#(= 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; {24388#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-15 06:45:48,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {24388#(= 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; {24392#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-15 06:45:48,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {24392#(= (+ (- 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; {24396#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} is VALID [2022-04-15 06:45:48,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {24396#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24400#(= (+ (- 2) main_~y~0) (+ main_~z~0 3))} is VALID [2022-04-15 06:45:48,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {24400#(= (+ (- 2) main_~y~0) (+ main_~z~0 3))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24404#(= (+ main_~y~0 (- 5)) (+ main_~z~0 1))} is VALID [2022-04-15 06:45:48,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {24404#(= (+ main_~y~0 (- 5)) (+ 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; {24408#(= (+ main_~z~0 2) (+ main_~y~0 (- 5)))} is VALID [2022-04-15 06:45:48,820 INFO L290 TraceCheckUtils]: 16: Hoare triple {24408#(= (+ main_~z~0 2) (+ main_~y~0 (- 5)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24412#(= (+ main_~y~0 (- 5)) (+ main_~z~0 3))} is VALID [2022-04-15 06:45:48,820 INFO L290 TraceCheckUtils]: 17: Hoare triple {24412#(= (+ main_~y~0 (- 5)) (+ main_~z~0 3))} assume !(~z~0 % 4294967296 > 0); {24412#(= (+ main_~y~0 (- 5)) (+ main_~z~0 3))} is VALID [2022-04-15 06:45:48,821 INFO L290 TraceCheckUtils]: 18: Hoare triple {24412#(= (+ main_~y~0 (- 5)) (+ 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; {24404#(= (+ main_~y~0 (- 5)) (+ main_~z~0 1))} is VALID [2022-04-15 06:45:48,821 INFO L290 TraceCheckUtils]: 19: Hoare triple {24404#(= (+ main_~y~0 (- 5)) (+ 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; {24396#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} is VALID [2022-04-15 06:45:48,822 INFO L290 TraceCheckUtils]: 20: Hoare triple {24396#(= (+ (- 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; {24388#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-15 06:45:48,822 INFO L290 TraceCheckUtils]: 21: Hoare triple {24388#(= 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; {24380#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:45:48,823 INFO L290 TraceCheckUtils]: 22: Hoare triple {24380#(= main_~z~0 main_~y~0)} assume !(~y~0 % 4294967296 > 0); {24431#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 06:45:48,823 INFO L290 TraceCheckUtils]: 23: Hoare triple {24431#(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; {24431#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 06:45:48,823 INFO L290 TraceCheckUtils]: 24: Hoare triple {24431#(not (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {24431#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 06:45:48,824 INFO L290 TraceCheckUtils]: 25: Hoare triple {24431#(not (< 0 (mod main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24338#false} is VALID [2022-04-15 06:45:48,824 INFO L290 TraceCheckUtils]: 26: Hoare triple {24338#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24338#false} is VALID [2022-04-15 06:45:48,824 INFO L290 TraceCheckUtils]: 27: Hoare triple {24338#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24338#false} is VALID [2022-04-15 06:45:48,824 INFO L290 TraceCheckUtils]: 28: Hoare triple {24338#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24338#false} is VALID [2022-04-15 06:45:48,824 INFO L290 TraceCheckUtils]: 29: Hoare triple {24338#false} assume !(~z~0 % 4294967296 > 0); {24338#false} is VALID [2022-04-15 06:45:48,824 INFO L272 TraceCheckUtils]: 30: Hoare triple {24338#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {24338#false} is VALID [2022-04-15 06:45:48,824 INFO L290 TraceCheckUtils]: 31: Hoare triple {24338#false} ~cond := #in~cond; {24338#false} is VALID [2022-04-15 06:45:48,824 INFO L290 TraceCheckUtils]: 32: Hoare triple {24338#false} assume 0 == ~cond; {24338#false} is VALID [2022-04-15 06:45:48,824 INFO L290 TraceCheckUtils]: 33: Hoare triple {24338#false} assume !false; {24338#false} is VALID [2022-04-15 06:45:48,824 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 4 proven. 46 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:45:48,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:45:49,547 INFO L290 TraceCheckUtils]: 33: Hoare triple {24338#false} assume !false; {24338#false} is VALID [2022-04-15 06:45:49,547 INFO L290 TraceCheckUtils]: 32: Hoare triple {24338#false} assume 0 == ~cond; {24338#false} is VALID [2022-04-15 06:45:49,547 INFO L290 TraceCheckUtils]: 31: Hoare triple {24338#false} ~cond := #in~cond; {24338#false} is VALID [2022-04-15 06:45:49,547 INFO L272 TraceCheckUtils]: 30: Hoare triple {24338#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {24338#false} is VALID [2022-04-15 06:45:49,547 INFO L290 TraceCheckUtils]: 29: Hoare triple {24338#false} assume !(~z~0 % 4294967296 > 0); {24338#false} is VALID [2022-04-15 06:45:49,547 INFO L290 TraceCheckUtils]: 28: Hoare triple {24338#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24338#false} is VALID [2022-04-15 06:45:49,547 INFO L290 TraceCheckUtils]: 27: Hoare triple {24338#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24338#false} is VALID [2022-04-15 06:45:49,547 INFO L290 TraceCheckUtils]: 26: Hoare triple {24338#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24338#false} is VALID [2022-04-15 06:45:49,548 INFO L290 TraceCheckUtils]: 25: Hoare triple {24431#(not (< 0 (mod main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24338#false} is VALID [2022-04-15 06:45:49,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {24431#(not (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {24431#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 06:45:49,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {24431#(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; {24431#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 06:45:49,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {24498#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {24431#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 06:45:49,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {24502#(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; {24498#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:45:49,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {24506#(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; {24502#(or (not (< 0 (mod (+ main_~z~0 1) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:45:49,552 INFO L290 TraceCheckUtils]: 19: Hoare triple {24510#(or (not (< 0 (mod (+ 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; {24506#(or (not (< 0 (mod (+ main_~z~0 2) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-15 06:45:49,553 INFO L290 TraceCheckUtils]: 18: Hoare triple {24514#(or (not (< 0 (mod (+ main_~z~0 4) 4294967296))) (< 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; {24510#(or (not (< 0 (mod (+ main_~z~0 3) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:45:49,553 INFO L290 TraceCheckUtils]: 17: Hoare triple {24514#(or (not (< 0 (mod (+ main_~z~0 4) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {24514#(or (not (< 0 (mod (+ main_~z~0 4) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:45:49,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {24521#(or (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (not (< 0 (mod (+ main_~z~0 3) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24514#(or (not (< 0 (mod (+ main_~z~0 4) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:45:49,555 INFO L290 TraceCheckUtils]: 15: Hoare triple {24525#(or (not (< 0 (mod (+ main_~z~0 2) 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; {24521#(or (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (not (< 0 (mod (+ main_~z~0 3) 4294967296))))} is VALID [2022-04-15 06:45:49,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {24529#(or (not (< 0 (mod (+ main_~z~0 1) 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; {24525#(or (not (< 0 (mod (+ main_~z~0 2) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:45:49,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {24533#(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; {24529#(or (not (< 0 (mod (+ main_~z~0 1) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:45:49,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {24537#(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; {24533#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:45:49,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {24541#(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; {24537#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:45:49,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {24545#(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; {24541#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:45:49,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {24549#(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; {24545#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:45:49,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {24337#true} ~z~0 := ~y~0; {24549#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:45:49,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {24337#true} [144] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {24337#true} is VALID [2022-04-15 06:45:49,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {24337#true} [145] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_504 v_main_~y~0_503)) (.cse1 (= |v_main_#t~post6_144| |v_main_#t~post6_143|)) (.cse2 (= v_main_~x~0_393 v_main_~x~0_392)) (.cse3 (= |v_main_#t~post5_144| |v_main_#t~post5_143|)) (.cse4 (mod v_main_~x~0_393 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3) (and (< 0 .cse4) (= v_main_~y~0_503 (+ v_main_~x~0_393 (* v_main_~x~0_392 (- 1)) v_main_~y~0_504)) (< v_main_~x~0_392 v_main_~x~0_393) (forall ((v_it_30 Int)) (or (< 0 (mod (+ v_main_~x~0_393 (* 4294967295 v_it_30)) 4294967296)) (not (<= 1 v_it_30)) (not (<= (+ v_main_~x~0_392 v_it_30 1) v_main_~x~0_393))))))) InVars {main_~y~0=v_main_~y~0_504, main_#t~post5=|v_main_#t~post5_144|, main_~x~0=v_main_~x~0_393, main_#t~post6=|v_main_#t~post6_144|} OutVars{main_~y~0=v_main_~y~0_503, main_#t~post5=|v_main_#t~post5_143|, main_~x~0=v_main_~x~0_392, main_#t~post6=|v_main_#t~post6_143|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {24337#true} is VALID [2022-04-15 06:45:49,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {24337#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24337#true} is VALID [2022-04-15 06:45:49,562 INFO L272 TraceCheckUtils]: 4: Hoare triple {24337#true} call #t~ret15 := main(); {24337#true} is VALID [2022-04-15 06:45:49,562 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24337#true} {24337#true} #83#return; {24337#true} is VALID [2022-04-15 06:45:49,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {24337#true} assume true; {24337#true} is VALID [2022-04-15 06:45:49,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {24337#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24337#true} is VALID [2022-04-15 06:45:49,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {24337#true} call ULTIMATE.init(); {24337#true} is VALID [2022-04-15 06:45:49,563 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 4 proven. 46 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:45:49,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617076496] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:45:49,563 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:45:49,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 16] total 36 [2022-04-15 06:45:50,114 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:45:50,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2123432684] [2022-04-15 06:45:50,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2123432684] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:45:50,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:45:50,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 06:45:50,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64413163] [2022-04-15 06:45:50,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:45:50,114 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-15 06:45:50,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:45:50,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:45:50,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:45:50,157 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 06:45:50,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:45:50,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 06:45:50,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1489, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 06:45:50,158 INFO L87 Difference]: Start difference. First operand 160 states and 219 transitions. Second operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:45:56,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:56,718 INFO L93 Difference]: Finished difference Result 352 states and 534 transitions. [2022-04-15 06:45:56,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 06:45:56,718 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-15 06:45:56,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:45:56,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:45:56,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 113 transitions. [2022-04-15 06:45:56,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:45:56,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 113 transitions. [2022-04-15 06:45:56,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 113 transitions. [2022-04-15 06:45:56,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:45:56,965 INFO L225 Difference]: With dead ends: 352 [2022-04-15 06:45:56,965 INFO L226 Difference]: Without dead ends: 325 [2022-04-15 06:45:56,966 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=400, Invalid=3260, Unknown=0, NotChecked=0, Total=3660 [2022-04-15 06:45:56,966 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 117 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:45:56,966 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 58 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 06:45:56,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-04-15 06:45:58,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 175. [2022-04-15 06:45:58,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:45:58,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 325 states. Second operand has 175 states, 170 states have (on average 1.388235294117647) internal successors, (236), 170 states have internal predecessors, (236), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:45:58,648 INFO L74 IsIncluded]: Start isIncluded. First operand 325 states. Second operand has 175 states, 170 states have (on average 1.388235294117647) internal successors, (236), 170 states have internal predecessors, (236), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:45:58,648 INFO L87 Difference]: Start difference. First operand 325 states. Second operand has 175 states, 170 states have (on average 1.388235294117647) internal successors, (236), 170 states have internal predecessors, (236), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:45:58,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:58,654 INFO L93 Difference]: Finished difference Result 325 states and 454 transitions. [2022-04-15 06:45:58,654 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 454 transitions. [2022-04-15 06:45:58,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:45:58,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:45:58,654 INFO L74 IsIncluded]: Start isIncluded. First operand has 175 states, 170 states have (on average 1.388235294117647) internal successors, (236), 170 states have internal predecessors, (236), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 325 states. [2022-04-15 06:45:58,655 INFO L87 Difference]: Start difference. First operand has 175 states, 170 states have (on average 1.388235294117647) internal successors, (236), 170 states have internal predecessors, (236), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 325 states. [2022-04-15 06:45:58,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:58,660 INFO L93 Difference]: Finished difference Result 325 states and 454 transitions. [2022-04-15 06:45:58,660 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 454 transitions. [2022-04-15 06:45:58,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:45:58,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:45:58,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:45:58,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:45:58,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 170 states have (on average 1.388235294117647) internal successors, (236), 170 states have internal predecessors, (236), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:45:58,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 240 transitions. [2022-04-15 06:45:58,664 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 240 transitions. Word has length 38 [2022-04-15 06:45:58,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:45:58,664 INFO L478 AbstractCegarLoop]: Abstraction has 175 states and 240 transitions. [2022-04-15 06:45:58,664 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:45:58,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 175 states and 240 transitions. [2022-04-15 06:46:11,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 237 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 06:46:11,692 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 240 transitions. [2022-04-15 06:46:11,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 06:46:11,692 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:46:11,692 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:46:11,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-04-15 06:46:11,893 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:46:11,893 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:46:11,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:46:11,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1630133039, now seen corresponding path program 19 times [2022-04-15 06:46:11,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:46:11,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1562333919] [2022-04-15 06:46:12,177 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:46:12,179 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:46:12,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1259744050, now seen corresponding path program 1 times [2022-04-15 06:46:12,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:46:12,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739702824] [2022-04-15 06:46:12,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:46:12,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:46:12,195 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-15 06:46:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:12,224 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-15 06:46:12,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:46:12,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:12,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {26343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26328#true} is VALID [2022-04-15 06:46:12,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {26328#true} assume true; {26328#true} is VALID [2022-04-15 06:46:12,431 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26328#true} {26328#true} #83#return; {26328#true} is VALID [2022-04-15 06:46:12,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {26328#true} call ULTIMATE.init(); {26343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:46:12,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {26343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26328#true} is VALID [2022-04-15 06:46:12,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {26328#true} assume true; {26328#true} is VALID [2022-04-15 06:46:12,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26328#true} {26328#true} #83#return; {26328#true} is VALID [2022-04-15 06:46:12,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {26328#true} call #t~ret15 := main(); {26328#true} is VALID [2022-04-15 06:46:12,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {26328#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26328#true} is VALID [2022-04-15 06:46:12,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {26328#true} [147] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_413 v_main_~x~0_412)) (.cse1 (= |v_main_#t~post5_149| |v_main_#t~post5_148|)) (.cse2 (= v_main_~y~0_528 v_main_~y~0_527)) (.cse4 (mod v_main_~x~0_413 4294967296)) (.cse3 (= |v_main_#t~post6_149| |v_main_#t~post6_148|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_31 Int)) (or (not (<= 1 v_it_31)) (not (<= (+ v_main_~y~0_528 v_it_31 1) v_main_~y~0_527)) (< 0 (mod (+ v_main_~x~0_413 (* 4294967295 v_it_31)) 4294967296)))) (= v_main_~x~0_412 (+ v_main_~x~0_413 v_main_~y~0_528 (* (- 1) v_main_~y~0_527))) (< v_main_~y~0_528 v_main_~y~0_527) (< 0 .cse4)) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3))) InVars {main_~y~0=v_main_~y~0_528, main_#t~post5=|v_main_#t~post5_149|, main_~x~0=v_main_~x~0_413, main_#t~post6=|v_main_#t~post6_149|} OutVars{main_~y~0=v_main_~y~0_527, main_#t~post5=|v_main_#t~post5_148|, main_~x~0=v_main_~x~0_412, main_#t~post6=|v_main_#t~post6_148|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {26328#true} is VALID [2022-04-15 06:46:12,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {26328#true} [146] 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[] {26328#true} is VALID [2022-04-15 06:46:12,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {26328#true} ~z~0 := ~y~0; {26333#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:46:12,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {26333#(= (+ 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; {26334#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:46:12,434 INFO L290 TraceCheckUtils]: 10: Hoare triple {26334#(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; {26335#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:46:12,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {26335#(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; {26336#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:46:12,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {26336#(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; {26337#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:46:12,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {26337#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26338#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 06:46:12,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {26338#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !(~z~0 % 4294967296 > 0); {26338#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 06:46:12,439 INFO L290 TraceCheckUtils]: 15: Hoare triple {26338#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26339#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:46:12,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {26339#(<= 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; {26340#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:46:12,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {26340#(<= 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; {26341#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:46:12,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {26341#(<= 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; {26342#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:46:12,443 INFO L290 TraceCheckUtils]: 19: Hoare triple {26342#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {26329#false} is VALID [2022-04-15 06:46:12,443 INFO L290 TraceCheckUtils]: 20: Hoare triple {26329#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; {26329#false} is VALID [2022-04-15 06:46:12,443 INFO L290 TraceCheckUtils]: 21: Hoare triple {26329#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; {26329#false} is VALID [2022-04-15 06:46:12,443 INFO L290 TraceCheckUtils]: 22: Hoare triple {26329#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; {26329#false} is VALID [2022-04-15 06:46:12,443 INFO L290 TraceCheckUtils]: 23: Hoare triple {26329#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; {26329#false} is VALID [2022-04-15 06:46:12,443 INFO L290 TraceCheckUtils]: 24: Hoare triple {26329#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; {26329#false} is VALID [2022-04-15 06:46:12,444 INFO L290 TraceCheckUtils]: 25: Hoare triple {26329#false} assume !(~x~0 % 4294967296 > 0); {26329#false} is VALID [2022-04-15 06:46:12,444 INFO L290 TraceCheckUtils]: 26: Hoare triple {26329#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26329#false} is VALID [2022-04-15 06:46:12,444 INFO L290 TraceCheckUtils]: 27: Hoare triple {26329#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26329#false} is VALID [2022-04-15 06:46:12,444 INFO L290 TraceCheckUtils]: 28: Hoare triple {26329#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26329#false} is VALID [2022-04-15 06:46:12,444 INFO L290 TraceCheckUtils]: 29: Hoare triple {26329#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26329#false} is VALID [2022-04-15 06:46:12,444 INFO L290 TraceCheckUtils]: 30: Hoare triple {26329#false} assume !(~z~0 % 4294967296 > 0); {26329#false} is VALID [2022-04-15 06:46:12,444 INFO L272 TraceCheckUtils]: 31: Hoare triple {26329#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {26329#false} is VALID [2022-04-15 06:46:12,444 INFO L290 TraceCheckUtils]: 32: Hoare triple {26329#false} ~cond := #in~cond; {26329#false} is VALID [2022-04-15 06:46:12,444 INFO L290 TraceCheckUtils]: 33: Hoare triple {26329#false} assume 0 == ~cond; {26329#false} is VALID [2022-04-15 06:46:12,444 INFO L290 TraceCheckUtils]: 34: Hoare triple {26329#false} assume !false; {26329#false} is VALID [2022-04-15 06:46:12,445 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 06:46:12,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:46:12,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739702824] [2022-04-15 06:46:12,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739702824] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:46:12,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482610468] [2022-04-15 06:46:12,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:46:12,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:46:12,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:46:12,447 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-15 06:46:12,471 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-15 06:46:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:12,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 06:46:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:12,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:46:13,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {26328#true} call ULTIMATE.init(); {26328#true} is VALID [2022-04-15 06:46:13,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {26328#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26328#true} is VALID [2022-04-15 06:46:13,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {26328#true} assume true; {26328#true} is VALID [2022-04-15 06:46:13,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26328#true} {26328#true} #83#return; {26328#true} is VALID [2022-04-15 06:46:13,107 INFO L272 TraceCheckUtils]: 4: Hoare triple {26328#true} call #t~ret15 := main(); {26328#true} is VALID [2022-04-15 06:46:13,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {26328#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26328#true} is VALID [2022-04-15 06:46:13,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {26328#true} [147] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_413 v_main_~x~0_412)) (.cse1 (= |v_main_#t~post5_149| |v_main_#t~post5_148|)) (.cse2 (= v_main_~y~0_528 v_main_~y~0_527)) (.cse4 (mod v_main_~x~0_413 4294967296)) (.cse3 (= |v_main_#t~post6_149| |v_main_#t~post6_148|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_31 Int)) (or (not (<= 1 v_it_31)) (not (<= (+ v_main_~y~0_528 v_it_31 1) v_main_~y~0_527)) (< 0 (mod (+ v_main_~x~0_413 (* 4294967295 v_it_31)) 4294967296)))) (= v_main_~x~0_412 (+ v_main_~x~0_413 v_main_~y~0_528 (* (- 1) v_main_~y~0_527))) (< v_main_~y~0_528 v_main_~y~0_527) (< 0 .cse4)) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3))) InVars {main_~y~0=v_main_~y~0_528, main_#t~post5=|v_main_#t~post5_149|, main_~x~0=v_main_~x~0_413, main_#t~post6=|v_main_#t~post6_149|} OutVars{main_~y~0=v_main_~y~0_527, main_#t~post5=|v_main_#t~post5_148|, main_~x~0=v_main_~x~0_412, main_#t~post6=|v_main_#t~post6_148|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {26328#true} is VALID [2022-04-15 06:46:13,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {26328#true} [146] 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[] {26328#true} is VALID [2022-04-15 06:46:13,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {26328#true} ~z~0 := ~y~0; {26333#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:46:13,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {26333#(= (+ 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; {26334#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:46:13,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {26334#(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; {26335#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:46:13,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {26335#(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; {26336#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:46:13,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {26336#(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; {26337#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:46:13,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {26337#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26338#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 06:46:13,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {26338#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !(~z~0 % 4294967296 > 0); {26338#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 06:46:13,113 INFO L290 TraceCheckUtils]: 15: Hoare triple {26338#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26339#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:46:13,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {26339#(<= 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; {26340#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:46:13,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {26340#(<= 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; {26341#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:46:13,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {26341#(<= 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; {26342#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:46:13,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {26342#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {26329#false} is VALID [2022-04-15 06:46:13,116 INFO L290 TraceCheckUtils]: 20: Hoare triple {26329#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; {26329#false} is VALID [2022-04-15 06:46:13,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {26329#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; {26329#false} is VALID [2022-04-15 06:46:13,116 INFO L290 TraceCheckUtils]: 22: Hoare triple {26329#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; {26329#false} is VALID [2022-04-15 06:46:13,116 INFO L290 TraceCheckUtils]: 23: Hoare triple {26329#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; {26329#false} is VALID [2022-04-15 06:46:13,116 INFO L290 TraceCheckUtils]: 24: Hoare triple {26329#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; {26329#false} is VALID [2022-04-15 06:46:13,116 INFO L290 TraceCheckUtils]: 25: Hoare triple {26329#false} assume !(~x~0 % 4294967296 > 0); {26329#false} is VALID [2022-04-15 06:46:13,116 INFO L290 TraceCheckUtils]: 26: Hoare triple {26329#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26329#false} is VALID [2022-04-15 06:46:13,116 INFO L290 TraceCheckUtils]: 27: Hoare triple {26329#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26329#false} is VALID [2022-04-15 06:46:13,116 INFO L290 TraceCheckUtils]: 28: Hoare triple {26329#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26329#false} is VALID [2022-04-15 06:46:13,116 INFO L290 TraceCheckUtils]: 29: Hoare triple {26329#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26329#false} is VALID [2022-04-15 06:46:13,117 INFO L290 TraceCheckUtils]: 30: Hoare triple {26329#false} assume !(~z~0 % 4294967296 > 0); {26329#false} is VALID [2022-04-15 06:46:13,117 INFO L272 TraceCheckUtils]: 31: Hoare triple {26329#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {26329#false} is VALID [2022-04-15 06:46:13,117 INFO L290 TraceCheckUtils]: 32: Hoare triple {26329#false} ~cond := #in~cond; {26329#false} is VALID [2022-04-15 06:46:13,117 INFO L290 TraceCheckUtils]: 33: Hoare triple {26329#false} assume 0 == ~cond; {26329#false} is VALID [2022-04-15 06:46:13,117 INFO L290 TraceCheckUtils]: 34: Hoare triple {26329#false} assume !false; {26329#false} is VALID [2022-04-15 06:46:13,117 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 06:46:13,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:46:13,561 INFO L290 TraceCheckUtils]: 34: Hoare triple {26329#false} assume !false; {26329#false} is VALID [2022-04-15 06:46:13,561 INFO L290 TraceCheckUtils]: 33: Hoare triple {26329#false} assume 0 == ~cond; {26329#false} is VALID [2022-04-15 06:46:13,561 INFO L290 TraceCheckUtils]: 32: Hoare triple {26329#false} ~cond := #in~cond; {26329#false} is VALID [2022-04-15 06:46:13,561 INFO L272 TraceCheckUtils]: 31: Hoare triple {26329#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {26329#false} is VALID [2022-04-15 06:46:13,561 INFO L290 TraceCheckUtils]: 30: Hoare triple {26329#false} assume !(~z~0 % 4294967296 > 0); {26329#false} is VALID [2022-04-15 06:46:13,561 INFO L290 TraceCheckUtils]: 29: Hoare triple {26329#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26329#false} is VALID [2022-04-15 06:46:13,561 INFO L290 TraceCheckUtils]: 28: Hoare triple {26329#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26329#false} is VALID [2022-04-15 06:46:13,561 INFO L290 TraceCheckUtils]: 27: Hoare triple {26329#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26329#false} is VALID [2022-04-15 06:46:13,561 INFO L290 TraceCheckUtils]: 26: Hoare triple {26329#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26329#false} is VALID [2022-04-15 06:46:13,562 INFO L290 TraceCheckUtils]: 25: Hoare triple {26329#false} assume !(~x~0 % 4294967296 > 0); {26329#false} is VALID [2022-04-15 06:46:13,562 INFO L290 TraceCheckUtils]: 24: Hoare triple {26329#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; {26329#false} is VALID [2022-04-15 06:46:13,562 INFO L290 TraceCheckUtils]: 23: Hoare triple {26329#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; {26329#false} is VALID [2022-04-15 06:46:13,562 INFO L290 TraceCheckUtils]: 22: Hoare triple {26329#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; {26329#false} is VALID [2022-04-15 06:46:13,562 INFO L290 TraceCheckUtils]: 21: Hoare triple {26329#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; {26329#false} is VALID [2022-04-15 06:46:13,562 INFO L290 TraceCheckUtils]: 20: Hoare triple {26329#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; {26329#false} is VALID [2022-04-15 06:46:13,562 INFO L290 TraceCheckUtils]: 19: Hoare triple {26342#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {26329#false} is VALID [2022-04-15 06:46:13,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {26341#(<= 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; {26342#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:46:13,565 INFO L290 TraceCheckUtils]: 17: Hoare triple {26340#(<= 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; {26341#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:46:13,566 INFO L290 TraceCheckUtils]: 16: Hoare triple {26339#(<= 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; {26340#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:46:13,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {26338#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26339#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:46:13,567 INFO L290 TraceCheckUtils]: 14: Hoare triple {26338#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !(~z~0 % 4294967296 > 0); {26338#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 06:46:13,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {26512#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26338#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 06:46:13,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {26516#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26512#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 06:46:13,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {26520#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26516#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)))} is VALID [2022-04-15 06:46:13,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {26524#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26520#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-15 06:46:13,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {26528#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26524#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} is VALID [2022-04-15 06:46:13,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {26328#true} ~z~0 := ~y~0; {26528#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-15 06:46:13,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {26328#true} [146] 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[] {26328#true} is VALID [2022-04-15 06:46:13,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {26328#true} [147] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_413 v_main_~x~0_412)) (.cse1 (= |v_main_#t~post5_149| |v_main_#t~post5_148|)) (.cse2 (= v_main_~y~0_528 v_main_~y~0_527)) (.cse4 (mod v_main_~x~0_413 4294967296)) (.cse3 (= |v_main_#t~post6_149| |v_main_#t~post6_148|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_31 Int)) (or (not (<= 1 v_it_31)) (not (<= (+ v_main_~y~0_528 v_it_31 1) v_main_~y~0_527)) (< 0 (mod (+ v_main_~x~0_413 (* 4294967295 v_it_31)) 4294967296)))) (= v_main_~x~0_412 (+ v_main_~x~0_413 v_main_~y~0_528 (* (- 1) v_main_~y~0_527))) (< v_main_~y~0_528 v_main_~y~0_527) (< 0 .cse4)) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3))) InVars {main_~y~0=v_main_~y~0_528, main_#t~post5=|v_main_#t~post5_149|, main_~x~0=v_main_~x~0_413, main_#t~post6=|v_main_#t~post6_149|} OutVars{main_~y~0=v_main_~y~0_527, main_#t~post5=|v_main_#t~post5_148|, main_~x~0=v_main_~x~0_412, main_#t~post6=|v_main_#t~post6_148|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {26328#true} is VALID [2022-04-15 06:46:13,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {26328#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26328#true} is VALID [2022-04-15 06:46:13,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {26328#true} call #t~ret15 := main(); {26328#true} is VALID [2022-04-15 06:46:13,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26328#true} {26328#true} #83#return; {26328#true} is VALID [2022-04-15 06:46:13,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {26328#true} assume true; {26328#true} is VALID [2022-04-15 06:46:13,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {26328#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26328#true} is VALID [2022-04-15 06:46:13,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {26328#true} call ULTIMATE.init(); {26328#true} is VALID [2022-04-15 06:46:13,574 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 06:46:13,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482610468] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:46:13,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:46:13,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 18 [2022-04-15 06:46:13,943 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:46:13,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1562333919] [2022-04-15 06:46:13,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1562333919] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:46:13,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:46:13,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 06:46:13,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857434617] [2022-04-15 06:46:13,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:46:13,944 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-15 06:46:13,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:46:13,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:13,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:46:13,992 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 06:46:13,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:46:13,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 06:46:13,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-04-15 06:46:13,993 INFO L87 Difference]: Start difference. First operand 175 states and 240 transitions. Second operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:24,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:24,832 INFO L93 Difference]: Finished difference Result 307 states and 391 transitions. [2022-04-15 06:46:24,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 06:46:24,832 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-15 06:46:24,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:46:24,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:24,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 89 transitions. [2022-04-15 06:46:24,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:24,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 89 transitions. [2022-04-15 06:46:24,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 89 transitions. [2022-04-15 06:46:25,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:46:25,143 INFO L225 Difference]: With dead ends: 307 [2022-04-15 06:46:25,143 INFO L226 Difference]: Without dead ends: 281 [2022-04-15 06:46:25,143 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 78 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=487, Invalid=2269, Unknown=0, NotChecked=0, Total=2756 [2022-04-15 06:46:25,144 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 71 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:46:25,144 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 90 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 06:46:25,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-04-15 06:46:26,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 159. [2022-04-15 06:46:26,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:46:26,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 281 states. Second operand has 159 states, 154 states have (on average 1.3571428571428572) internal successors, (209), 154 states have internal predecessors, (209), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:26,758 INFO L74 IsIncluded]: Start isIncluded. First operand 281 states. Second operand has 159 states, 154 states have (on average 1.3571428571428572) internal successors, (209), 154 states have internal predecessors, (209), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:26,758 INFO L87 Difference]: Start difference. First operand 281 states. Second operand has 159 states, 154 states have (on average 1.3571428571428572) internal successors, (209), 154 states have internal predecessors, (209), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:26,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:26,761 INFO L93 Difference]: Finished difference Result 281 states and 355 transitions. [2022-04-15 06:46:26,761 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 355 transitions. [2022-04-15 06:46:26,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:46:26,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:46:26,762 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 154 states have (on average 1.3571428571428572) internal successors, (209), 154 states have internal predecessors, (209), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 281 states. [2022-04-15 06:46:26,762 INFO L87 Difference]: Start difference. First operand has 159 states, 154 states have (on average 1.3571428571428572) internal successors, (209), 154 states have internal predecessors, (209), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 281 states. [2022-04-15 06:46:26,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:26,765 INFO L93 Difference]: Finished difference Result 281 states and 355 transitions. [2022-04-15 06:46:26,765 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 355 transitions. [2022-04-15 06:46:26,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:46:26,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:46:26,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:46:26,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:46:26,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 154 states have (on average 1.3571428571428572) internal successors, (209), 154 states have internal predecessors, (209), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:26,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 213 transitions. [2022-04-15 06:46:26,768 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 213 transitions. Word has length 39 [2022-04-15 06:46:26,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:46:26,768 INFO L478 AbstractCegarLoop]: Abstraction has 159 states and 213 transitions. [2022-04-15 06:46:26,769 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:26,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 159 states and 213 transitions. [2022-04-15 06:46:41,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 211 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 06:46:41,805 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 213 transitions. [2022-04-15 06:46:41,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 06:46:41,806 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:46:41,806 INFO L499 BasicCegarLoop]: trace histogram [7, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:46:41,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-15 06:46:42,006 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:46:42,007 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:46:42,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:46:42,007 INFO L85 PathProgramCache]: Analyzing trace with hash -638241519, now seen corresponding path program 20 times [2022-04-15 06:46:42,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:46:42,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1698428386] [2022-04-15 06:46:42,202 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-15 06:46:42,204 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:46:42,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1643578992, now seen corresponding path program 1 times [2022-04-15 06:46:42,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:46:42,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048145701] [2022-04-15 06:46:42,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:46:42,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:46:42,216 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-15 06:46:42,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:42,242 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-15 06:46:42,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:46:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:42,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {28136#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28119#true} is VALID [2022-04-15 06:46:42,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {28119#true} assume true; {28119#true} is VALID [2022-04-15 06:46:42,472 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28119#true} {28119#true} #83#return; {28119#true} is VALID [2022-04-15 06:46:42,472 INFO L272 TraceCheckUtils]: 0: Hoare triple {28119#true} call ULTIMATE.init(); {28136#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:46:42,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {28136#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28119#true} is VALID [2022-04-15 06:46:42,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {28119#true} assume true; {28119#true} is VALID [2022-04-15 06:46:42,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28119#true} {28119#true} #83#return; {28119#true} is VALID [2022-04-15 06:46:42,473 INFO L272 TraceCheckUtils]: 4: Hoare triple {28119#true} call #t~ret15 := main(); {28119#true} is VALID [2022-04-15 06:46:42,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {28119#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28119#true} is VALID [2022-04-15 06:46:42,473 INFO L290 TraceCheckUtils]: 6: Hoare triple {28119#true} [149] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_434 4294967296)) (.cse1 (= |v_main_#t~post5_154| |v_main_#t~post5_153|)) (.cse2 (= |v_main_#t~post6_154| |v_main_#t~post6_153|)) (.cse3 (= v_main_~y~0_556 v_main_~y~0_555)) (.cse4 (= v_main_~x~0_434 v_main_~x~0_433))) (or (and (= v_main_~x~0_433 (+ v_main_~x~0_434 (* (- 1) v_main_~y~0_555) v_main_~y~0_556)) (< 0 .cse0) (forall ((v_it_32 Int)) (or (< 0 (mod (+ v_main_~x~0_434 (* 4294967295 v_it_32)) 4294967296)) (not (<= (+ v_main_~y~0_556 v_it_32 1) v_main_~y~0_555)) (not (<= 1 v_it_32)))) (< v_main_~y~0_556 v_main_~y~0_555)) (and .cse1 .cse2 .cse3 (<= .cse0 0) .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_556, main_#t~post5=|v_main_#t~post5_154|, main_~x~0=v_main_~x~0_434, main_#t~post6=|v_main_#t~post6_154|} OutVars{main_~y~0=v_main_~y~0_555, main_#t~post5=|v_main_#t~post5_153|, main_~x~0=v_main_~x~0_433, main_#t~post6=|v_main_#t~post6_153|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {28119#true} is VALID [2022-04-15 06:46:42,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {28119#true} [148] 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[] {28119#true} is VALID [2022-04-15 06:46:42,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {28119#true} ~z~0 := ~y~0; {28124#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:46:42,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {28124#(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; {28125#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:46:42,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {28125#(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; {28126#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:46:42,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {28126#(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; {28127#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:46:42,476 INFO L290 TraceCheckUtils]: 12: Hoare triple {28127#(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; {28128#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:46:42,476 INFO L290 TraceCheckUtils]: 13: Hoare triple {28128#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28129#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:46:42,477 INFO L290 TraceCheckUtils]: 14: Hoare triple {28129#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {28130#(and (<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 5 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:46:42,478 INFO L290 TraceCheckUtils]: 15: Hoare triple {28130#(and (<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 5 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28131#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:42,479 INFO L290 TraceCheckUtils]: 16: Hoare triple {28131#(<= main_~y~0 (+ 4 (* (div (+ main_~y~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; {28132#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:42,480 INFO L290 TraceCheckUtils]: 17: Hoare triple {28132#(<= 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; {28133#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:42,481 INFO L290 TraceCheckUtils]: 18: Hoare triple {28133#(<= 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; {28134#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:46:42,482 INFO L290 TraceCheckUtils]: 19: Hoare triple {28134#(<= 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; {28135#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:46:42,483 INFO L290 TraceCheckUtils]: 20: Hoare triple {28135#(<= 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; {28120#false} is VALID [2022-04-15 06:46:42,483 INFO L290 TraceCheckUtils]: 21: Hoare triple {28120#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28120#false} is VALID [2022-04-15 06:46:42,483 INFO L290 TraceCheckUtils]: 22: Hoare triple {28120#false} assume !(~y~0 % 4294967296 > 0); {28120#false} is VALID [2022-04-15 06:46:42,483 INFO L290 TraceCheckUtils]: 23: Hoare triple {28120#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; {28120#false} is VALID [2022-04-15 06:46:42,483 INFO L290 TraceCheckUtils]: 24: Hoare triple {28120#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; {28120#false} is VALID [2022-04-15 06:46:42,483 INFO L290 TraceCheckUtils]: 25: Hoare triple {28120#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; {28120#false} is VALID [2022-04-15 06:46:42,483 INFO L290 TraceCheckUtils]: 26: Hoare triple {28120#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; {28120#false} is VALID [2022-04-15 06:46:42,483 INFO L290 TraceCheckUtils]: 27: Hoare triple {28120#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; {28120#false} is VALID [2022-04-15 06:46:42,483 INFO L290 TraceCheckUtils]: 28: Hoare triple {28120#false} assume !(~x~0 % 4294967296 > 0); {28120#false} is VALID [2022-04-15 06:46:42,483 INFO L290 TraceCheckUtils]: 29: Hoare triple {28120#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28120#false} is VALID [2022-04-15 06:46:42,483 INFO L290 TraceCheckUtils]: 30: Hoare triple {28120#false} assume !(~z~0 % 4294967296 > 0); {28120#false} is VALID [2022-04-15 06:46:42,483 INFO L272 TraceCheckUtils]: 31: Hoare triple {28120#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {28120#false} is VALID [2022-04-15 06:46:42,483 INFO L290 TraceCheckUtils]: 32: Hoare triple {28120#false} ~cond := #in~cond; {28120#false} is VALID [2022-04-15 06:46:42,483 INFO L290 TraceCheckUtils]: 33: Hoare triple {28120#false} assume 0 == ~cond; {28120#false} is VALID [2022-04-15 06:46:42,483 INFO L290 TraceCheckUtils]: 34: Hoare triple {28120#false} assume !false; {28120#false} is VALID [2022-04-15 06:46:42,483 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-15 06:46:42,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:46:42,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048145701] [2022-04-15 06:46:42,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048145701] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:46:42,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277431021] [2022-04-15 06:46:42,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:46:42,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:46:42,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:46:42,485 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-15 06:46:42,486 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-15 06:46:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:42,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 06:46:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:42,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:46:42,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {28119#true} call ULTIMATE.init(); {28119#true} is VALID [2022-04-15 06:46:42,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {28119#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28119#true} is VALID [2022-04-15 06:46:42,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {28119#true} assume true; {28119#true} is VALID [2022-04-15 06:46:42,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28119#true} {28119#true} #83#return; {28119#true} is VALID [2022-04-15 06:46:42,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {28119#true} call #t~ret15 := main(); {28119#true} is VALID [2022-04-15 06:46:42,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {28119#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28119#true} is VALID [2022-04-15 06:46:42,937 INFO L290 TraceCheckUtils]: 6: Hoare triple {28119#true} [149] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_434 4294967296)) (.cse1 (= |v_main_#t~post5_154| |v_main_#t~post5_153|)) (.cse2 (= |v_main_#t~post6_154| |v_main_#t~post6_153|)) (.cse3 (= v_main_~y~0_556 v_main_~y~0_555)) (.cse4 (= v_main_~x~0_434 v_main_~x~0_433))) (or (and (= v_main_~x~0_433 (+ v_main_~x~0_434 (* (- 1) v_main_~y~0_555) v_main_~y~0_556)) (< 0 .cse0) (forall ((v_it_32 Int)) (or (< 0 (mod (+ v_main_~x~0_434 (* 4294967295 v_it_32)) 4294967296)) (not (<= (+ v_main_~y~0_556 v_it_32 1) v_main_~y~0_555)) (not (<= 1 v_it_32)))) (< v_main_~y~0_556 v_main_~y~0_555)) (and .cse1 .cse2 .cse3 (<= .cse0 0) .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_556, main_#t~post5=|v_main_#t~post5_154|, main_~x~0=v_main_~x~0_434, main_#t~post6=|v_main_#t~post6_154|} OutVars{main_~y~0=v_main_~y~0_555, main_#t~post5=|v_main_#t~post5_153|, main_~x~0=v_main_~x~0_433, main_#t~post6=|v_main_#t~post6_153|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {28119#true} is VALID [2022-04-15 06:46:42,937 INFO L290 TraceCheckUtils]: 7: Hoare triple {28119#true} [148] 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[] {28119#true} is VALID [2022-04-15 06:46:42,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {28119#true} ~z~0 := ~y~0; {28124#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:46:42,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {28124#(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; {28125#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:46:42,939 INFO L290 TraceCheckUtils]: 10: Hoare triple {28125#(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; {28126#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:46:42,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {28126#(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; {28127#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:46:42,940 INFO L290 TraceCheckUtils]: 12: Hoare triple {28127#(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; {28128#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:46:42,940 INFO L290 TraceCheckUtils]: 13: Hoare triple {28128#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28129#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:46:42,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {28129#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {28182#(<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296))} is VALID [2022-04-15 06:46:42,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {28182#(<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28131#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:42,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {28131#(<= main_~y~0 (+ 4 (* (div (+ main_~y~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; {28132#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:42,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {28132#(<= 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; {28133#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:42,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {28133#(<= 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; {28134#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:46:42,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {28134#(<= 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; {28135#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:46:42,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {28135#(<= 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; {28120#false} is VALID [2022-04-15 06:46:42,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {28120#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28120#false} is VALID [2022-04-15 06:46:42,947 INFO L290 TraceCheckUtils]: 22: Hoare triple {28120#false} assume !(~y~0 % 4294967296 > 0); {28120#false} is VALID [2022-04-15 06:46:42,947 INFO L290 TraceCheckUtils]: 23: Hoare triple {28120#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; {28120#false} is VALID [2022-04-15 06:46:42,947 INFO L290 TraceCheckUtils]: 24: Hoare triple {28120#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; {28120#false} is VALID [2022-04-15 06:46:42,947 INFO L290 TraceCheckUtils]: 25: Hoare triple {28120#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; {28120#false} is VALID [2022-04-15 06:46:42,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {28120#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; {28120#false} is VALID [2022-04-15 06:46:42,947 INFO L290 TraceCheckUtils]: 27: Hoare triple {28120#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; {28120#false} is VALID [2022-04-15 06:46:42,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {28120#false} assume !(~x~0 % 4294967296 > 0); {28120#false} is VALID [2022-04-15 06:46:42,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {28120#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28120#false} is VALID [2022-04-15 06:46:42,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {28120#false} assume !(~z~0 % 4294967296 > 0); {28120#false} is VALID [2022-04-15 06:46:42,947 INFO L272 TraceCheckUtils]: 31: Hoare triple {28120#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {28120#false} is VALID [2022-04-15 06:46:42,948 INFO L290 TraceCheckUtils]: 32: Hoare triple {28120#false} ~cond := #in~cond; {28120#false} is VALID [2022-04-15 06:46:42,948 INFO L290 TraceCheckUtils]: 33: Hoare triple {28120#false} assume 0 == ~cond; {28120#false} is VALID [2022-04-15 06:46:42,948 INFO L290 TraceCheckUtils]: 34: Hoare triple {28120#false} assume !false; {28120#false} is VALID [2022-04-15 06:46:42,948 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-15 06:46:42,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:46:43,658 INFO L290 TraceCheckUtils]: 34: Hoare triple {28120#false} assume !false; {28120#false} is VALID [2022-04-15 06:46:43,659 INFO L290 TraceCheckUtils]: 33: Hoare triple {28120#false} assume 0 == ~cond; {28120#false} is VALID [2022-04-15 06:46:43,659 INFO L290 TraceCheckUtils]: 32: Hoare triple {28120#false} ~cond := #in~cond; {28120#false} is VALID [2022-04-15 06:46:43,659 INFO L272 TraceCheckUtils]: 31: Hoare triple {28120#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {28120#false} is VALID [2022-04-15 06:46:43,659 INFO L290 TraceCheckUtils]: 30: Hoare triple {28120#false} assume !(~z~0 % 4294967296 > 0); {28120#false} is VALID [2022-04-15 06:46:43,659 INFO L290 TraceCheckUtils]: 29: Hoare triple {28120#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28120#false} is VALID [2022-04-15 06:46:43,659 INFO L290 TraceCheckUtils]: 28: Hoare triple {28120#false} assume !(~x~0 % 4294967296 > 0); {28120#false} is VALID [2022-04-15 06:46:43,659 INFO L290 TraceCheckUtils]: 27: Hoare triple {28120#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; {28120#false} is VALID [2022-04-15 06:46:43,659 INFO L290 TraceCheckUtils]: 26: Hoare triple {28120#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; {28120#false} is VALID [2022-04-15 06:46:43,659 INFO L290 TraceCheckUtils]: 25: Hoare triple {28120#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; {28120#false} is VALID [2022-04-15 06:46:43,659 INFO L290 TraceCheckUtils]: 24: Hoare triple {28120#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; {28120#false} is VALID [2022-04-15 06:46:43,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {28120#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; {28120#false} is VALID [2022-04-15 06:46:43,659 INFO L290 TraceCheckUtils]: 22: Hoare triple {28120#false} assume !(~y~0 % 4294967296 > 0); {28120#false} is VALID [2022-04-15 06:46:43,659 INFO L290 TraceCheckUtils]: 21: Hoare triple {28120#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28120#false} is VALID [2022-04-15 06:46:43,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {28135#(<= 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; {28120#false} is VALID [2022-04-15 06:46:43,661 INFO L290 TraceCheckUtils]: 19: Hoare triple {28134#(<= 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; {28135#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:46:43,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {28133#(<= 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; {28134#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:46:43,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {28132#(<= 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; {28133#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:43,664 INFO L290 TraceCheckUtils]: 16: Hoare triple {28131#(<= main_~y~0 (+ 4 (* (div (+ main_~y~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; {28132#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:43,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {28182#(<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28131#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:43,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {28303#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {28182#(<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296))} is VALID [2022-04-15 06:46:43,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {28307#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28303#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} is VALID [2022-04-15 06:46:43,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {28311#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28307#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} is VALID [2022-04-15 06:46:43,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {28315#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28311#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} is VALID [2022-04-15 06:46:43,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {28319#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28315#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} is VALID [2022-04-15 06:46:43,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {28323#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28319#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} is VALID [2022-04-15 06:46:43,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {28119#true} ~z~0 := ~y~0; {28323#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} is VALID [2022-04-15 06:46:43,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {28119#true} [148] 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[] {28119#true} is VALID [2022-04-15 06:46:43,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {28119#true} [149] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_434 4294967296)) (.cse1 (= |v_main_#t~post5_154| |v_main_#t~post5_153|)) (.cse2 (= |v_main_#t~post6_154| |v_main_#t~post6_153|)) (.cse3 (= v_main_~y~0_556 v_main_~y~0_555)) (.cse4 (= v_main_~x~0_434 v_main_~x~0_433))) (or (and (= v_main_~x~0_433 (+ v_main_~x~0_434 (* (- 1) v_main_~y~0_555) v_main_~y~0_556)) (< 0 .cse0) (forall ((v_it_32 Int)) (or (< 0 (mod (+ v_main_~x~0_434 (* 4294967295 v_it_32)) 4294967296)) (not (<= (+ v_main_~y~0_556 v_it_32 1) v_main_~y~0_555)) (not (<= 1 v_it_32)))) (< v_main_~y~0_556 v_main_~y~0_555)) (and .cse1 .cse2 .cse3 (<= .cse0 0) .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_556, main_#t~post5=|v_main_#t~post5_154|, main_~x~0=v_main_~x~0_434, main_#t~post6=|v_main_#t~post6_154|} OutVars{main_~y~0=v_main_~y~0_555, main_#t~post5=|v_main_#t~post5_153|, main_~x~0=v_main_~x~0_433, main_#t~post6=|v_main_#t~post6_153|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {28119#true} is VALID [2022-04-15 06:46:43,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {28119#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28119#true} is VALID [2022-04-15 06:46:43,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {28119#true} call #t~ret15 := main(); {28119#true} is VALID [2022-04-15 06:46:43,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28119#true} {28119#true} #83#return; {28119#true} is VALID [2022-04-15 06:46:43,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {28119#true} assume true; {28119#true} is VALID [2022-04-15 06:46:43,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {28119#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28119#true} is VALID [2022-04-15 06:46:43,672 INFO L272 TraceCheckUtils]: 0: Hoare triple {28119#true} call ULTIMATE.init(); {28119#true} is VALID [2022-04-15 06:46:43,672 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-15 06:46:43,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277431021] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:46:43,673 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:46:43,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 22 [2022-04-15 06:46:44,073 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:46:44,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1698428386] [2022-04-15 06:46:44,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1698428386] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:46:44,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:46:44,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 06:46:44,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177874121] [2022-04-15 06:46:44,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:46:44,074 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-15 06:46:44,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:46:44,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:44,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:46:44,116 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 06:46:44,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:46:44,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 06:46:44,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=622, Unknown=0, NotChecked=0, Total=702 [2022-04-15 06:46:44,117 INFO L87 Difference]: Start difference. First operand 159 states and 213 transitions. Second operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:52,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:52,380 INFO L93 Difference]: Finished difference Result 271 states and 335 transitions. [2022-04-15 06:46:52,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 06:46:52,380 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-15 06:46:52,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:46:52,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:52,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 73 transitions. [2022-04-15 06:46:52,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:52,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 73 transitions. [2022-04-15 06:46:52,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 73 transitions. [2022-04-15 06:46:52,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:46:52,571 INFO L225 Difference]: With dead ends: 271 [2022-04-15 06:46:52,571 INFO L226 Difference]: Without dead ends: 236 [2022-04-15 06:46:52,572 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 77 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=264, Invalid=2088, Unknown=0, NotChecked=0, Total=2352 [2022-04-15 06:46:52,572 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 48 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:46:52,572 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 87 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-15 06:46:52,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-04-15 06:46:54,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 156. [2022-04-15 06:46:54,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:46:54,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 236 states. Second operand has 156 states, 151 states have (on average 1.3377483443708609) internal successors, (202), 151 states have internal predecessors, (202), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:54,074 INFO L74 IsIncluded]: Start isIncluded. First operand 236 states. Second operand has 156 states, 151 states have (on average 1.3377483443708609) internal successors, (202), 151 states have internal predecessors, (202), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:54,075 INFO L87 Difference]: Start difference. First operand 236 states. Second operand has 156 states, 151 states have (on average 1.3377483443708609) internal successors, (202), 151 states have internal predecessors, (202), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:54,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:54,077 INFO L93 Difference]: Finished difference Result 236 states and 296 transitions. [2022-04-15 06:46:54,077 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 296 transitions. [2022-04-15 06:46:54,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:46:54,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:46:54,077 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 151 states have (on average 1.3377483443708609) internal successors, (202), 151 states have internal predecessors, (202), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 236 states. [2022-04-15 06:46:54,078 INFO L87 Difference]: Start difference. First operand has 156 states, 151 states have (on average 1.3377483443708609) internal successors, (202), 151 states have internal predecessors, (202), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 236 states. [2022-04-15 06:46:54,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:54,081 INFO L93 Difference]: Finished difference Result 236 states and 296 transitions. [2022-04-15 06:46:54,081 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 296 transitions. [2022-04-15 06:46:54,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:46:54,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:46:54,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:46:54,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:46:54,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 151 states have (on average 1.3377483443708609) internal successors, (202), 151 states have internal predecessors, (202), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:54,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 206 transitions. [2022-04-15 06:46:54,083 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 206 transitions. Word has length 39 [2022-04-15 06:46:54,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:46:54,083 INFO L478 AbstractCegarLoop]: Abstraction has 156 states and 206 transitions. [2022-04-15 06:46:54,083 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:54,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 156 states and 206 transitions. [2022-04-15 06:47:11,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 201 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-15 06:47:11,640 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 206 transitions. [2022-04-15 06:47:11,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 06:47:11,641 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:47:11,641 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:47:11,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-15 06:47:11,843 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-15 06:47:11,843 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:47:11,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:47:11,844 INFO L85 PathProgramCache]: Analyzing trace with hash -274625873, now seen corresponding path program 9 times [2022-04-15 06:47:11,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:47:11,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1417823424] [2022-04-15 06:47:15,966 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:47:16,082 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-15 06:47:16,083 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:47:16,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1411042354, now seen corresponding path program 1 times [2022-04-15 06:47:16,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:47:16,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307147320] [2022-04-15 06:47:16,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:47:16,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:47:16,097 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-15 06:47:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:47:16,117 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-15 06:47:16,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:47:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:47:16,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {29746#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29730#true} is VALID [2022-04-15 06:47:16,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {29730#true} assume true; {29730#true} is VALID [2022-04-15 06:47:16,354 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29730#true} {29730#true} #83#return; {29730#true} is VALID [2022-04-15 06:47:16,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {29730#true} call ULTIMATE.init(); {29746#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:47:16,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {29746#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29730#true} is VALID [2022-04-15 06:47:16,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {29730#true} assume true; {29730#true} is VALID [2022-04-15 06:47:16,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29730#true} {29730#true} #83#return; {29730#true} is VALID [2022-04-15 06:47:16,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {29730#true} call #t~ret15 := main(); {29730#true} is VALID [2022-04-15 06:47:16,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {29730#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29730#true} is VALID [2022-04-15 06:47:16,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {29730#true} [151] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_455 4294967296)) (.cse1 (= v_main_~y~0_586 v_main_~y~0_585)) (.cse2 (= |v_main_#t~post6_159| |v_main_#t~post6_158|)) (.cse3 (= |v_main_#t~post5_159| |v_main_#t~post5_158|)) (.cse4 (= v_main_~x~0_455 v_main_~x~0_454))) (or (and (forall ((v_it_33 Int)) (or (not (<= 1 v_it_33)) (not (<= (+ v_main_~x~0_454 v_it_33 1) v_main_~x~0_455)) (< 0 (mod (+ v_main_~x~0_455 (* 4294967295 v_it_33)) 4294967296)))) (< v_main_~x~0_454 v_main_~x~0_455) (< 0 .cse0) (= v_main_~y~0_585 (+ v_main_~x~0_455 v_main_~y~0_586 (* v_main_~x~0_454 (- 1))))) (and .cse1 .cse2 .cse3 .cse4) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_586, main_#t~post5=|v_main_#t~post5_159|, main_~x~0=v_main_~x~0_455, main_#t~post6=|v_main_#t~post6_159|} OutVars{main_~y~0=v_main_~y~0_585, main_#t~post5=|v_main_#t~post5_158|, main_~x~0=v_main_~x~0_454, main_#t~post6=|v_main_#t~post6_158|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {29730#true} is VALID [2022-04-15 06:47:16,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {29730#true} [150] 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[] {29735#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:47:16,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {29735#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {29735#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:47:16,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {29735#(<= 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; {29736#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:47:16,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {29736#(<= 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; {29737#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:16,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {29737#(<= 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; {29738#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:16,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {29738#(<= 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; {29739#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:16,362 INFO L290 TraceCheckUtils]: 13: Hoare triple {29739#(<= 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; {29740#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:47:16,363 INFO L290 TraceCheckUtils]: 14: Hoare triple {29740#(<= 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; {29741#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:16,364 INFO L290 TraceCheckUtils]: 15: Hoare triple {29741#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29742#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:16,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {29742#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29743#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:16,366 INFO L290 TraceCheckUtils]: 17: Hoare triple {29743#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29744#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:47:16,366 INFO L290 TraceCheckUtils]: 18: Hoare triple {29744#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !(~z~0 % 4294967296 > 0); {29744#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:47:16,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {29744#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29744#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:47:16,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {29744#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29744#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:47:16,368 INFO L290 TraceCheckUtils]: 21: Hoare triple {29744#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29744#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:47:16,368 INFO L290 TraceCheckUtils]: 22: Hoare triple {29744#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29744#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:47:16,369 INFO L290 TraceCheckUtils]: 23: Hoare triple {29744#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29744#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:47:16,369 INFO L290 TraceCheckUtils]: 24: Hoare triple {29744#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29744#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:47:16,369 INFO L290 TraceCheckUtils]: 25: Hoare triple {29744#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29744#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:47:16,370 INFO L290 TraceCheckUtils]: 26: Hoare triple {29744#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29744#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:47:16,370 INFO L290 TraceCheckUtils]: 27: Hoare triple {29744#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !(~y~0 % 4294967296 > 0); {29744#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:47:16,372 INFO L290 TraceCheckUtils]: 28: Hoare triple {29744#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {29745#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 06:47:16,372 INFO L290 TraceCheckUtils]: 29: Hoare triple {29745#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {29731#false} is VALID [2022-04-15 06:47:16,372 INFO L290 TraceCheckUtils]: 30: Hoare triple {29731#false} assume !(~z~0 % 4294967296 > 0); {29731#false} is VALID [2022-04-15 06:47:16,373 INFO L272 TraceCheckUtils]: 31: Hoare triple {29731#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {29731#false} is VALID [2022-04-15 06:47:16,373 INFO L290 TraceCheckUtils]: 32: Hoare triple {29731#false} ~cond := #in~cond; {29731#false} is VALID [2022-04-15 06:47:16,373 INFO L290 TraceCheckUtils]: 33: Hoare triple {29731#false} assume 0 == ~cond; {29731#false} is VALID [2022-04-15 06:47:16,373 INFO L290 TraceCheckUtils]: 34: Hoare triple {29731#false} assume !false; {29731#false} is VALID [2022-04-15 06:47:16,373 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-15 06:47:16,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:47:16,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307147320] [2022-04-15 06:47:16,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307147320] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:47:16,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025908176] [2022-04-15 06:47:16,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:47:16,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:47:16,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:47:16,376 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:47:16,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-15 06:47:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:47:16,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-15 06:47:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:47:16,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:47:17,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {29730#true} call ULTIMATE.init(); {29730#true} is VALID [2022-04-15 06:47:17,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {29730#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29730#true} is VALID [2022-04-15 06:47:17,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {29730#true} assume true; {29730#true} is VALID [2022-04-15 06:47:17,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29730#true} {29730#true} #83#return; {29730#true} is VALID [2022-04-15 06:47:17,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {29730#true} call #t~ret15 := main(); {29730#true} is VALID [2022-04-15 06:47:17,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {29730#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29730#true} is VALID [2022-04-15 06:47:17,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {29730#true} [151] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_455 4294967296)) (.cse1 (= v_main_~y~0_586 v_main_~y~0_585)) (.cse2 (= |v_main_#t~post6_159| |v_main_#t~post6_158|)) (.cse3 (= |v_main_#t~post5_159| |v_main_#t~post5_158|)) (.cse4 (= v_main_~x~0_455 v_main_~x~0_454))) (or (and (forall ((v_it_33 Int)) (or (not (<= 1 v_it_33)) (not (<= (+ v_main_~x~0_454 v_it_33 1) v_main_~x~0_455)) (< 0 (mod (+ v_main_~x~0_455 (* 4294967295 v_it_33)) 4294967296)))) (< v_main_~x~0_454 v_main_~x~0_455) (< 0 .cse0) (= v_main_~y~0_585 (+ v_main_~x~0_455 v_main_~y~0_586 (* v_main_~x~0_454 (- 1))))) (and .cse1 .cse2 .cse3 .cse4) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_586, main_#t~post5=|v_main_#t~post5_159|, main_~x~0=v_main_~x~0_455, main_#t~post6=|v_main_#t~post6_159|} OutVars{main_~y~0=v_main_~y~0_585, main_#t~post5=|v_main_#t~post5_158|, main_~x~0=v_main_~x~0_454, main_#t~post6=|v_main_#t~post6_158|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {29730#true} is VALID [2022-04-15 06:47:17,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {29730#true} [150] 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[] {29730#true} is VALID [2022-04-15 06:47:17,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {29730#true} ~z~0 := ~y~0; {29774#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:47:17,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {29774#(= 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; {29778#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:47:17,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {29778#(= 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; {29782#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 2)))} is VALID [2022-04-15 06:47:17,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {29782#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29786#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:47:17,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {29786#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29790#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:47:17,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {29790#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29794#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)))} is VALID [2022-04-15 06:47:17,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {29794#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29798#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:47:17,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {29798#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29802#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)))} is VALID [2022-04-15 06:47:17,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {29802#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29806#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ main_~y~0 (- 6)) (+ main_~z~0 2)))} is VALID [2022-04-15 06:47:17,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {29806#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ main_~y~0 (- 6)) (+ 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; {29810#(and (= (+ main_~y~0 (- 6)) (+ main_~z~0 3)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:47:17,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {29810#(and (= (+ main_~y~0 (- 6)) (+ main_~z~0 3)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {29810#(and (= (+ main_~y~0 (- 6)) (+ main_~z~0 3)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:47:17,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {29810#(and (= (+ main_~y~0 (- 6)) (+ main_~z~0 3)) (< 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; {29817#(and (= (+ main_~z~0 8) (+ main_~y~0 1)) (< 0 (mod (+ 7 main_~z~0) 4294967296)))} is VALID [2022-04-15 06:47:17,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {29817#(and (= (+ main_~z~0 8) (+ main_~y~0 1)) (< 0 (mod (+ 7 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; {29821#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-15 06:47:17,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {29821#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29825#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 06:47:17,207 INFO L290 TraceCheckUtils]: 22: Hoare triple {29825#(< 0 (mod (+ 5 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; {29829#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 06:47:17,208 INFO L290 TraceCheckUtils]: 23: Hoare triple {29829#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29833#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 06:47:17,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {29833#(< 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; {29837#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:47:17,210 INFO L290 TraceCheckUtils]: 25: Hoare triple {29837#(< 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; {29841#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:47:17,210 INFO L290 TraceCheckUtils]: 26: Hoare triple {29841#(< 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; {29845#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:47:17,211 INFO L290 TraceCheckUtils]: 27: Hoare triple {29845#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {29845#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:47:17,211 INFO L290 TraceCheckUtils]: 28: Hoare triple {29845#(< 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; {29845#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:47:17,211 INFO L290 TraceCheckUtils]: 29: Hoare triple {29845#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {29845#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:47:17,211 INFO L290 TraceCheckUtils]: 30: Hoare triple {29845#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {29731#false} is VALID [2022-04-15 06:47:17,212 INFO L272 TraceCheckUtils]: 31: Hoare triple {29731#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {29731#false} is VALID [2022-04-15 06:47:17,212 INFO L290 TraceCheckUtils]: 32: Hoare triple {29731#false} ~cond := #in~cond; {29731#false} is VALID [2022-04-15 06:47:17,212 INFO L290 TraceCheckUtils]: 33: Hoare triple {29731#false} assume 0 == ~cond; {29731#false} is VALID [2022-04-15 06:47:17,212 INFO L290 TraceCheckUtils]: 34: Hoare triple {29731#false} assume !false; {29731#false} is VALID [2022-04-15 06:47:17,212 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:47:17,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:47:17,423 INFO L290 TraceCheckUtils]: 34: Hoare triple {29731#false} assume !false; {29731#false} is VALID [2022-04-15 06:47:17,423 INFO L290 TraceCheckUtils]: 33: Hoare triple {29731#false} assume 0 == ~cond; {29731#false} is VALID [2022-04-15 06:47:17,423 INFO L290 TraceCheckUtils]: 32: Hoare triple {29731#false} ~cond := #in~cond; {29731#false} is VALID [2022-04-15 06:47:17,423 INFO L272 TraceCheckUtils]: 31: Hoare triple {29731#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {29731#false} is VALID [2022-04-15 06:47:17,423 INFO L290 TraceCheckUtils]: 30: Hoare triple {29845#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {29731#false} is VALID [2022-04-15 06:47:17,424 INFO L290 TraceCheckUtils]: 29: Hoare triple {29845#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {29845#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:47:17,424 INFO L290 TraceCheckUtils]: 28: Hoare triple {29845#(< 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; {29845#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:47:17,424 INFO L290 TraceCheckUtils]: 27: Hoare triple {29845#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {29845#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:47:17,425 INFO L290 TraceCheckUtils]: 26: Hoare triple {29841#(< 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; {29845#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:47:17,426 INFO L290 TraceCheckUtils]: 25: Hoare triple {29837#(< 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; {29841#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:47:17,427 INFO L290 TraceCheckUtils]: 24: Hoare triple {29833#(< 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; {29837#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:47:17,427 INFO L290 TraceCheckUtils]: 23: Hoare triple {29829#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29833#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 06:47:17,428 INFO L290 TraceCheckUtils]: 22: Hoare triple {29825#(< 0 (mod (+ 5 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; {29829#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 06:47:17,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {29821#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29825#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 06:47:17,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {29912#(< 0 (mod (+ 7 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; {29821#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-15 06:47:17,430 INFO L290 TraceCheckUtils]: 19: Hoare triple {29916#(< 0 (mod (+ main_~z~0 8) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29912#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-15 06:47:17,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {29916#(< 0 (mod (+ main_~z~0 8) 4294967296))} assume !(~z~0 % 4294967296 > 0); {29916#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-15 06:47:17,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {29912#(< 0 (mod (+ 7 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; {29916#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-15 06:47:17,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {29821#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29912#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-15 06:47:17,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {29825#(< 0 (mod (+ 5 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; {29821#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-15 06:47:17,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {29829#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29825#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 06:47:17,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {29833#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29829#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 06:47:17,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {29837#(< 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; {29833#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 06:47:17,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {29841#(< 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; {29837#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:47:17,443 INFO L290 TraceCheckUtils]: 10: Hoare triple {29730#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; {29841#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:47:17,443 INFO L290 TraceCheckUtils]: 9: Hoare triple {29730#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; {29730#true} is VALID [2022-04-15 06:47:17,443 INFO L290 TraceCheckUtils]: 8: Hoare triple {29730#true} ~z~0 := ~y~0; {29730#true} is VALID [2022-04-15 06:47:17,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {29730#true} [150] 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[] {29730#true} is VALID [2022-04-15 06:47:17,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {29730#true} [151] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_455 4294967296)) (.cse1 (= v_main_~y~0_586 v_main_~y~0_585)) (.cse2 (= |v_main_#t~post6_159| |v_main_#t~post6_158|)) (.cse3 (= |v_main_#t~post5_159| |v_main_#t~post5_158|)) (.cse4 (= v_main_~x~0_455 v_main_~x~0_454))) (or (and (forall ((v_it_33 Int)) (or (not (<= 1 v_it_33)) (not (<= (+ v_main_~x~0_454 v_it_33 1) v_main_~x~0_455)) (< 0 (mod (+ v_main_~x~0_455 (* 4294967295 v_it_33)) 4294967296)))) (< v_main_~x~0_454 v_main_~x~0_455) (< 0 .cse0) (= v_main_~y~0_585 (+ v_main_~x~0_455 v_main_~y~0_586 (* v_main_~x~0_454 (- 1))))) (and .cse1 .cse2 .cse3 .cse4) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_586, main_#t~post5=|v_main_#t~post5_159|, main_~x~0=v_main_~x~0_455, main_#t~post6=|v_main_#t~post6_159|} OutVars{main_~y~0=v_main_~y~0_585, main_#t~post5=|v_main_#t~post5_158|, main_~x~0=v_main_~x~0_454, main_#t~post6=|v_main_#t~post6_158|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {29730#true} is VALID [2022-04-15 06:47:17,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {29730#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29730#true} is VALID [2022-04-15 06:47:17,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {29730#true} call #t~ret15 := main(); {29730#true} is VALID [2022-04-15 06:47:17,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29730#true} {29730#true} #83#return; {29730#true} is VALID [2022-04-15 06:47:17,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {29730#true} assume true; {29730#true} is VALID [2022-04-15 06:47:17,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {29730#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29730#true} is VALID [2022-04-15 06:47:17,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {29730#true} call ULTIMATE.init(); {29730#true} is VALID [2022-04-15 06:47:17,444 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 16 proven. 64 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:47:17,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025908176] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:47:17,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:47:17,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20, 11] total 34 [2022-04-15 06:47:18,113 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:47:18,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1417823424] [2022-04-15 06:47:18,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1417823424] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:47:18,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:47:18,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 06:47:18,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19565962] [2022-04-15 06:47:18,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:47:18,114 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-15 06:47:18,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:47:18,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:47:18,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:47:18,168 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 06:47:18,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:47:18,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 06:47:18,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1336, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 06:47:18,168 INFO L87 Difference]: Start difference. First operand 156 states and 206 transitions. Second operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:47:24,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:47:24,973 INFO L93 Difference]: Finished difference Result 327 states and 480 transitions. [2022-04-15 06:47:24,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 06:47:24,973 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-15 06:47:24,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:47:24,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:47:24,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 119 transitions. [2022-04-15 06:47:24,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:47:24,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 119 transitions. [2022-04-15 06:47:24,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 119 transitions. [2022-04-15 06:47:25,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:47:25,251 INFO L225 Difference]: With dead ends: 327 [2022-04-15 06:47:25,251 INFO L226 Difference]: Without dead ends: 301 [2022-04-15 06:47:25,252 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=409, Invalid=3131, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 06:47:25,252 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 144 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:47:25,252 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 56 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 06:47:25,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-04-15 06:47:26,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 170. [2022-04-15 06:47:26,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:47:26,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 301 states. Second operand has 170 states, 165 states have (on average 1.3393939393939394) internal successors, (221), 165 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:47:26,998 INFO L74 IsIncluded]: Start isIncluded. First operand 301 states. Second operand has 170 states, 165 states have (on average 1.3393939393939394) internal successors, (221), 165 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:47:26,999 INFO L87 Difference]: Start difference. First operand 301 states. Second operand has 170 states, 165 states have (on average 1.3393939393939394) internal successors, (221), 165 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:47:27,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:47:27,006 INFO L93 Difference]: Finished difference Result 301 states and 406 transitions. [2022-04-15 06:47:27,006 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 406 transitions. [2022-04-15 06:47:27,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:47:27,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:47:27,007 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 165 states have (on average 1.3393939393939394) internal successors, (221), 165 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 301 states. [2022-04-15 06:47:27,007 INFO L87 Difference]: Start difference. First operand has 170 states, 165 states have (on average 1.3393939393939394) internal successors, (221), 165 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 301 states. [2022-04-15 06:47:27,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:47:27,012 INFO L93 Difference]: Finished difference Result 301 states and 406 transitions. [2022-04-15 06:47:27,012 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 406 transitions. [2022-04-15 06:47:27,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:47:27,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:47:27,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:47:27,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:47:27,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 165 states have (on average 1.3393939393939394) internal successors, (221), 165 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:47:27,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 225 transitions. [2022-04-15 06:47:27,015 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 225 transitions. Word has length 39 [2022-04-15 06:47:27,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:47:27,015 INFO L478 AbstractCegarLoop]: Abstraction has 170 states and 225 transitions. [2022-04-15 06:47:27,015 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:47:27,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 170 states and 225 transitions. [2022-04-15 06:47:43,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 221 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-15 06:47:43,755 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 225 transitions. [2022-04-15 06:47:43,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 06:47:43,755 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:47:43,755 INFO L499 BasicCegarLoop]: trace histogram [10, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:47:43,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-15 06:47:43,955 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-15 06:47:43,956 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:47:43,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:47:43,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1395085053, now seen corresponding path program 10 times [2022-04-15 06:47:43,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:47:43,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [327757434] [2022-04-15 06:47:44,261 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-15 06:47:44,263 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:47:44,265 INFO L85 PathProgramCache]: Analyzing trace with hash -855421948, now seen corresponding path program 1 times [2022-04-15 06:47:44,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:47:44,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357605441] [2022-04-15 06:47:44,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:47:44,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:47:44,275 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-15 06:47:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:47:44,325 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_34.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:47:44,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:47:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:47:44,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {31636#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {31619#true} is VALID [2022-04-15 06:47:44,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {31619#true} assume true; {31619#true} is VALID [2022-04-15 06:47:44,616 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31619#true} {31619#true} #83#return; {31619#true} is VALID [2022-04-15 06:47:44,616 INFO L272 TraceCheckUtils]: 0: Hoare triple {31619#true} call ULTIMATE.init(); {31636#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:47:44,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {31636#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {31619#true} is VALID [2022-04-15 06:47:44,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {31619#true} assume true; {31619#true} is VALID [2022-04-15 06:47:44,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31619#true} {31619#true} #83#return; {31619#true} is VALID [2022-04-15 06:47:44,617 INFO L272 TraceCheckUtils]: 4: Hoare triple {31619#true} call #t~ret15 := main(); {31619#true} is VALID [2022-04-15 06:47:44,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {31619#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31619#true} is VALID [2022-04-15 06:47:44,617 INFO L290 TraceCheckUtils]: 6: Hoare triple {31619#true} [153] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_164| |v_main_#t~post5_163|)) (.cse1 (= |v_main_#t~post6_164| |v_main_#t~post6_163|)) (.cse2 (= v_main_~x~0_475 v_main_~x~0_474)) (.cse3 (= v_main_~y~0_608 v_main_~y~0_607)) (.cse4 (mod v_main_~x~0_475 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= .cse4 0) .cse1 .cse2 .cse3) (and (< v_main_~x~0_474 v_main_~x~0_475) (= (+ v_main_~x~0_475 (* v_main_~x~0_474 (- 1)) v_main_~y~0_608) v_main_~y~0_607) (< 0 .cse4) (forall ((v_it_34 Int)) (or (< 0 (mod (+ v_main_~x~0_475 (* 4294967295 v_it_34)) 4294967296)) (not (<= 1 v_it_34)) (not (<= (+ v_main_~x~0_474 v_it_34 1) v_main_~x~0_475))))))) InVars {main_~y~0=v_main_~y~0_608, main_#t~post5=|v_main_#t~post5_164|, main_~x~0=v_main_~x~0_475, main_#t~post6=|v_main_#t~post6_164|} OutVars{main_~y~0=v_main_~y~0_607, main_#t~post5=|v_main_#t~post5_163|, main_~x~0=v_main_~x~0_474, main_#t~post6=|v_main_#t~post6_163|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {31619#true} is VALID [2022-04-15 06:47:44,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {31619#true} [152] 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[] {31624#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:47:44,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {31624#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {31624#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:47:44,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {31624#(<= 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; {31625#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:47:44,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {31625#(<= 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; {31626#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:44,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {31626#(<= 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; {31627#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:44,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {31627#(<= 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; {31628#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:44,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {31628#(<= 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; {31629#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:47:44,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {31629#(<= 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; {31630#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:44,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {31630#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31631#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:44,626 INFO L290 TraceCheckUtils]: 16: Hoare triple {31631#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31632#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:44,627 INFO L290 TraceCheckUtils]: 17: Hoare triple {31632#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31633#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:47:44,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {31633#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31634#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:47:44,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {31634#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !(~z~0 % 4294967296 > 0); {31634#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:47:44,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {31634#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31634#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:47:44,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {31634#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31634#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:47:44,630 INFO L290 TraceCheckUtils]: 22: Hoare triple {31634#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31634#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:47:44,631 INFO L290 TraceCheckUtils]: 23: Hoare triple {31634#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31634#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:47:44,631 INFO L290 TraceCheckUtils]: 24: Hoare triple {31634#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31634#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:47:44,632 INFO L290 TraceCheckUtils]: 25: Hoare triple {31634#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31634#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:47:44,632 INFO L290 TraceCheckUtils]: 26: Hoare triple {31634#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31634#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:47:44,633 INFO L290 TraceCheckUtils]: 27: Hoare triple {31634#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31634#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:47:44,633 INFO L290 TraceCheckUtils]: 28: Hoare triple {31634#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !(~y~0 % 4294967296 > 0); {31634#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:47:44,635 INFO L290 TraceCheckUtils]: 29: Hoare triple {31634#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {31635#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 06:47:44,635 INFO L290 TraceCheckUtils]: 30: Hoare triple {31635#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {31620#false} is VALID [2022-04-15 06:47:44,635 INFO L290 TraceCheckUtils]: 31: Hoare triple {31620#false} assume !(~z~0 % 4294967296 > 0); {31620#false} is VALID [2022-04-15 06:47:44,635 INFO L272 TraceCheckUtils]: 32: Hoare triple {31620#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {31620#false} is VALID [2022-04-15 06:47:44,636 INFO L290 TraceCheckUtils]: 33: Hoare triple {31620#false} ~cond := #in~cond; {31620#false} is VALID [2022-04-15 06:47:44,636 INFO L290 TraceCheckUtils]: 34: Hoare triple {31620#false} assume 0 == ~cond; {31620#false} is VALID [2022-04-15 06:47:44,636 INFO L290 TraceCheckUtils]: 35: Hoare triple {31620#false} assume !false; {31620#false} is VALID [2022-04-15 06:47:44,636 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-15 06:47:44,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:47:44,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357605441] [2022-04-15 06:47:44,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357605441] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:47:44,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295938823] [2022-04-15 06:47:44,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:47:44,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:47:44,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:47:44,640 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:47:44,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-15 06:47:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:47:44,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 06:47:44,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:47:44,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:47:45,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {31619#true} call ULTIMATE.init(); {31619#true} is VALID [2022-04-15 06:47:45,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {31619#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {31619#true} is VALID [2022-04-15 06:47:45,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {31619#true} assume true; {31619#true} is VALID [2022-04-15 06:47:45,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31619#true} {31619#true} #83#return; {31619#true} is VALID [2022-04-15 06:47:45,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {31619#true} call #t~ret15 := main(); {31619#true} is VALID [2022-04-15 06:47:45,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {31619#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31619#true} is VALID [2022-04-15 06:47:45,324 INFO L290 TraceCheckUtils]: 6: Hoare triple {31619#true} [153] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_164| |v_main_#t~post5_163|)) (.cse1 (= |v_main_#t~post6_164| |v_main_#t~post6_163|)) (.cse2 (= v_main_~x~0_475 v_main_~x~0_474)) (.cse3 (= v_main_~y~0_608 v_main_~y~0_607)) (.cse4 (mod v_main_~x~0_475 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= .cse4 0) .cse1 .cse2 .cse3) (and (< v_main_~x~0_474 v_main_~x~0_475) (= (+ v_main_~x~0_475 (* v_main_~x~0_474 (- 1)) v_main_~y~0_608) v_main_~y~0_607) (< 0 .cse4) (forall ((v_it_34 Int)) (or (< 0 (mod (+ v_main_~x~0_475 (* 4294967295 v_it_34)) 4294967296)) (not (<= 1 v_it_34)) (not (<= (+ v_main_~x~0_474 v_it_34 1) v_main_~x~0_475))))))) InVars {main_~y~0=v_main_~y~0_608, main_#t~post5=|v_main_#t~post5_164|, main_~x~0=v_main_~x~0_475, main_#t~post6=|v_main_#t~post6_164|} OutVars{main_~y~0=v_main_~y~0_607, main_#t~post5=|v_main_#t~post5_163|, main_~x~0=v_main_~x~0_474, main_#t~post6=|v_main_#t~post6_163|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {31619#true} is VALID [2022-04-15 06:47:45,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {31619#true} [152] 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[] {31619#true} is VALID [2022-04-15 06:47:45,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {31619#true} ~z~0 := ~y~0; {31664#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:47:45,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {31664#(= 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; {31668#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:47:45,325 INFO L290 TraceCheckUtils]: 10: Hoare triple {31668#(= 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; {31672#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:47:45,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {31672#(= (+ 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; {31676#(= (+ main_~z~0 2) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:47:45,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {31676#(= (+ 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; {31680#(= (+ main_~z~0 3) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:47:45,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {31680#(= (+ 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; {31684#(= (+ (- 1) main_~y~0) (+ main_~z~0 4))} is VALID [2022-04-15 06:47:45,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {31684#(= (+ (- 1) main_~y~0) (+ main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31688#(= (+ 5 main_~z~0) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:47:45,329 INFO L290 TraceCheckUtils]: 15: Hoare triple {31688#(= (+ 5 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; {31692#(= (+ main_~y~0 (- 6)) (+ main_~z~0 1))} is VALID [2022-04-15 06:47:45,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {31692#(= (+ main_~y~0 (- 6)) (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31696#(= (+ main_~y~0 (- 6)) (+ main_~z~0 2))} is VALID [2022-04-15 06:47:45,330 INFO L290 TraceCheckUtils]: 17: Hoare triple {31696#(= (+ main_~y~0 (- 6)) (+ 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; {31700#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-15 06:47:45,330 INFO L290 TraceCheckUtils]: 18: Hoare triple {31700#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31700#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-15 06:47:45,330 INFO L290 TraceCheckUtils]: 19: Hoare triple {31700#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {31700#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-15 06:47:45,331 INFO L290 TraceCheckUtils]: 20: Hoare triple {31700#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31710#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-15 06:47:45,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {31710#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31714#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:47:45,333 INFO L290 TraceCheckUtils]: 22: Hoare triple {31714#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31718#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-15 06:47:45,334 INFO L290 TraceCheckUtils]: 23: Hoare triple {31718#(< 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; {31722#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-15 06:47:45,335 INFO L290 TraceCheckUtils]: 24: Hoare triple {31722#(< 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; {31726#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-15 06:47:45,336 INFO L290 TraceCheckUtils]: 25: Hoare triple {31726#(< 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; {31730#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:47:45,337 INFO L290 TraceCheckUtils]: 26: Hoare triple {31730#(< 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; {31734#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:47:45,338 INFO L290 TraceCheckUtils]: 27: Hoare triple {31734#(< 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; {31738#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:47:45,338 INFO L290 TraceCheckUtils]: 28: Hoare triple {31738#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {31620#false} is VALID [2022-04-15 06:47:45,338 INFO L290 TraceCheckUtils]: 29: Hoare triple {31620#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; {31620#false} is VALID [2022-04-15 06:47:45,338 INFO L290 TraceCheckUtils]: 30: Hoare triple {31620#false} assume !(~x~0 % 4294967296 > 0); {31620#false} is VALID [2022-04-15 06:47:45,338 INFO L290 TraceCheckUtils]: 31: Hoare triple {31620#false} assume !(~z~0 % 4294967296 > 0); {31620#false} is VALID [2022-04-15 06:47:45,338 INFO L272 TraceCheckUtils]: 32: Hoare triple {31620#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {31620#false} is VALID [2022-04-15 06:47:45,338 INFO L290 TraceCheckUtils]: 33: Hoare triple {31620#false} ~cond := #in~cond; {31620#false} is VALID [2022-04-15 06:47:45,338 INFO L290 TraceCheckUtils]: 34: Hoare triple {31620#false} assume 0 == ~cond; {31620#false} is VALID [2022-04-15 06:47:45,338 INFO L290 TraceCheckUtils]: 35: Hoare triple {31620#false} assume !false; {31620#false} is VALID [2022-04-15 06:47:45,338 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:47:45,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:47:46,039 INFO L290 TraceCheckUtils]: 35: Hoare triple {31620#false} assume !false; {31620#false} is VALID [2022-04-15 06:47:46,039 INFO L290 TraceCheckUtils]: 34: Hoare triple {31620#false} assume 0 == ~cond; {31620#false} is VALID [2022-04-15 06:47:46,039 INFO L290 TraceCheckUtils]: 33: Hoare triple {31620#false} ~cond := #in~cond; {31620#false} is VALID [2022-04-15 06:47:46,039 INFO L272 TraceCheckUtils]: 32: Hoare triple {31620#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {31620#false} is VALID [2022-04-15 06:47:46,040 INFO L290 TraceCheckUtils]: 31: Hoare triple {31620#false} assume !(~z~0 % 4294967296 > 0); {31620#false} is VALID [2022-04-15 06:47:46,040 INFO L290 TraceCheckUtils]: 30: Hoare triple {31620#false} assume !(~x~0 % 4294967296 > 0); {31620#false} is VALID [2022-04-15 06:47:46,040 INFO L290 TraceCheckUtils]: 29: Hoare triple {31620#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; {31620#false} is VALID [2022-04-15 06:47:46,040 INFO L290 TraceCheckUtils]: 28: Hoare triple {31738#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {31620#false} is VALID [2022-04-15 06:47:46,041 INFO L290 TraceCheckUtils]: 27: Hoare triple {31734#(< 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; {31738#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:47:46,042 INFO L290 TraceCheckUtils]: 26: Hoare triple {31730#(< 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; {31734#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:47:46,043 INFO L290 TraceCheckUtils]: 25: Hoare triple {31726#(< 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; {31730#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:47:46,043 INFO L290 TraceCheckUtils]: 24: Hoare triple {31722#(< 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; {31726#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-15 06:47:46,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {31718#(< 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; {31722#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-15 06:47:46,045 INFO L290 TraceCheckUtils]: 22: Hoare triple {31714#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31718#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-15 06:47:46,046 INFO L290 TraceCheckUtils]: 21: Hoare triple {31710#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31714#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:47:46,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {31700#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31710#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-15 06:47:46,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {31700#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {31700#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-15 06:47:46,055 INFO L290 TraceCheckUtils]: 18: Hoare triple {31700#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31700#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-15 06:47:46,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {31817#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31700#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-15 06:47:46,057 INFO L290 TraceCheckUtils]: 16: Hoare triple {31821#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31817#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:47:46,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {31825#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31821#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:47:46,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {31829#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31825#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:47:46,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {31833#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31829#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:47:46,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {31837#(or (< 0 (mod (+ 4294967288 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; {31833#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:47:46,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {31841#(or (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31837#(or (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-15 06:47:46,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {31845#(or (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31841#(or (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:47:46,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {31849#(or (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31845#(or (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:47:46,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {31619#true} ~z~0 := ~y~0; {31849#(or (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:47:46,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {31619#true} [152] 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[] {31619#true} is VALID [2022-04-15 06:47:46,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {31619#true} [153] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_164| |v_main_#t~post5_163|)) (.cse1 (= |v_main_#t~post6_164| |v_main_#t~post6_163|)) (.cse2 (= v_main_~x~0_475 v_main_~x~0_474)) (.cse3 (= v_main_~y~0_608 v_main_~y~0_607)) (.cse4 (mod v_main_~x~0_475 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= .cse4 0) .cse1 .cse2 .cse3) (and (< v_main_~x~0_474 v_main_~x~0_475) (= (+ v_main_~x~0_475 (* v_main_~x~0_474 (- 1)) v_main_~y~0_608) v_main_~y~0_607) (< 0 .cse4) (forall ((v_it_34 Int)) (or (< 0 (mod (+ v_main_~x~0_475 (* 4294967295 v_it_34)) 4294967296)) (not (<= 1 v_it_34)) (not (<= (+ v_main_~x~0_474 v_it_34 1) v_main_~x~0_475))))))) InVars {main_~y~0=v_main_~y~0_608, main_#t~post5=|v_main_#t~post5_164|, main_~x~0=v_main_~x~0_475, main_#t~post6=|v_main_#t~post6_164|} OutVars{main_~y~0=v_main_~y~0_607, main_#t~post5=|v_main_#t~post5_163|, main_~x~0=v_main_~x~0_474, main_#t~post6=|v_main_#t~post6_163|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {31619#true} is VALID [2022-04-15 06:47:46,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {31619#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31619#true} is VALID [2022-04-15 06:47:46,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {31619#true} call #t~ret15 := main(); {31619#true} is VALID [2022-04-15 06:47:46,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31619#true} {31619#true} #83#return; {31619#true} is VALID [2022-04-15 06:47:46,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {31619#true} assume true; {31619#true} is VALID [2022-04-15 06:47:46,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {31619#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {31619#true} is VALID [2022-04-15 06:47:46,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {31619#true} call ULTIMATE.init(); {31619#true} is VALID [2022-04-15 06:47:46,067 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 18 proven. 72 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:47:46,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295938823] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:47:46,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:47:46,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20, 20] total 42 [2022-04-15 06:47:46,686 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:47:46,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [327757434] [2022-04-15 06:47:46,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [327757434] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:47:46,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:47:46,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 06:47:46,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351408189] [2022-04-15 06:47:46,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:47:46,686 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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 40 [2022-04-15 06:47:46,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:47:46,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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-15 06:47:46,719 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-15 06:47:46,719 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 06:47:46,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:47:46,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 06:47:46,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1986, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 06:47:46,720 INFO L87 Difference]: Start difference. First operand 170 states and 225 transitions. Second operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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-15 06:47:54,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:47:54,677 INFO L93 Difference]: Finished difference Result 345 states and 507 transitions. [2022-04-15 06:47:54,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 06:47:54,678 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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 40 [2022-04-15 06:47:54,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:47:54,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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-15 06:47:54,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 125 transitions. [2022-04-15 06:47:54,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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-15 06:47:54,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 125 transitions. [2022-04-15 06:47:54,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 125 transitions. [2022-04-15 06:47:54,942 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-15 06:47:54,946 INFO L225 Difference]: With dead ends: 345 [2022-04-15 06:47:54,947 INFO L226 Difference]: Without dead ends: 319 [2022-04-15 06:47:54,947 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=453, Invalid=4239, Unknown=0, NotChecked=0, Total=4692 [2022-04-15 06:47:54,947 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 200 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:47:54,947 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 49 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-15 06:47:54,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-04-15 06:47:56,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 184. [2022-04-15 06:47:56,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:47:56,839 INFO L82 GeneralOperation]: Start isEquivalent. First operand 319 states. Second operand has 184 states, 179 states have (on average 1.3407821229050279) internal successors, (240), 179 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:47:56,840 INFO L74 IsIncluded]: Start isIncluded. First operand 319 states. Second operand has 184 states, 179 states have (on average 1.3407821229050279) internal successors, (240), 179 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:47:56,840 INFO L87 Difference]: Start difference. First operand 319 states. Second operand has 184 states, 179 states have (on average 1.3407821229050279) internal successors, (240), 179 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:47:56,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:47:56,843 INFO L93 Difference]: Finished difference Result 319 states and 429 transitions. [2022-04-15 06:47:56,843 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 429 transitions. [2022-04-15 06:47:56,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:47:56,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:47:56,844 INFO L74 IsIncluded]: Start isIncluded. First operand has 184 states, 179 states have (on average 1.3407821229050279) internal successors, (240), 179 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 319 states. [2022-04-15 06:47:56,844 INFO L87 Difference]: Start difference. First operand has 184 states, 179 states have (on average 1.3407821229050279) internal successors, (240), 179 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 319 states. [2022-04-15 06:47:56,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:47:56,849 INFO L93 Difference]: Finished difference Result 319 states and 429 transitions. [2022-04-15 06:47:56,849 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 429 transitions. [2022-04-15 06:47:56,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:47:56,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:47:56,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:47:56,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:47:56,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 179 states have (on average 1.3407821229050279) internal successors, (240), 179 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:47:56,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 244 transitions. [2022-04-15 06:47:56,852 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 244 transitions. Word has length 40 [2022-04-15 06:47:56,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:47:56,853 INFO L478 AbstractCegarLoop]: Abstraction has 184 states and 244 transitions. [2022-04-15 06:47:56,853 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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-15 06:47:56,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 184 states and 244 transitions. [2022-04-15 06:48:14,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 240 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-15 06:48:14,587 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 244 transitions. [2022-04-15 06:48:14,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 06:48:14,587 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:48:14,587 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:48:14,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-15 06:48:14,788 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-15 06:48:14,788 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:48:14,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:48:14,788 INFO L85 PathProgramCache]: Analyzing trace with hash -264974095, now seen corresponding path program 21 times [2022-04-15 06:48:14,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:14,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2033281795] [2022-04-15 06:48:16,993 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:48:17,116 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-15 06:48:17,118 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:48:17,120 INFO L85 PathProgramCache]: Analyzing trace with hash 8945104, now seen corresponding path program 1 times [2022-04-15 06:48:17,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:48:17,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438659363] [2022-04-15 06:48:17,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:17,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:48:17,138 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-15 06:48:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:17,166 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-15 06:48:17,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:48:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:17,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {33637#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {33624#true} is VALID [2022-04-15 06:48:17,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {33624#true} assume true; {33624#true} is VALID [2022-04-15 06:48:17,322 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33624#true} {33624#true} #83#return; {33624#true} is VALID [2022-04-15 06:48:17,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {33624#true} call ULTIMATE.init(); {33637#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:48:17,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {33637#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {33624#true} is VALID [2022-04-15 06:48:17,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {33624#true} assume true; {33624#true} is VALID [2022-04-15 06:48:17,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33624#true} {33624#true} #83#return; {33624#true} is VALID [2022-04-15 06:48:17,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {33624#true} call #t~ret15 := main(); {33624#true} is VALID [2022-04-15 06:48:17,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {33624#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33624#true} is VALID [2022-04-15 06:48:17,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {33624#true} [155] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_636 v_main_~y~0_635)) (.cse1 (= |v_main_#t~post6_169| |v_main_#t~post6_168|)) (.cse2 (= |v_main_#t~post5_169| |v_main_#t~post5_168|)) (.cse4 (mod v_main_~x~0_497 4294967296)) (.cse3 (= v_main_~x~0_497 v_main_~x~0_496))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_35 Int)) (or (not (<= (+ v_main_~x~0_496 v_it_35 1) v_main_~x~0_497)) (not (<= 1 v_it_35)) (< 0 (mod (+ v_main_~x~0_497 (* 4294967295 v_it_35)) 4294967296)))) (< 0 .cse4) (= v_main_~y~0_635 (+ v_main_~x~0_497 v_main_~y~0_636 (* v_main_~x~0_496 (- 1)))) (< v_main_~x~0_496 v_main_~x~0_497)) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3))) InVars {main_~y~0=v_main_~y~0_636, main_#t~post5=|v_main_#t~post5_169|, main_~x~0=v_main_~x~0_497, main_#t~post6=|v_main_#t~post6_169|} OutVars{main_~y~0=v_main_~y~0_635, main_#t~post5=|v_main_#t~post5_168|, main_~x~0=v_main_~x~0_496, main_#t~post6=|v_main_#t~post6_168|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {33624#true} is VALID [2022-04-15 06:48:17,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {33624#true} [154] 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[] {33624#true} is VALID [2022-04-15 06:48:17,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {33624#true} ~z~0 := ~y~0; {33624#true} is VALID [2022-04-15 06:48:17,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {33624#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; {33624#true} is VALID [2022-04-15 06:48:17,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {33624#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; {33624#true} is VALID [2022-04-15 06:48:17,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {33624#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; {33624#true} is VALID [2022-04-15 06:48:17,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {33624#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; {33624#true} is VALID [2022-04-15 06:48:17,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {33624#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; {33624#true} is VALID [2022-04-15 06:48:17,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {33624#true} assume !(~z~0 % 4294967296 > 0); {33624#true} is VALID [2022-04-15 06:48:17,323 INFO L290 TraceCheckUtils]: 15: Hoare triple {33624#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; {33624#true} is VALID [2022-04-15 06:48:17,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {33624#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; {33624#true} is VALID [2022-04-15 06:48:17,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {33624#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; {33624#true} is VALID [2022-04-15 06:48:17,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {33624#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; {33624#true} is VALID [2022-04-15 06:48:17,324 INFO L290 TraceCheckUtils]: 19: Hoare triple {33624#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; {33624#true} is VALID [2022-04-15 06:48:17,324 INFO L290 TraceCheckUtils]: 20: Hoare triple {33624#true} assume !(~y~0 % 4294967296 > 0); {33629#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:48:17,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {33629#(<= 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; {33630#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:48:17,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {33630#(<= 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; {33631#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:17,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {33631#(<= 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; {33632#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:17,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {33632#(<= main_~y~0 (+ 3 (* (div (+ main_~y~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; {33633#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:17,330 INFO L290 TraceCheckUtils]: 25: Hoare triple {33633#(<= main_~y~0 (+ 4 (* (div (+ main_~y~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; {33634#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:17,331 INFO L290 TraceCheckUtils]: 26: Hoare triple {33634#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {33634#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:17,332 INFO L290 TraceCheckUtils]: 27: Hoare triple {33634#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33633#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:17,333 INFO L290 TraceCheckUtils]: 28: Hoare triple {33633#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33632#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:17,334 INFO L290 TraceCheckUtils]: 29: Hoare triple {33632#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33631#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:17,335 INFO L290 TraceCheckUtils]: 30: Hoare triple {33631#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33630#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:48:17,336 INFO L290 TraceCheckUtils]: 31: Hoare triple {33630#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33629#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:48:17,337 INFO L290 TraceCheckUtils]: 32: Hoare triple {33629#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {33629#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:48:17,337 INFO L272 TraceCheckUtils]: 33: Hoare triple {33629#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {33635#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:48:17,338 INFO L290 TraceCheckUtils]: 34: Hoare triple {33635#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {33636#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:48:17,338 INFO L290 TraceCheckUtils]: 35: Hoare triple {33636#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {33625#false} is VALID [2022-04-15 06:48:17,338 INFO L290 TraceCheckUtils]: 36: Hoare triple {33625#false} assume !false; {33625#false} is VALID [2022-04-15 06:48:17,338 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-15 06:48:17,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:48:17,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438659363] [2022-04-15 06:48:17,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438659363] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:48:17,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562831976] [2022-04-15 06:48:17,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:17,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:48:17,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:48:17,344 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:48:17,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-15 06:48:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:17,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 06:48:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:17,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:48:17,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {33624#true} call ULTIMATE.init(); {33624#true} is VALID [2022-04-15 06:48:17,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {33624#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {33624#true} is VALID [2022-04-15 06:48:17,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {33624#true} assume true; {33624#true} is VALID [2022-04-15 06:48:17,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33624#true} {33624#true} #83#return; {33624#true} is VALID [2022-04-15 06:48:17,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {33624#true} call #t~ret15 := main(); {33624#true} is VALID [2022-04-15 06:48:17,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {33624#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33624#true} is VALID [2022-04-15 06:48:17,659 INFO L290 TraceCheckUtils]: 6: Hoare triple {33624#true} [155] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_636 v_main_~y~0_635)) (.cse1 (= |v_main_#t~post6_169| |v_main_#t~post6_168|)) (.cse2 (= |v_main_#t~post5_169| |v_main_#t~post5_168|)) (.cse4 (mod v_main_~x~0_497 4294967296)) (.cse3 (= v_main_~x~0_497 v_main_~x~0_496))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_35 Int)) (or (not (<= (+ v_main_~x~0_496 v_it_35 1) v_main_~x~0_497)) (not (<= 1 v_it_35)) (< 0 (mod (+ v_main_~x~0_497 (* 4294967295 v_it_35)) 4294967296)))) (< 0 .cse4) (= v_main_~y~0_635 (+ v_main_~x~0_497 v_main_~y~0_636 (* v_main_~x~0_496 (- 1)))) (< v_main_~x~0_496 v_main_~x~0_497)) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3))) InVars {main_~y~0=v_main_~y~0_636, main_#t~post5=|v_main_#t~post5_169|, main_~x~0=v_main_~x~0_497, main_#t~post6=|v_main_#t~post6_169|} OutVars{main_~y~0=v_main_~y~0_635, main_#t~post5=|v_main_#t~post5_168|, main_~x~0=v_main_~x~0_496, main_#t~post6=|v_main_#t~post6_168|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {33624#true} is VALID [2022-04-15 06:48:17,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {33624#true} [154] 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[] {33624#true} is VALID [2022-04-15 06:48:17,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {33624#true} ~z~0 := ~y~0; {33624#true} is VALID [2022-04-15 06:48:17,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {33624#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; {33624#true} is VALID [2022-04-15 06:48:17,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {33624#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; {33624#true} is VALID [2022-04-15 06:48:17,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {33624#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; {33624#true} is VALID [2022-04-15 06:48:17,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {33624#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; {33624#true} is VALID [2022-04-15 06:48:17,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {33624#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; {33624#true} is VALID [2022-04-15 06:48:17,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {33624#true} assume !(~z~0 % 4294967296 > 0); {33624#true} is VALID [2022-04-15 06:48:17,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {33624#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; {33624#true} is VALID [2022-04-15 06:48:17,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {33624#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; {33624#true} is VALID [2022-04-15 06:48:17,660 INFO L290 TraceCheckUtils]: 17: Hoare triple {33624#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; {33624#true} is VALID [2022-04-15 06:48:17,660 INFO L290 TraceCheckUtils]: 18: Hoare triple {33624#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; {33624#true} is VALID [2022-04-15 06:48:17,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {33624#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; {33624#true} is VALID [2022-04-15 06:48:17,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {33624#true} assume !(~y~0 % 4294967296 > 0); {33629#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:48:17,661 INFO L290 TraceCheckUtils]: 21: Hoare triple {33629#(<= 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; {33630#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:48:17,662 INFO L290 TraceCheckUtils]: 22: Hoare triple {33630#(<= 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; {33631#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:17,663 INFO L290 TraceCheckUtils]: 23: Hoare triple {33631#(<= 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; {33632#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:17,664 INFO L290 TraceCheckUtils]: 24: Hoare triple {33632#(<= main_~y~0 (+ 3 (* (div (+ main_~y~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; {33633#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:17,664 INFO L290 TraceCheckUtils]: 25: Hoare triple {33633#(<= main_~y~0 (+ 4 (* (div (+ main_~y~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; {33634#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:17,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {33634#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {33634#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:17,666 INFO L290 TraceCheckUtils]: 27: Hoare triple {33634#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33633#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:17,667 INFO L290 TraceCheckUtils]: 28: Hoare triple {33633#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33632#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:17,667 INFO L290 TraceCheckUtils]: 29: Hoare triple {33632#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33631#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:17,668 INFO L290 TraceCheckUtils]: 30: Hoare triple {33631#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33630#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:48:17,669 INFO L290 TraceCheckUtils]: 31: Hoare triple {33630#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33629#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:48:17,669 INFO L290 TraceCheckUtils]: 32: Hoare triple {33629#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {33629#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:48:17,670 INFO L272 TraceCheckUtils]: 33: Hoare triple {33629#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {33740#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:48:17,670 INFO L290 TraceCheckUtils]: 34: Hoare triple {33740#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {33744#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:48:17,671 INFO L290 TraceCheckUtils]: 35: Hoare triple {33744#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {33625#false} is VALID [2022-04-15 06:48:17,671 INFO L290 TraceCheckUtils]: 36: Hoare triple {33625#false} assume !false; {33625#false} is VALID [2022-04-15 06:48:17,671 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-15 06:48:17,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:48:17,829 INFO L290 TraceCheckUtils]: 36: Hoare triple {33625#false} assume !false; {33625#false} is VALID [2022-04-15 06:48:17,830 INFO L290 TraceCheckUtils]: 35: Hoare triple {33744#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {33625#false} is VALID [2022-04-15 06:48:17,830 INFO L290 TraceCheckUtils]: 34: Hoare triple {33740#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {33744#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:48:17,831 INFO L272 TraceCheckUtils]: 33: Hoare triple {33629#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {33740#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:48:17,831 INFO L290 TraceCheckUtils]: 32: Hoare triple {33629#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {33629#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:48:17,832 INFO L290 TraceCheckUtils]: 31: Hoare triple {33630#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33629#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:48:17,833 INFO L290 TraceCheckUtils]: 30: Hoare triple {33631#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33630#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:48:17,834 INFO L290 TraceCheckUtils]: 29: Hoare triple {33632#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33631#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:17,835 INFO L290 TraceCheckUtils]: 28: Hoare triple {33633#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33632#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:17,836 INFO L290 TraceCheckUtils]: 27: Hoare triple {33634#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33633#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:17,836 INFO L290 TraceCheckUtils]: 26: Hoare triple {33634#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {33634#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:17,837 INFO L290 TraceCheckUtils]: 25: Hoare triple {33633#(<= main_~y~0 (+ 4 (* (div (+ main_~y~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; {33634#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:17,838 INFO L290 TraceCheckUtils]: 24: Hoare triple {33632#(<= main_~y~0 (+ 3 (* (div (+ main_~y~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; {33633#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:17,839 INFO L290 TraceCheckUtils]: 23: Hoare triple {33631#(<= 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; {33632#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:17,840 INFO L290 TraceCheckUtils]: 22: Hoare triple {33630#(<= 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; {33631#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:17,840 INFO L290 TraceCheckUtils]: 21: Hoare triple {33629#(<= 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; {33630#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:48:17,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {33624#true} assume !(~y~0 % 4294967296 > 0); {33629#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:48:17,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {33624#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; {33624#true} is VALID [2022-04-15 06:48:17,841 INFO L290 TraceCheckUtils]: 18: Hoare triple {33624#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; {33624#true} is VALID [2022-04-15 06:48:17,841 INFO L290 TraceCheckUtils]: 17: Hoare triple {33624#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; {33624#true} is VALID [2022-04-15 06:48:17,841 INFO L290 TraceCheckUtils]: 16: Hoare triple {33624#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; {33624#true} is VALID [2022-04-15 06:48:17,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {33624#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; {33624#true} is VALID [2022-04-15 06:48:17,841 INFO L290 TraceCheckUtils]: 14: Hoare triple {33624#true} assume !(~z~0 % 4294967296 > 0); {33624#true} is VALID [2022-04-15 06:48:17,841 INFO L290 TraceCheckUtils]: 13: Hoare triple {33624#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; {33624#true} is VALID [2022-04-15 06:48:17,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {33624#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; {33624#true} is VALID [2022-04-15 06:48:17,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {33624#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; {33624#true} is VALID [2022-04-15 06:48:17,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {33624#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; {33624#true} is VALID [2022-04-15 06:48:17,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {33624#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; {33624#true} is VALID [2022-04-15 06:48:17,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {33624#true} ~z~0 := ~y~0; {33624#true} is VALID [2022-04-15 06:48:17,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {33624#true} [154] 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[] {33624#true} is VALID [2022-04-15 06:48:17,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {33624#true} [155] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_636 v_main_~y~0_635)) (.cse1 (= |v_main_#t~post6_169| |v_main_#t~post6_168|)) (.cse2 (= |v_main_#t~post5_169| |v_main_#t~post5_168|)) (.cse4 (mod v_main_~x~0_497 4294967296)) (.cse3 (= v_main_~x~0_497 v_main_~x~0_496))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_35 Int)) (or (not (<= (+ v_main_~x~0_496 v_it_35 1) v_main_~x~0_497)) (not (<= 1 v_it_35)) (< 0 (mod (+ v_main_~x~0_497 (* 4294967295 v_it_35)) 4294967296)))) (< 0 .cse4) (= v_main_~y~0_635 (+ v_main_~x~0_497 v_main_~y~0_636 (* v_main_~x~0_496 (- 1)))) (< v_main_~x~0_496 v_main_~x~0_497)) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3))) InVars {main_~y~0=v_main_~y~0_636, main_#t~post5=|v_main_#t~post5_169|, main_~x~0=v_main_~x~0_497, main_#t~post6=|v_main_#t~post6_169|} OutVars{main_~y~0=v_main_~y~0_635, main_#t~post5=|v_main_#t~post5_168|, main_~x~0=v_main_~x~0_496, main_#t~post6=|v_main_#t~post6_168|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {33624#true} is VALID [2022-04-15 06:48:17,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {33624#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33624#true} is VALID [2022-04-15 06:48:17,842 INFO L272 TraceCheckUtils]: 4: Hoare triple {33624#true} call #t~ret15 := main(); {33624#true} is VALID [2022-04-15 06:48:17,842 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33624#true} {33624#true} #83#return; {33624#true} is VALID [2022-04-15 06:48:17,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {33624#true} assume true; {33624#true} is VALID [2022-04-15 06:48:17,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {33624#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {33624#true} is VALID [2022-04-15 06:48:17,842 INFO L272 TraceCheckUtils]: 0: Hoare triple {33624#true} call ULTIMATE.init(); {33624#true} is VALID [2022-04-15 06:48:17,842 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-15 06:48:17,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562831976] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:48:17,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:48:17,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 13 [2022-04-15 06:48:18,110 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:48:18,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2033281795] [2022-04-15 06:48:18,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2033281795] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:48:18,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:48:18,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 06:48:18,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615062415] [2022-04-15 06:48:18,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:48:18,110 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 41 [2022-04-15 06:48:18,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:48:18,110 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-15 06:48:18,154 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-15 06:48:18,154 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 06:48:18,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:18,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 06:48:18,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-04-15 06:48:18,155 INFO L87 Difference]: Start difference. First operand 184 states and 244 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-15 06:48:27,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:27,464 INFO L93 Difference]: Finished difference Result 503 states and 642 transitions. [2022-04-15 06:48:27,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 06:48:27,464 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 41 [2022-04-15 06:48:27,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:48:27,464 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-15 06:48:27,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 90 transitions. [2022-04-15 06:48:27,465 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-15 06:48:27,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 90 transitions. [2022-04-15 06:48:27,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 90 transitions. [2022-04-15 06:48:27,688 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-15 06:48:27,694 INFO L225 Difference]: With dead ends: 503 [2022-04-15 06:48:27,694 INFO L226 Difference]: Without dead ends: 384 [2022-04-15 06:48:27,694 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=303, Invalid=1677, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 06:48:27,694 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 60 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:48:27,695 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 74 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-15 06:48:27,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-04-15 06:48:30,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 250. [2022-04-15 06:48:30,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:48:30,287 INFO L82 GeneralOperation]: Start isEquivalent. First operand 384 states. Second operand has 250 states, 245 states have (on average 1.3306122448979592) internal successors, (326), 245 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:30,287 INFO L74 IsIncluded]: Start isIncluded. First operand 384 states. Second operand has 250 states, 245 states have (on average 1.3306122448979592) internal successors, (326), 245 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:30,287 INFO L87 Difference]: Start difference. First operand 384 states. Second operand has 250 states, 245 states have (on average 1.3306122448979592) internal successors, (326), 245 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:30,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:30,292 INFO L93 Difference]: Finished difference Result 384 states and 474 transitions. [2022-04-15 06:48:30,292 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 474 transitions. [2022-04-15 06:48:30,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:30,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:30,292 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.3306122448979592) internal successors, (326), 245 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 384 states. [2022-04-15 06:48:30,293 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.3306122448979592) internal successors, (326), 245 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 384 states. [2022-04-15 06:48:30,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:30,298 INFO L93 Difference]: Finished difference Result 384 states and 474 transitions. [2022-04-15 06:48:30,298 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 474 transitions. [2022-04-15 06:48:30,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:30,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:30,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:48:30,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:48:30,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.3306122448979592) internal successors, (326), 245 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:30,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 330 transitions. [2022-04-15 06:48:30,302 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 330 transitions. Word has length 41 [2022-04-15 06:48:30,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:48:30,302 INFO L478 AbstractCegarLoop]: Abstraction has 250 states and 330 transitions. [2022-04-15 06:48:30,302 INFO L479 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-15 06:48:30,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 330 transitions. [2022-04-15 06:48:56,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 330 edges. 326 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-15 06:48:56,247 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 330 transitions. [2022-04-15 06:48:56,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 06:48:56,247 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:48:56,247 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:48:56,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-04-15 06:48:56,448 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-15 06:48:56,448 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:48:56,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:48:56,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1853630146, now seen corresponding path program 22 times [2022-04-15 06:48:56,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:56,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2077873975] [2022-04-15 06:48:56,686 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-15 06:48:56,687 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:48:56,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1409460274, now seen corresponding path program 1 times [2022-04-15 06:48:56,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:48:56,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816166901] [2022-04-15 06:48:56,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:56,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:48:56,707 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_36.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:48:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:56,734 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_36.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:48:57,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:48:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:57,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {36216#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {36197#true} is VALID [2022-04-15 06:48:57,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {36197#true} assume true; {36197#true} is VALID [2022-04-15 06:48:57,080 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36197#true} {36197#true} #83#return; {36197#true} is VALID [2022-04-15 06:48:57,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {36197#true} call ULTIMATE.init(); {36216#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:48:57,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {36216#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {36197#true} is VALID [2022-04-15 06:48:57,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {36197#true} assume true; {36197#true} is VALID [2022-04-15 06:48:57,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36197#true} {36197#true} #83#return; {36197#true} is VALID [2022-04-15 06:48:57,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {36197#true} call #t~ret15 := main(); {36197#true} is VALID [2022-04-15 06:48:57,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {36197#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36197#true} is VALID [2022-04-15 06:48:57,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {36197#true} [157] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_513 4294967296)) (.cse1 (= |v_main_#t~post5_174| |v_main_#t~post5_173|)) (.cse2 (= v_main_~y~0_671 v_main_~y~0_670)) (.cse3 (= v_main_~x~0_513 v_main_~x~0_512)) (.cse4 (= |v_main_#t~post6_174| |v_main_#t~post6_173|))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (forall ((v_it_36 Int)) (or (< 0 (mod (+ v_main_~x~0_513 (* 4294967295 v_it_36)) 4294967296)) (not (<= (+ v_main_~y~0_671 v_it_36 1) v_main_~y~0_670)) (not (<= 1 v_it_36)))) (= v_main_~x~0_512 (+ v_main_~x~0_513 v_main_~y~0_671 (* (- 1) v_main_~y~0_670))) (< v_main_~y~0_671 v_main_~y~0_670)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_671, main_#t~post5=|v_main_#t~post5_174|, main_~x~0=v_main_~x~0_513, main_#t~post6=|v_main_#t~post6_174|} OutVars{main_~y~0=v_main_~y~0_670, main_#t~post5=|v_main_#t~post5_173|, main_~x~0=v_main_~x~0_512, main_#t~post6=|v_main_#t~post6_173|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {36197#true} is VALID [2022-04-15 06:48:57,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {36197#true} [156] 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[] {36197#true} is VALID [2022-04-15 06:48:57,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {36197#true} ~z~0 := ~y~0; {36202#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:48:57,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {36202#(= (+ 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; {36203#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:48:57,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {36203#(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; {36204#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:48:57,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {36204#(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; {36205#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:48:57,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {36205#(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; {36206#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:48:57,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {36206#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36207#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:48:57,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {36207#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 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; {36208#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 06:48:57,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {36208#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !(~z~0 % 4294967296 > 0); {36209#(and (<= (+ 6 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 6 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:48:57,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {36209#(and (<= (+ 6 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 6 (* (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; {36210#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:57,087 INFO L290 TraceCheckUtils]: 17: Hoare triple {36210#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36211#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:57,088 INFO L290 TraceCheckUtils]: 18: Hoare triple {36211#(<= main_~y~0 (+ 4 (* (div (+ main_~y~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; {36212#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:57,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {36212#(<= 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; {36213#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:57,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {36213#(<= 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; {36214#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:48:57,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {36214#(<= 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; {36215#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:48:57,092 INFO L290 TraceCheckUtils]: 22: Hoare triple {36215#(<= 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; {36198#false} is VALID [2022-04-15 06:48:57,092 INFO L290 TraceCheckUtils]: 23: Hoare triple {36198#false} assume !(~y~0 % 4294967296 > 0); {36198#false} is VALID [2022-04-15 06:48:57,092 INFO L290 TraceCheckUtils]: 24: Hoare triple {36198#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; {36198#false} is VALID [2022-04-15 06:48:57,092 INFO L290 TraceCheckUtils]: 25: Hoare triple {36198#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; {36198#false} is VALID [2022-04-15 06:48:57,092 INFO L290 TraceCheckUtils]: 26: Hoare triple {36198#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; {36198#false} is VALID [2022-04-15 06:48:57,092 INFO L290 TraceCheckUtils]: 27: Hoare triple {36198#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; {36198#false} is VALID [2022-04-15 06:48:57,092 INFO L290 TraceCheckUtils]: 28: Hoare triple {36198#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; {36198#false} is VALID [2022-04-15 06:48:57,092 INFO L290 TraceCheckUtils]: 29: Hoare triple {36198#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; {36198#false} is VALID [2022-04-15 06:48:57,092 INFO L290 TraceCheckUtils]: 30: Hoare triple {36198#false} assume !(~x~0 % 4294967296 > 0); {36198#false} is VALID [2022-04-15 06:48:57,092 INFO L290 TraceCheckUtils]: 31: Hoare triple {36198#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {36198#false} is VALID [2022-04-15 06:48:57,092 INFO L290 TraceCheckUtils]: 32: Hoare triple {36198#false} assume !(~z~0 % 4294967296 > 0); {36198#false} is VALID [2022-04-15 06:48:57,092 INFO L272 TraceCheckUtils]: 33: Hoare triple {36198#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {36198#false} is VALID [2022-04-15 06:48:57,092 INFO L290 TraceCheckUtils]: 34: Hoare triple {36198#false} ~cond := #in~cond; {36198#false} is VALID [2022-04-15 06:48:57,092 INFO L290 TraceCheckUtils]: 35: Hoare triple {36198#false} assume 0 == ~cond; {36198#false} is VALID [2022-04-15 06:48:57,092 INFO L290 TraceCheckUtils]: 36: Hoare triple {36198#false} assume !false; {36198#false} is VALID [2022-04-15 06:48:57,093 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-15 06:48:57,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:48:57,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816166901] [2022-04-15 06:48:57,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816166901] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:48:57,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087729749] [2022-04-15 06:48:57,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:57,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:48:57,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:48:57,094 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:48:57,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-15 06:48:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:57,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 06:48:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:57,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:48:57,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {36197#true} call ULTIMATE.init(); {36197#true} is VALID [2022-04-15 06:48:57,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {36197#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {36197#true} is VALID [2022-04-15 06:48:57,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {36197#true} assume true; {36197#true} is VALID [2022-04-15 06:48:57,507 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36197#true} {36197#true} #83#return; {36197#true} is VALID [2022-04-15 06:48:57,507 INFO L272 TraceCheckUtils]: 4: Hoare triple {36197#true} call #t~ret15 := main(); {36197#true} is VALID [2022-04-15 06:48:57,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {36197#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36197#true} is VALID [2022-04-15 06:48:57,508 INFO L290 TraceCheckUtils]: 6: Hoare triple {36197#true} [157] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_513 4294967296)) (.cse1 (= |v_main_#t~post5_174| |v_main_#t~post5_173|)) (.cse2 (= v_main_~y~0_671 v_main_~y~0_670)) (.cse3 (= v_main_~x~0_513 v_main_~x~0_512)) (.cse4 (= |v_main_#t~post6_174| |v_main_#t~post6_173|))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (forall ((v_it_36 Int)) (or (< 0 (mod (+ v_main_~x~0_513 (* 4294967295 v_it_36)) 4294967296)) (not (<= (+ v_main_~y~0_671 v_it_36 1) v_main_~y~0_670)) (not (<= 1 v_it_36)))) (= v_main_~x~0_512 (+ v_main_~x~0_513 v_main_~y~0_671 (* (- 1) v_main_~y~0_670))) (< v_main_~y~0_671 v_main_~y~0_670)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_671, main_#t~post5=|v_main_#t~post5_174|, main_~x~0=v_main_~x~0_513, main_#t~post6=|v_main_#t~post6_174|} OutVars{main_~y~0=v_main_~y~0_670, main_#t~post5=|v_main_#t~post5_173|, main_~x~0=v_main_~x~0_512, main_#t~post6=|v_main_#t~post6_173|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {36197#true} is VALID [2022-04-15 06:48:57,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {36197#true} [156] 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[] {36197#true} is VALID [2022-04-15 06:48:57,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {36197#true} ~z~0 := ~y~0; {36197#true} is VALID [2022-04-15 06:48:57,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {36197#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; {36247#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:48:57,509 INFO L290 TraceCheckUtils]: 10: Hoare triple {36247#(< 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; {36251#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:48:57,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {36251#(< 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; {36255#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 06:48:57,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {36255#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36259#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 06:48:57,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {36259#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36263#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 06:48:57,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {36263#(< 0 (mod (+ 5 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; {36267#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-15 06:48:57,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {36267#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !(~z~0 % 4294967296 > 0); {36267#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-15 06:48:57,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {36267#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36263#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 06:48:57,515 INFO L290 TraceCheckUtils]: 17: Hoare triple {36263#(< 0 (mod (+ 5 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; {36259#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 06:48:57,516 INFO L290 TraceCheckUtils]: 18: Hoare triple {36259#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36255#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 06:48:57,516 INFO L290 TraceCheckUtils]: 19: Hoare triple {36255#(< 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; {36251#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:48:57,517 INFO L290 TraceCheckUtils]: 20: Hoare triple {36251#(< 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; {36247#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:48:57,518 INFO L290 TraceCheckUtils]: 21: Hoare triple {36247#(< 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; {36289#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:48:57,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {36289#(< 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; {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:48:57,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:48:57,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {36293#(< 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; {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:48:57,520 INFO L290 TraceCheckUtils]: 25: Hoare triple {36293#(< 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; {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:48:57,520 INFO L290 TraceCheckUtils]: 26: Hoare triple {36293#(< 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; {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:48:57,520 INFO L290 TraceCheckUtils]: 27: Hoare triple {36293#(< 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; {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:48:57,521 INFO L290 TraceCheckUtils]: 28: Hoare triple {36293#(< 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; {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:48:57,521 INFO L290 TraceCheckUtils]: 29: Hoare triple {36293#(< 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; {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:48:57,521 INFO L290 TraceCheckUtils]: 30: Hoare triple {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:48:57,523 INFO L290 TraceCheckUtils]: 31: Hoare triple {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {36289#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:48:57,524 INFO L290 TraceCheckUtils]: 32: Hoare triple {36289#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {36198#false} is VALID [2022-04-15 06:48:57,524 INFO L272 TraceCheckUtils]: 33: Hoare triple {36198#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {36198#false} is VALID [2022-04-15 06:48:57,524 INFO L290 TraceCheckUtils]: 34: Hoare triple {36198#false} ~cond := #in~cond; {36198#false} is VALID [2022-04-15 06:48:57,524 INFO L290 TraceCheckUtils]: 35: Hoare triple {36198#false} assume 0 == ~cond; {36198#false} is VALID [2022-04-15 06:48:57,524 INFO L290 TraceCheckUtils]: 36: Hoare triple {36198#false} assume !false; {36198#false} is VALID [2022-04-15 06:48:57,524 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 6 proven. 44 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-15 06:48:57,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:48:57,673 INFO L290 TraceCheckUtils]: 36: Hoare triple {36198#false} assume !false; {36198#false} is VALID [2022-04-15 06:48:57,674 INFO L290 TraceCheckUtils]: 35: Hoare triple {36198#false} assume 0 == ~cond; {36198#false} is VALID [2022-04-15 06:48:57,674 INFO L290 TraceCheckUtils]: 34: Hoare triple {36198#false} ~cond := #in~cond; {36198#false} is VALID [2022-04-15 06:48:57,674 INFO L272 TraceCheckUtils]: 33: Hoare triple {36198#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {36198#false} is VALID [2022-04-15 06:48:57,674 INFO L290 TraceCheckUtils]: 32: Hoare triple {36289#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {36198#false} is VALID [2022-04-15 06:48:57,675 INFO L290 TraceCheckUtils]: 31: Hoare triple {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {36289#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:48:57,675 INFO L290 TraceCheckUtils]: 30: Hoare triple {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:48:57,676 INFO L290 TraceCheckUtils]: 29: Hoare triple {36293#(< 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; {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:48:57,676 INFO L290 TraceCheckUtils]: 28: Hoare triple {36293#(< 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; {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:48:57,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {36293#(< 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; {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:48:57,677 INFO L290 TraceCheckUtils]: 26: Hoare triple {36293#(< 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; {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:48:57,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {36293#(< 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; {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:48:57,677 INFO L290 TraceCheckUtils]: 24: Hoare triple {36293#(< 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; {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:48:57,678 INFO L290 TraceCheckUtils]: 23: Hoare triple {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:48:57,679 INFO L290 TraceCheckUtils]: 22: Hoare triple {36289#(< 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; {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:48:57,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {36247#(< 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; {36289#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:48:57,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {36251#(< 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; {36247#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:48:57,681 INFO L290 TraceCheckUtils]: 19: Hoare triple {36255#(< 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; {36251#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:48:57,682 INFO L290 TraceCheckUtils]: 18: Hoare triple {36259#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36255#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 06:48:57,682 INFO L290 TraceCheckUtils]: 17: Hoare triple {36263#(< 0 (mod (+ 5 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; {36259#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 06:48:57,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {36267#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36263#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 06:48:57,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {36267#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !(~z~0 % 4294967296 > 0); {36267#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-15 06:48:57,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {36263#(< 0 (mod (+ 5 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; {36267#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-15 06:48:57,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {36259#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36263#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 06:48:57,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {36255#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36259#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 06:48:57,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {36251#(< 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; {36255#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 06:48:57,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {36247#(< 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; {36251#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:48:57,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {36197#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; {36247#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:48:57,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {36197#true} ~z~0 := ~y~0; {36197#true} is VALID [2022-04-15 06:48:57,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {36197#true} [156] 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[] {36197#true} is VALID [2022-04-15 06:48:57,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {36197#true} [157] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_513 4294967296)) (.cse1 (= |v_main_#t~post5_174| |v_main_#t~post5_173|)) (.cse2 (= v_main_~y~0_671 v_main_~y~0_670)) (.cse3 (= v_main_~x~0_513 v_main_~x~0_512)) (.cse4 (= |v_main_#t~post6_174| |v_main_#t~post6_173|))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (forall ((v_it_36 Int)) (or (< 0 (mod (+ v_main_~x~0_513 (* 4294967295 v_it_36)) 4294967296)) (not (<= (+ v_main_~y~0_671 v_it_36 1) v_main_~y~0_670)) (not (<= 1 v_it_36)))) (= v_main_~x~0_512 (+ v_main_~x~0_513 v_main_~y~0_671 (* (- 1) v_main_~y~0_670))) (< v_main_~y~0_671 v_main_~y~0_670)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_671, main_#t~post5=|v_main_#t~post5_174|, main_~x~0=v_main_~x~0_513, main_#t~post6=|v_main_#t~post6_174|} OutVars{main_~y~0=v_main_~y~0_670, main_#t~post5=|v_main_#t~post5_173|, main_~x~0=v_main_~x~0_512, main_#t~post6=|v_main_#t~post6_173|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {36197#true} is VALID [2022-04-15 06:48:57,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {36197#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36197#true} is VALID [2022-04-15 06:48:57,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {36197#true} call #t~ret15 := main(); {36197#true} is VALID [2022-04-15 06:48:57,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36197#true} {36197#true} #83#return; {36197#true} is VALID [2022-04-15 06:48:57,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {36197#true} assume true; {36197#true} is VALID [2022-04-15 06:48:57,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {36197#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {36197#true} is VALID [2022-04-15 06:48:57,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {36197#true} call ULTIMATE.init(); {36197#true} is VALID [2022-04-15 06:48:57,698 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 6 proven. 44 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-15 06:48:57,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087729749] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:48:57,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:48:57,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 10] total 25 [2022-04-15 06:48:58,390 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:48:58,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2077873975] [2022-04-15 06:48:58,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2077873975] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:48:58,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:48:58,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 06:48:58,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61667312] [2022-04-15 06:48:58,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:48:58,391 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.434782608695652) internal successors, (33), 22 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-15 06:48:58,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:48:58,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.434782608695652) internal successors, (33), 22 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:58,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:48:58,488 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 06:48:58,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:58,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 06:48:58,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=856, Unknown=0, NotChecked=0, Total=930 [2022-04-15 06:48:58,488 INFO L87 Difference]: Start difference. First operand 250 states and 330 transitions. Second operand has 23 states, 23 states have (on average 1.434782608695652) internal successors, (33), 22 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:14,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:14,554 INFO L93 Difference]: Finished difference Result 407 states and 499 transitions. [2022-04-15 06:49:14,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 06:49:14,554 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.434782608695652) internal successors, (33), 22 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-15 06:49:14,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:49:14,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.434782608695652) internal successors, (33), 22 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:14,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 92 transitions. [2022-04-15 06:49:14,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.434782608695652) internal successors, (33), 22 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:14,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 92 transitions. [2022-04-15 06:49:14,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 92 transitions. [2022-04-15 06:49:14,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:49:14,876 INFO L225 Difference]: With dead ends: 407 [2022-04-15 06:49:14,876 INFO L226 Difference]: Without dead ends: 298 [2022-04-15 06:49:14,877 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=415, Invalid=3491, Unknown=0, NotChecked=0, Total=3906 [2022-04-15 06:49:14,877 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 65 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:49:14,877 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 107 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-15 06:49:14,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-04-15 06:49:16,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 187. [2022-04-15 06:49:16,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:49:16,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 298 states. Second operand has 187 states, 182 states have (on average 1.3516483516483517) internal successors, (246), 182 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:16,854 INFO L74 IsIncluded]: Start isIncluded. First operand 298 states. Second operand has 187 states, 182 states have (on average 1.3516483516483517) internal successors, (246), 182 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:16,855 INFO L87 Difference]: Start difference. First operand 298 states. Second operand has 187 states, 182 states have (on average 1.3516483516483517) internal successors, (246), 182 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:16,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:16,858 INFO L93 Difference]: Finished difference Result 298 states and 367 transitions. [2022-04-15 06:49:16,858 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 367 transitions. [2022-04-15 06:49:16,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:16,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:16,858 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 182 states have (on average 1.3516483516483517) internal successors, (246), 182 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 298 states. [2022-04-15 06:49:16,858 INFO L87 Difference]: Start difference. First operand has 187 states, 182 states have (on average 1.3516483516483517) internal successors, (246), 182 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 298 states. [2022-04-15 06:49:16,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:16,862 INFO L93 Difference]: Finished difference Result 298 states and 367 transitions. [2022-04-15 06:49:16,862 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 367 transitions. [2022-04-15 06:49:16,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:16,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:16,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:49:16,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:49:16,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.3516483516483517) internal successors, (246), 182 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:16,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 250 transitions. [2022-04-15 06:49:16,865 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 250 transitions. Word has length 42 [2022-04-15 06:49:16,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:49:16,865 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 250 transitions. [2022-04-15 06:49:16,865 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.434782608695652) internal successors, (33), 22 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:16,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 187 states and 250 transitions. [2022-04-15 06:49:39,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 246 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-15 06:49:39,634 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 250 transitions. [2022-04-15 06:49:39,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 06:49:39,634 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:49:39,634 INFO L499 BasicCegarLoop]: trace histogram [11, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:49:39,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-15 06:49:39,835 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-15 06:49:39,835 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:49:39,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:49:39,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1803306814, now seen corresponding path program 11 times [2022-04-15 06:49:39,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:39,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [374490175] [2022-04-15 06:49:40,072 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-15 06:49:40,078 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:49:40,080 INFO L85 PathProgramCache]: Analyzing trace with hash -47197810, now seen corresponding path program 1 times [2022-04-15 06:49:40,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:49:40,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146286415] [2022-04-15 06:49:40,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:40,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:49:40,094 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_37.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:49:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:40,118 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_37.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:49:40,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:49:40,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:40,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {38320#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {38302#true} is VALID [2022-04-15 06:49:40,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {38302#true} assume true; {38302#true} is VALID [2022-04-15 06:49:40,377 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38302#true} {38302#true} #83#return; {38302#true} is VALID [2022-04-15 06:49:40,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {38302#true} call ULTIMATE.init(); {38320#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:49:40,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {38320#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {38302#true} is VALID [2022-04-15 06:49:40,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {38302#true} assume true; {38302#true} is VALID [2022-04-15 06:49:40,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38302#true} {38302#true} #83#return; {38302#true} is VALID [2022-04-15 06:49:40,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {38302#true} call #t~ret15 := main(); {38302#true} is VALID [2022-04-15 06:49:40,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {38302#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {38302#true} is VALID [2022-04-15 06:49:40,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {38302#true} [159] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_537 4294967296)) (.cse1 (= |v_main_#t~post6_179| |v_main_#t~post6_178|)) (.cse2 (= |v_main_#t~post5_179| |v_main_#t~post5_178|)) (.cse3 (= v_main_~y~0_698 v_main_~y~0_697)) (.cse4 (= v_main_~x~0_537 v_main_~x~0_536))) (or (and (= v_main_~x~0_536 (+ v_main_~x~0_537 v_main_~y~0_698 (* (- 1) v_main_~y~0_697))) (< v_main_~y~0_698 v_main_~y~0_697) (forall ((v_it_37 Int)) (or (not (<= (+ v_main_~y~0_698 v_it_37 1) v_main_~y~0_697)) (not (<= 1 v_it_37)) (< 0 (mod (+ v_main_~x~0_537 (* 4294967295 v_it_37)) 4294967296)))) (< 0 .cse0)) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_698, main_#t~post5=|v_main_#t~post5_179|, main_~x~0=v_main_~x~0_537, main_#t~post6=|v_main_#t~post6_179|} OutVars{main_~y~0=v_main_~y~0_697, main_#t~post5=|v_main_#t~post5_178|, main_~x~0=v_main_~x~0_536, main_#t~post6=|v_main_#t~post6_178|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {38302#true} is VALID [2022-04-15 06:49:40,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {38302#true} [158] 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[] {38307#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:49:40,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {38307#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {38307#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:49:40,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {38307#(<= 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; {38308#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:49:40,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {38308#(<= 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; {38309#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:49:40,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {38309#(<= 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; {38310#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:49:40,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {38310#(<= 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; {38311#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:49:40,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {38311#(<= 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; {38312#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:49:40,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {38312#(<= 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; {38313#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:49:40,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {38313#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38314#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:49:40,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {38314#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38315#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:49:40,386 INFO L290 TraceCheckUtils]: 17: Hoare triple {38315#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38316#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:49:40,387 INFO L290 TraceCheckUtils]: 18: Hoare triple {38316#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38317#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:49:40,388 INFO L290 TraceCheckUtils]: 19: Hoare triple {38317#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38318#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-15 06:49:40,388 INFO L290 TraceCheckUtils]: 20: Hoare triple {38318#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !(~z~0 % 4294967296 > 0); {38318#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-15 06:49:40,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {38318#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38318#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-15 06:49:40,389 INFO L290 TraceCheckUtils]: 22: Hoare triple {38318#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38318#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-15 06:49:40,389 INFO L290 TraceCheckUtils]: 23: Hoare triple {38318#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38318#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-15 06:49:40,390 INFO L290 TraceCheckUtils]: 24: Hoare triple {38318#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38318#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-15 06:49:40,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {38318#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38318#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-15 06:49:40,390 INFO L290 TraceCheckUtils]: 26: Hoare triple {38318#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38318#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-15 06:49:40,391 INFO L290 TraceCheckUtils]: 27: Hoare triple {38318#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38318#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-15 06:49:40,391 INFO L290 TraceCheckUtils]: 28: Hoare triple {38318#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38318#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-15 06:49:40,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {38318#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !(~y~0 % 4294967296 > 0); {38318#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-15 06:49:40,392 INFO L290 TraceCheckUtils]: 30: Hoare triple {38318#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {38319#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 10) main_~x~0)} is VALID [2022-04-15 06:49:40,393 INFO L290 TraceCheckUtils]: 31: Hoare triple {38319#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 10) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {38303#false} is VALID [2022-04-15 06:49:40,393 INFO L290 TraceCheckUtils]: 32: Hoare triple {38303#false} assume !(~z~0 % 4294967296 > 0); {38303#false} is VALID [2022-04-15 06:49:40,393 INFO L272 TraceCheckUtils]: 33: Hoare triple {38303#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {38303#false} is VALID [2022-04-15 06:49:40,393 INFO L290 TraceCheckUtils]: 34: Hoare triple {38303#false} ~cond := #in~cond; {38303#false} is VALID [2022-04-15 06:49:40,393 INFO L290 TraceCheckUtils]: 35: Hoare triple {38303#false} assume 0 == ~cond; {38303#false} is VALID [2022-04-15 06:49:40,393 INFO L290 TraceCheckUtils]: 36: Hoare triple {38303#false} assume !false; {38303#false} is VALID [2022-04-15 06:49:40,393 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-15 06:49:40,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:49:40,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146286415] [2022-04-15 06:49:40,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146286415] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:49:40,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174479403] [2022-04-15 06:49:40,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:40,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:49:40,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:49:40,395 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:49:40,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-15 06:49:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:40,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 58 conjunts are in the unsatisfiable core [2022-04-15 06:49:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:40,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:49:41,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {38302#true} call ULTIMATE.init(); {38302#true} is VALID [2022-04-15 06:49:41,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {38302#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {38302#true} is VALID [2022-04-15 06:49:41,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {38302#true} assume true; {38302#true} is VALID [2022-04-15 06:49:41,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38302#true} {38302#true} #83#return; {38302#true} is VALID [2022-04-15 06:49:41,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {38302#true} call #t~ret15 := main(); {38302#true} is VALID [2022-04-15 06:49:41,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {38302#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {38302#true} is VALID [2022-04-15 06:49:41,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {38302#true} [159] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_537 4294967296)) (.cse1 (= |v_main_#t~post6_179| |v_main_#t~post6_178|)) (.cse2 (= |v_main_#t~post5_179| |v_main_#t~post5_178|)) (.cse3 (= v_main_~y~0_698 v_main_~y~0_697)) (.cse4 (= v_main_~x~0_537 v_main_~x~0_536))) (or (and (= v_main_~x~0_536 (+ v_main_~x~0_537 v_main_~y~0_698 (* (- 1) v_main_~y~0_697))) (< v_main_~y~0_698 v_main_~y~0_697) (forall ((v_it_37 Int)) (or (not (<= (+ v_main_~y~0_698 v_it_37 1) v_main_~y~0_697)) (not (<= 1 v_it_37)) (< 0 (mod (+ v_main_~x~0_537 (* 4294967295 v_it_37)) 4294967296)))) (< 0 .cse0)) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_698, main_#t~post5=|v_main_#t~post5_179|, main_~x~0=v_main_~x~0_537, main_#t~post6=|v_main_#t~post6_179|} OutVars{main_~y~0=v_main_~y~0_697, main_#t~post5=|v_main_#t~post5_178|, main_~x~0=v_main_~x~0_536, main_#t~post6=|v_main_#t~post6_178|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {38302#true} is VALID [2022-04-15 06:49:41,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {38302#true} [158] 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[] {38302#true} is VALID [2022-04-15 06:49:41,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {38302#true} ~z~0 := ~y~0; {38348#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:49:41,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {38348#(= 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; {38352#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:49:41,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {38352#(= 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; {38356#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-15 06:49:41,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {38356#(= 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; {38360#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-15 06:49:41,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {38360#(= (+ (- 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; {38364#(= (+ main_~y~0 (- 3)) (+ main_~z~0 1))} is VALID [2022-04-15 06:49:41,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {38364#(= (+ 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; {38368#(= (+ main_~y~0 (- 3)) (+ main_~z~0 2))} is VALID [2022-04-15 06:49:41,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {38368#(= (+ main_~y~0 (- 3)) (+ main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38372#(= (+ main_~y~0 (- 5)) (+ main_~z~0 1))} is VALID [2022-04-15 06:49:41,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {38372#(= (+ main_~y~0 (- 5)) (+ 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; {38376#(= (+ main_~y~0 (- 6)) (+ main_~z~0 1))} is VALID [2022-04-15 06:49:41,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {38376#(= (+ main_~y~0 (- 6)) (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38380#(= (+ main_~y~0 (- 6)) (+ main_~z~0 2))} is VALID [2022-04-15 06:49:41,191 INFO L290 TraceCheckUtils]: 17: Hoare triple {38380#(= (+ main_~y~0 (- 6)) (+ 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; {38384#(= (+ main_~y~0 (- 6)) (+ main_~z~0 3))} is VALID [2022-04-15 06:49:41,192 INFO L290 TraceCheckUtils]: 18: Hoare triple {38384#(= (+ main_~y~0 (- 6)) (+ 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; {38388#(= (+ main_~y~0 (- 6)) (+ main_~z~0 4))} is VALID [2022-04-15 06:49:41,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {38388#(= (+ main_~y~0 (- 6)) (+ main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38392#(= (+ main_~z~0 1) (+ main_~y~0 (- 10)))} is VALID [2022-04-15 06:49:41,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {38392#(= (+ main_~z~0 1) (+ main_~y~0 (- 10)))} assume !(~z~0 % 4294967296 > 0); {38392#(= (+ main_~z~0 1) (+ main_~y~0 (- 10)))} is VALID [2022-04-15 06:49:41,193 INFO L290 TraceCheckUtils]: 21: Hoare triple {38392#(= (+ main_~z~0 1) (+ main_~y~0 (- 10)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38384#(= (+ main_~y~0 (- 6)) (+ main_~z~0 3))} is VALID [2022-04-15 06:49:41,194 INFO L290 TraceCheckUtils]: 22: Hoare triple {38384#(= (+ main_~y~0 (- 6)) (+ 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; {38376#(= (+ main_~y~0 (- 6)) (+ main_~z~0 1))} is VALID [2022-04-15 06:49:41,194 INFO L290 TraceCheckUtils]: 23: Hoare triple {38376#(= (+ main_~y~0 (- 6)) (+ 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; {38368#(= (+ main_~y~0 (- 3)) (+ main_~z~0 2))} is VALID [2022-04-15 06:49:41,195 INFO L290 TraceCheckUtils]: 24: Hoare triple {38368#(= (+ main_~y~0 (- 3)) (+ 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; {38408#(and (= (+ main_~y~0 (- 3)) main_~z~0) (< 0 (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-15 06:49:41,196 INFO L290 TraceCheckUtils]: 25: Hoare triple {38408#(and (= (+ main_~y~0 (- 3)) main_~z~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; {38412#(and (< 0 (mod (+ main_~z~0 3) 4294967296)) (= (+ main_~z~0 2) (+ main_~y~0 1)))} is VALID [2022-04-15 06:49:41,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {38412#(and (< 0 (mod (+ main_~z~0 3) 4294967296)) (= (+ main_~z~0 2) (+ main_~y~0 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38416#(and (= main_~z~0 (+ main_~y~0 1)) (< 0 (mod (+ main_~y~0 3) 4294967296)))} is VALID [2022-04-15 06:49:41,198 INFO L290 TraceCheckUtils]: 27: Hoare triple {38416#(and (= main_~z~0 (+ main_~y~0 1)) (< 0 (mod (+ 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; {38420#(and (= (+ (- 2) main_~z~0) (+ main_~y~0 1)) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-15 06:49:41,198 INFO L290 TraceCheckUtils]: 28: Hoare triple {38420#(and (= (+ (- 2) main_~z~0) (+ main_~y~0 1)) (< 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; {38424#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:49:41,199 INFO L290 TraceCheckUtils]: 29: Hoare triple {38424#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {38424#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:49:41,199 INFO L290 TraceCheckUtils]: 30: Hoare triple {38424#(< 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; {38424#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:49:41,199 INFO L290 TraceCheckUtils]: 31: Hoare triple {38424#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {38424#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:49:41,200 INFO L290 TraceCheckUtils]: 32: Hoare triple {38424#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {38303#false} is VALID [2022-04-15 06:49:41,200 INFO L272 TraceCheckUtils]: 33: Hoare triple {38303#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {38303#false} is VALID [2022-04-15 06:49:41,200 INFO L290 TraceCheckUtils]: 34: Hoare triple {38303#false} ~cond := #in~cond; {38303#false} is VALID [2022-04-15 06:49:41,200 INFO L290 TraceCheckUtils]: 35: Hoare triple {38303#false} assume 0 == ~cond; {38303#false} is VALID [2022-04-15 06:49:41,200 INFO L290 TraceCheckUtils]: 36: Hoare triple {38303#false} assume !false; {38303#false} is VALID [2022-04-15 06:49:41,200 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:49:41,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:49:42,497 INFO L290 TraceCheckUtils]: 36: Hoare triple {38303#false} assume !false; {38303#false} is VALID [2022-04-15 06:49:42,497 INFO L290 TraceCheckUtils]: 35: Hoare triple {38303#false} assume 0 == ~cond; {38303#false} is VALID [2022-04-15 06:49:42,497 INFO L290 TraceCheckUtils]: 34: Hoare triple {38303#false} ~cond := #in~cond; {38303#false} is VALID [2022-04-15 06:49:42,497 INFO L272 TraceCheckUtils]: 33: Hoare triple {38303#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {38303#false} is VALID [2022-04-15 06:49:42,497 INFO L290 TraceCheckUtils]: 32: Hoare triple {38424#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {38303#false} is VALID [2022-04-15 06:49:42,498 INFO L290 TraceCheckUtils]: 31: Hoare triple {38424#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {38424#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:49:42,498 INFO L290 TraceCheckUtils]: 30: Hoare triple {38424#(< 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; {38424#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:49:42,498 INFO L290 TraceCheckUtils]: 29: Hoare triple {38424#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {38424#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:49:42,499 INFO L290 TraceCheckUtils]: 28: Hoare triple {38473#(< 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; {38424#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:49:42,500 INFO L290 TraceCheckUtils]: 27: Hoare triple {38477#(< 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; {38473#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:49:42,500 INFO L290 TraceCheckUtils]: 26: Hoare triple {38481#(< 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; {38477#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:49:42,501 INFO L290 TraceCheckUtils]: 25: Hoare triple {38485#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38481#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 06:49:42,502 INFO L290 TraceCheckUtils]: 24: Hoare triple {38489#(or (<= (mod main_~y~0 4294967296) 0) (< 0 (mod (+ 5 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; {38485#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 06:49:42,503 INFO L290 TraceCheckUtils]: 23: Hoare triple {38493#(or (< 0 (mod (+ main_~z~0 6) 4294967296)) (<= (mod (+ main_~y~0 4294967295) 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38489#(or (<= (mod main_~y~0 4294967296) 0) (< 0 (mod (+ 5 main_~z~0) 4294967296)))} is VALID [2022-04-15 06:49:42,504 INFO L290 TraceCheckUtils]: 22: Hoare triple {38497#(or (< 0 (mod (+ 7 main_~z~0) 4294967296)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38493#(or (< 0 (mod (+ main_~z~0 6) 4294967296)) (<= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-15 06:49:42,505 INFO L290 TraceCheckUtils]: 21: Hoare triple {38501#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 8) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38497#(or (< 0 (mod (+ 7 main_~z~0) 4294967296)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-15 06:49:42,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {38501#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 8) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {38501#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 8) 4294967296)))} is VALID [2022-04-15 06:49:42,506 INFO L290 TraceCheckUtils]: 19: Hoare triple {38508#(or (< 0 (mod (+ 7 main_~z~0) 4294967296)) (<= (mod (+ main_~y~0 4294967293) 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; {38501#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 8) 4294967296)))} is VALID [2022-04-15 06:49:42,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {38512#(or (< 0 (mod (+ main_~z~0 6) 4294967296)) (<= (mod (+ main_~y~0 4294967293) 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; {38508#(or (< 0 (mod (+ 7 main_~z~0) 4294967296)) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0))} is VALID [2022-04-15 06:49:42,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {38516#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ 5 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; {38512#(or (< 0 (mod (+ main_~z~0 6) 4294967296)) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0))} is VALID [2022-04-15 06:49:42,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {38520#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38516#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ 5 main_~z~0) 4294967296)))} is VALID [2022-04-15 06:49:42,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {38524#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 3) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38520#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4) 4294967296)))} is VALID [2022-04-15 06:49:42,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {38528#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (mod (+ main_~y~0 4294967293) 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; {38524#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 3) 4294967296)))} is VALID [2022-04-15 06:49:42,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {38532#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (mod (+ main_~y~0 4294967293) 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; {38528#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0))} is VALID [2022-04-15 06:49:42,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {38536#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 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; {38532#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0))} is VALID [2022-04-15 06:49:42,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {38540#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38536#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 06:49:42,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {38544#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 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; {38540#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:49:42,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {38548#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 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; {38544#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-15 06:49:42,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {38302#true} ~z~0 := ~y~0; {38548#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:49:42,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {38302#true} [158] 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[] {38302#true} is VALID [2022-04-15 06:49:42,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {38302#true} [159] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_537 4294967296)) (.cse1 (= |v_main_#t~post6_179| |v_main_#t~post6_178|)) (.cse2 (= |v_main_#t~post5_179| |v_main_#t~post5_178|)) (.cse3 (= v_main_~y~0_698 v_main_~y~0_697)) (.cse4 (= v_main_~x~0_537 v_main_~x~0_536))) (or (and (= v_main_~x~0_536 (+ v_main_~x~0_537 v_main_~y~0_698 (* (- 1) v_main_~y~0_697))) (< v_main_~y~0_698 v_main_~y~0_697) (forall ((v_it_37 Int)) (or (not (<= (+ v_main_~y~0_698 v_it_37 1) v_main_~y~0_697)) (not (<= 1 v_it_37)) (< 0 (mod (+ v_main_~x~0_537 (* 4294967295 v_it_37)) 4294967296)))) (< 0 .cse0)) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_698, main_#t~post5=|v_main_#t~post5_179|, main_~x~0=v_main_~x~0_537, main_#t~post6=|v_main_#t~post6_179|} OutVars{main_~y~0=v_main_~y~0_697, main_#t~post5=|v_main_#t~post5_178|, main_~x~0=v_main_~x~0_536, main_#t~post6=|v_main_#t~post6_178|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {38302#true} is VALID [2022-04-15 06:49:42,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {38302#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {38302#true} is VALID [2022-04-15 06:49:42,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {38302#true} call #t~ret15 := main(); {38302#true} is VALID [2022-04-15 06:49:42,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38302#true} {38302#true} #83#return; {38302#true} is VALID [2022-04-15 06:49:42,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {38302#true} assume true; {38302#true} is VALID [2022-04-15 06:49:42,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {38302#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {38302#true} is VALID [2022-04-15 06:49:42,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {38302#true} call ULTIMATE.init(); {38302#true} is VALID [2022-04-15 06:49:42,517 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:49:42,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174479403] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:49:42,517 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:49:42,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 22] total 52 [2022-04-15 06:49:43,670 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:49:43,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [374490175] [2022-04-15 06:49:43,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [374490175] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:49:43,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:49:43,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 06:49:43,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324511364] [2022-04-15 06:49:43,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:49:43,670 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-15 06:49:43,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:49:43,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:43,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:49:43,773 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 06:49:43,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:43,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 06:49:43,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=3072, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 06:49:43,774 INFO L87 Difference]: Start difference. First operand 187 states and 250 transitions. Second operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:54,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:54,159 INFO L93 Difference]: Finished difference Result 403 states and 606 transitions. [2022-04-15 06:49:54,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 06:49:54,159 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-15 06:49:54,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:49:54,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:54,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 137 transitions. [2022-04-15 06:49:54,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:54,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 137 transitions. [2022-04-15 06:49:54,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 137 transitions. [2022-04-15 06:49:54,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:49:54,642 INFO L225 Difference]: With dead ends: 403 [2022-04-15 06:49:54,642 INFO L226 Difference]: Without dead ends: 375 [2022-04-15 06:49:54,643 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=587, Invalid=6219, Unknown=0, NotChecked=0, Total=6806 [2022-04-15 06:49:54,643 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 198 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:49:54,643 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 44 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-15 06:49:54,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-04-15 06:49:56,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 202. [2022-04-15 06:49:56,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:49:56,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 375 states. Second operand has 202 states, 197 states have (on average 1.3553299492385786) internal successors, (267), 197 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:56,965 INFO L74 IsIncluded]: Start isIncluded. First operand 375 states. Second operand has 202 states, 197 states have (on average 1.3553299492385786) internal successors, (267), 197 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:56,965 INFO L87 Difference]: Start difference. First operand 375 states. Second operand has 202 states, 197 states have (on average 1.3553299492385786) internal successors, (267), 197 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:56,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:56,972 INFO L93 Difference]: Finished difference Result 375 states and 518 transitions. [2022-04-15 06:49:56,972 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 518 transitions. [2022-04-15 06:49:56,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:56,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:56,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 202 states, 197 states have (on average 1.3553299492385786) internal successors, (267), 197 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 375 states. [2022-04-15 06:49:56,973 INFO L87 Difference]: Start difference. First operand has 202 states, 197 states have (on average 1.3553299492385786) internal successors, (267), 197 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 375 states. [2022-04-15 06:49:56,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:56,981 INFO L93 Difference]: Finished difference Result 375 states and 518 transitions. [2022-04-15 06:49:56,981 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 518 transitions. [2022-04-15 06:49:56,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:56,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:56,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:49:56,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:49:56,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 197 states have (on average 1.3553299492385786) internal successors, (267), 197 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:56,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 271 transitions. [2022-04-15 06:49:56,985 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 271 transitions. Word has length 42 [2022-04-15 06:49:56,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:49:56,986 INFO L478 AbstractCegarLoop]: Abstraction has 202 states and 271 transitions. [2022-04-15 06:49:56,986 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:56,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 202 states and 271 transitions. [2022-04-15 06:50:23,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 271 edges. 265 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-04-15 06:50:23,867 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 271 transitions. [2022-04-15 06:50:23,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 06:50:23,867 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:50:23,868 INFO L499 BasicCegarLoop]: trace histogram [12, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:50:23,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-04-15 06:50:24,068 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:50:24,068 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:50:24,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:50:24,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1539553968, now seen corresponding path program 12 times [2022-04-15 06:50:24,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:50:24,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1501592060] [2022-04-15 06:50:26,334 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-15 06:50:26,336 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:50:26,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1958390204, now seen corresponding path program 1 times [2022-04-15 06:50:26,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:50:26,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381551713] [2022-04-15 06:50:26,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:50:26,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:50:26,349 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_38.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:50:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:26,403 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_38.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:50:26,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:50:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:26,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {40613#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40594#true} is VALID [2022-04-15 06:50:26,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {40594#true} assume true; {40594#true} is VALID [2022-04-15 06:50:26,805 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40594#true} {40594#true} #83#return; {40594#true} is VALID [2022-04-15 06:50:26,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {40594#true} call ULTIMATE.init(); {40613#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:50:26,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {40613#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40594#true} is VALID [2022-04-15 06:50:26,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {40594#true} assume true; {40594#true} is VALID [2022-04-15 06:50:26,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40594#true} {40594#true} #83#return; {40594#true} is VALID [2022-04-15 06:50:26,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {40594#true} call #t~ret15 := main(); {40594#true} is VALID [2022-04-15 06:50:26,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {40594#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40594#true} is VALID [2022-04-15 06:50:26,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {40594#true} [161] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_727 v_main_~y~0_726)) (.cse1 (= |v_main_#t~post5_184| |v_main_#t~post5_183|)) (.cse2 (= |v_main_#t~post6_184| |v_main_#t~post6_183|)) (.cse3 (= v_main_~x~0_561 v_main_~x~0_560)) (.cse4 (mod v_main_~x~0_561 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (< v_main_~y~0_727 v_main_~y~0_726) (< 0 .cse4) (forall ((v_it_38 Int)) (or (not (<= 1 v_it_38)) (< 0 (mod (+ v_main_~x~0_561 (* 4294967295 v_it_38)) 4294967296)) (not (<= (+ v_main_~y~0_727 v_it_38 1) v_main_~y~0_726)))) (= v_main_~x~0_560 (+ v_main_~x~0_561 (* (- 1) v_main_~y~0_726) v_main_~y~0_727))))) InVars {main_~y~0=v_main_~y~0_727, main_#t~post5=|v_main_#t~post5_184|, main_~x~0=v_main_~x~0_561, main_#t~post6=|v_main_#t~post6_184|} OutVars{main_~y~0=v_main_~y~0_726, main_#t~post5=|v_main_#t~post5_183|, main_~x~0=v_main_~x~0_560, main_#t~post6=|v_main_#t~post6_183|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {40594#true} is VALID [2022-04-15 06:50:26,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {40594#true} [160] 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[] {40599#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:50:26,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {40599#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {40599#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:50:26,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {40599#(<= 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; {40600#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:50:26,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {40600#(<= 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; {40601#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:50:26,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {40601#(<= 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; {40602#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:50:26,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {40602#(<= 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; {40603#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:50:26,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {40603#(<= 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; {40604#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:50:26,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {40604#(<= 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; {40605#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:50:26,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {40605#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40606#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:50:26,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {40606#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40607#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:50:26,817 INFO L290 TraceCheckUtils]: 17: Hoare triple {40607#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40608#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:50:26,818 INFO L290 TraceCheckUtils]: 18: Hoare triple {40608#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40609#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:50:26,819 INFO L290 TraceCheckUtils]: 19: Hoare triple {40609#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40610#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-15 06:50:26,820 INFO L290 TraceCheckUtils]: 20: Hoare triple {40610#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40611#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-15 06:50:26,821 INFO L290 TraceCheckUtils]: 21: Hoare triple {40611#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !(~z~0 % 4294967296 > 0); {40611#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-15 06:50:26,821 INFO L290 TraceCheckUtils]: 22: Hoare triple {40611#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40611#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-15 06:50:26,822 INFO L290 TraceCheckUtils]: 23: Hoare triple {40611#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40611#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-15 06:50:26,822 INFO L290 TraceCheckUtils]: 24: Hoare triple {40611#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40611#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-15 06:50:26,823 INFO L290 TraceCheckUtils]: 25: Hoare triple {40611#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40611#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-15 06:50:26,823 INFO L290 TraceCheckUtils]: 26: Hoare triple {40611#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40611#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-15 06:50:26,824 INFO L290 TraceCheckUtils]: 27: Hoare triple {40611#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40611#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-15 06:50:26,824 INFO L290 TraceCheckUtils]: 28: Hoare triple {40611#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40611#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-15 06:50:26,825 INFO L290 TraceCheckUtils]: 29: Hoare triple {40611#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40611#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-15 06:50:26,825 INFO L290 TraceCheckUtils]: 30: Hoare triple {40611#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !(~y~0 % 4294967296 > 0); {40611#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-15 06:50:26,826 INFO L290 TraceCheckUtils]: 31: Hoare triple {40611#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {40612#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 11) main_~x~0)} is VALID [2022-04-15 06:50:26,827 INFO L290 TraceCheckUtils]: 32: Hoare triple {40612#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 11) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {40595#false} is VALID [2022-04-15 06:50:26,827 INFO L290 TraceCheckUtils]: 33: Hoare triple {40595#false} assume !(~z~0 % 4294967296 > 0); {40595#false} is VALID [2022-04-15 06:50:26,827 INFO L272 TraceCheckUtils]: 34: Hoare triple {40595#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {40595#false} is VALID [2022-04-15 06:50:26,827 INFO L290 TraceCheckUtils]: 35: Hoare triple {40595#false} ~cond := #in~cond; {40595#false} is VALID [2022-04-15 06:50:26,827 INFO L290 TraceCheckUtils]: 36: Hoare triple {40595#false} assume 0 == ~cond; {40595#false} is VALID [2022-04-15 06:50:26,827 INFO L290 TraceCheckUtils]: 37: Hoare triple {40595#false} assume !false; {40595#false} is VALID [2022-04-15 06:50:26,828 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-15 06:50:26,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:50:26,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381551713] [2022-04-15 06:50:26,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381551713] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:50:26,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355173536] [2022-04-15 06:50:26,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:50:26,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:50:26,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:50:26,829 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:50:26,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-15 06:50:26,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:26,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-15 06:50:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:26,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:50:27,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {40594#true} call ULTIMATE.init(); {40594#true} is VALID [2022-04-15 06:50:27,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {40594#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40594#true} is VALID [2022-04-15 06:50:27,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {40594#true} assume true; {40594#true} is VALID [2022-04-15 06:50:27,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40594#true} {40594#true} #83#return; {40594#true} is VALID [2022-04-15 06:50:27,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {40594#true} call #t~ret15 := main(); {40594#true} is VALID [2022-04-15 06:50:27,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {40594#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40594#true} is VALID [2022-04-15 06:50:27,810 INFO L290 TraceCheckUtils]: 6: Hoare triple {40594#true} [161] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_727 v_main_~y~0_726)) (.cse1 (= |v_main_#t~post5_184| |v_main_#t~post5_183|)) (.cse2 (= |v_main_#t~post6_184| |v_main_#t~post6_183|)) (.cse3 (= v_main_~x~0_561 v_main_~x~0_560)) (.cse4 (mod v_main_~x~0_561 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (< v_main_~y~0_727 v_main_~y~0_726) (< 0 .cse4) (forall ((v_it_38 Int)) (or (not (<= 1 v_it_38)) (< 0 (mod (+ v_main_~x~0_561 (* 4294967295 v_it_38)) 4294967296)) (not (<= (+ v_main_~y~0_727 v_it_38 1) v_main_~y~0_726)))) (= v_main_~x~0_560 (+ v_main_~x~0_561 (* (- 1) v_main_~y~0_726) v_main_~y~0_727))))) InVars {main_~y~0=v_main_~y~0_727, main_#t~post5=|v_main_#t~post5_184|, main_~x~0=v_main_~x~0_561, main_#t~post6=|v_main_#t~post6_184|} OutVars{main_~y~0=v_main_~y~0_726, main_#t~post5=|v_main_#t~post5_183|, main_~x~0=v_main_~x~0_560, main_#t~post6=|v_main_#t~post6_183|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {40594#true} is VALID [2022-04-15 06:50:27,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {40594#true} [160] 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[] {40594#true} is VALID [2022-04-15 06:50:27,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {40594#true} ~z~0 := ~y~0; {40641#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:50:27,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {40641#(= 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; {40645#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:50:27,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {40645#(= 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; {40649#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:50:27,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {40649#(= (+ 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; {40653#(= (+ main_~z~0 2) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:50:27,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {40653#(= (+ 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; {40657#(= (+ main_~z~0 3) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:50:27,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {40657#(= (+ 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; {40661#(= (+ main_~y~0 (- 4)) (+ main_~z~0 1))} is VALID [2022-04-15 06:50:27,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {40661#(= (+ 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; {40665#(= (+ main_~y~0 (- 4)) (+ main_~z~0 2))} is VALID [2022-04-15 06:50:27,814 INFO L290 TraceCheckUtils]: 15: Hoare triple {40665#(= (+ main_~y~0 (- 4)) (+ 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; {40669#(= (+ main_~y~0 (- 6)) (+ main_~z~0 1))} is VALID [2022-04-15 06:50:27,815 INFO L290 TraceCheckUtils]: 16: Hoare triple {40669#(= (+ main_~y~0 (- 6)) (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40673#(= (+ main_~z~0 1) (+ main_~y~0 (- 7)))} is VALID [2022-04-15 06:50:27,815 INFO L290 TraceCheckUtils]: 17: Hoare triple {40673#(= (+ main_~z~0 1) (+ main_~y~0 (- 7)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40677#(= (+ main_~z~0 1) (+ main_~y~0 (- 8)))} is VALID [2022-04-15 06:50:27,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {40677#(= (+ main_~z~0 1) (+ main_~y~0 (- 8)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40681#(= (+ (- 9) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-15 06:50:27,817 INFO L290 TraceCheckUtils]: 19: Hoare triple {40681#(= (+ (- 9) main_~y~0) (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40685#(= (+ (- 9) main_~y~0) (+ main_~z~0 2))} is VALID [2022-04-15 06:50:27,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {40685#(= (+ (- 9) 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; {40689#(= (+ (- 11) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-15 06:50:27,817 INFO L290 TraceCheckUtils]: 21: Hoare triple {40689#(= (+ (- 11) main_~y~0) (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {40689#(= (+ (- 11) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-15 06:50:27,818 INFO L290 TraceCheckUtils]: 22: Hoare triple {40689#(= (+ (- 11) 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; {40681#(= (+ (- 9) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-15 06:50:27,819 INFO L290 TraceCheckUtils]: 23: Hoare triple {40681#(= (+ (- 9) 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; {40673#(= (+ main_~z~0 1) (+ main_~y~0 (- 7)))} is VALID [2022-04-15 06:50:27,819 INFO L290 TraceCheckUtils]: 24: Hoare triple {40673#(= (+ main_~z~0 1) (+ main_~y~0 (- 7)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40665#(= (+ main_~y~0 (- 4)) (+ main_~z~0 2))} is VALID [2022-04-15 06:50:27,820 INFO L290 TraceCheckUtils]: 25: Hoare triple {40665#(= (+ main_~y~0 (- 4)) (+ 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; {40657#(= (+ main_~z~0 3) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:50:27,821 INFO L290 TraceCheckUtils]: 26: Hoare triple {40657#(= (+ main_~z~0 3) (+ (- 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; {40708#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= (+ (- 2) main_~y~0) main_~z~0))} is VALID [2022-04-15 06:50:27,821 INFO L290 TraceCheckUtils]: 27: Hoare triple {40708#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= (+ (- 2) main_~y~0) 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; {40712#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= (+ main_~z~0 1) (+ main_~y~0 1)))} is VALID [2022-04-15 06:50:27,822 INFO L290 TraceCheckUtils]: 28: Hoare triple {40712#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= (+ 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; {40716#(and (= (+ (- 1) main_~z~0) (+ main_~y~0 1)) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-15 06:50:27,823 INFO L290 TraceCheckUtils]: 29: Hoare triple {40716#(and (= (+ (- 1) main_~z~0) (+ main_~y~0 1)) (< 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; {40720#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:50:27,823 INFO L290 TraceCheckUtils]: 30: Hoare triple {40720#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {40720#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:50:27,824 INFO L290 TraceCheckUtils]: 31: Hoare triple {40720#(< 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; {40720#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:50:27,824 INFO L290 TraceCheckUtils]: 32: Hoare triple {40720#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {40720#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:50:27,824 INFO L290 TraceCheckUtils]: 33: Hoare triple {40720#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {40595#false} is VALID [2022-04-15 06:50:27,824 INFO L272 TraceCheckUtils]: 34: Hoare triple {40595#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {40595#false} is VALID [2022-04-15 06:50:27,824 INFO L290 TraceCheckUtils]: 35: Hoare triple {40595#false} ~cond := #in~cond; {40595#false} is VALID [2022-04-15 06:50:27,824 INFO L290 TraceCheckUtils]: 36: Hoare triple {40595#false} assume 0 == ~cond; {40595#false} is VALID [2022-04-15 06:50:27,825 INFO L290 TraceCheckUtils]: 37: Hoare triple {40595#false} assume !false; {40595#false} is VALID [2022-04-15 06:50:27,825 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:50:27,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:50:29,285 INFO L290 TraceCheckUtils]: 37: Hoare triple {40595#false} assume !false; {40595#false} is VALID [2022-04-15 06:50:29,285 INFO L290 TraceCheckUtils]: 36: Hoare triple {40595#false} assume 0 == ~cond; {40595#false} is VALID [2022-04-15 06:50:29,285 INFO L290 TraceCheckUtils]: 35: Hoare triple {40595#false} ~cond := #in~cond; {40595#false} is VALID [2022-04-15 06:50:29,285 INFO L272 TraceCheckUtils]: 34: Hoare triple {40595#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {40595#false} is VALID [2022-04-15 06:50:29,285 INFO L290 TraceCheckUtils]: 33: Hoare triple {40720#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {40595#false} is VALID [2022-04-15 06:50:29,286 INFO L290 TraceCheckUtils]: 32: Hoare triple {40720#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {40720#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:50:29,286 INFO L290 TraceCheckUtils]: 31: Hoare triple {40720#(< 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; {40720#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:50:29,295 INFO L290 TraceCheckUtils]: 30: Hoare triple {40720#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {40720#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:50:29,297 INFO L290 TraceCheckUtils]: 29: Hoare triple {40769#(< 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; {40720#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:50:29,298 INFO L290 TraceCheckUtils]: 28: Hoare triple {40773#(< 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; {40769#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:50:29,299 INFO L290 TraceCheckUtils]: 27: Hoare triple {40777#(< 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; {40773#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:50:29,300 INFO L290 TraceCheckUtils]: 26: Hoare triple {40781#(or (<= (mod main_~y~0 4294967296) 0) (< 0 (mod (+ main_~z~0 4) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40777#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 06:50:29,301 INFO L290 TraceCheckUtils]: 25: Hoare triple {40785#(or (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod (+ 5 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; {40781#(or (<= (mod main_~y~0 4294967296) 0) (< 0 (mod (+ main_~z~0 4) 4294967296)))} is VALID [2022-04-15 06:50:29,303 INFO L290 TraceCheckUtils]: 24: Hoare triple {40789#(or (< 0 (mod (+ main_~z~0 6) 4294967296)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40785#(or (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod (+ 5 main_~z~0) 4294967296)))} is VALID [2022-04-15 06:50:29,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {40793#(or (< 0 (mod (+ 7 main_~z~0) 4294967296)) (<= (mod (+ main_~y~0 4294967293) 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; {40789#(or (< 0 (mod (+ main_~z~0 6) 4294967296)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-15 06:50:29,307 INFO L290 TraceCheckUtils]: 22: Hoare triple {40797#(or (< 0 (mod (+ main_~z~0 8) 4294967296)) (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40793#(or (< 0 (mod (+ 7 main_~z~0) 4294967296)) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0))} is VALID [2022-04-15 06:50:29,307 INFO L290 TraceCheckUtils]: 21: Hoare triple {40797#(or (< 0 (mod (+ main_~z~0 8) 4294967296)) (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {40797#(or (< 0 (mod (+ main_~z~0 8) 4294967296)) (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 06:50:29,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {40804#(or (< 0 (mod (+ 7 main_~z~0) 4294967296)) (<= (mod (+ 4294967292 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; {40797#(or (< 0 (mod (+ main_~z~0 8) 4294967296)) (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 06:50:29,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {40808#(or (< 0 (mod (+ main_~z~0 6) 4294967296)) (<= (mod (+ 4294967292 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; {40804#(or (< 0 (mod (+ 7 main_~z~0) 4294967296)) (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 06:50:29,311 INFO L290 TraceCheckUtils]: 18: Hoare triple {40812#(or (< 0 (mod (+ 5 main_~z~0) 4294967296)) (<= (mod (+ 4294967292 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; {40808#(or (< 0 (mod (+ main_~z~0 6) 4294967296)) (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 06:50:29,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {40816#(or (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40812#(or (< 0 (mod (+ 5 main_~z~0) 4294967296)) (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 06:50:29,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {40820#(or (< 0 (mod (+ main_~z~0 3) 4294967296)) (<= (mod (+ 4294967292 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; {40816#(or (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4) 4294967296)))} is VALID [2022-04-15 06:50:29,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {40824#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (mod (+ 4294967292 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; {40820#(or (< 0 (mod (+ main_~z~0 3) 4294967296)) (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 06:50:29,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {40828#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (mod (+ 4294967292 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; {40824#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 06:50:29,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {40832#(or (< 0 (mod main_~z~0 4294967296)) (<= (mod (+ 4294967292 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; {40828#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 06:50:29,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {40836#(or (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40832#(or (< 0 (mod main_~z~0 4294967296)) (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 06:50:29,322 INFO L290 TraceCheckUtils]: 11: Hoare triple {40840#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (mod (+ 4294967292 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; {40836#(or (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:50:29,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {40844#(or (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 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; {40840#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 06:50:29,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {40848#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= (mod (+ 4294967292 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; {40844#(or (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:50:29,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {40594#true} ~z~0 := ~y~0; {40848#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 06:50:29,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {40594#true} [160] 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[] {40594#true} is VALID [2022-04-15 06:50:29,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {40594#true} [161] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_727 v_main_~y~0_726)) (.cse1 (= |v_main_#t~post5_184| |v_main_#t~post5_183|)) (.cse2 (= |v_main_#t~post6_184| |v_main_#t~post6_183|)) (.cse3 (= v_main_~x~0_561 v_main_~x~0_560)) (.cse4 (mod v_main_~x~0_561 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (< v_main_~y~0_727 v_main_~y~0_726) (< 0 .cse4) (forall ((v_it_38 Int)) (or (not (<= 1 v_it_38)) (< 0 (mod (+ v_main_~x~0_561 (* 4294967295 v_it_38)) 4294967296)) (not (<= (+ v_main_~y~0_727 v_it_38 1) v_main_~y~0_726)))) (= v_main_~x~0_560 (+ v_main_~x~0_561 (* (- 1) v_main_~y~0_726) v_main_~y~0_727))))) InVars {main_~y~0=v_main_~y~0_727, main_#t~post5=|v_main_#t~post5_184|, main_~x~0=v_main_~x~0_561, main_#t~post6=|v_main_#t~post6_184|} OutVars{main_~y~0=v_main_~y~0_726, main_#t~post5=|v_main_#t~post5_183|, main_~x~0=v_main_~x~0_560, main_#t~post6=|v_main_#t~post6_183|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {40594#true} is VALID [2022-04-15 06:50:29,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {40594#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40594#true} is VALID [2022-04-15 06:50:29,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {40594#true} call #t~ret15 := main(); {40594#true} is VALID [2022-04-15 06:50:29,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40594#true} {40594#true} #83#return; {40594#true} is VALID [2022-04-15 06:50:29,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {40594#true} assume true; {40594#true} is VALID [2022-04-15 06:50:29,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {40594#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40594#true} is VALID [2022-04-15 06:50:29,326 INFO L272 TraceCheckUtils]: 0: Hoare triple {40594#true} call ULTIMATE.init(); {40594#true} is VALID [2022-04-15 06:50:29,326 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:50:29,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355173536] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:50:29,326 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:50:29,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 23] total 54 [2022-04-15 06:50:30,657 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:50:30,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1501592060] [2022-04-15 06:50:30,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1501592060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:50:30,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:50:30,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 06:50:30,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972028474] [2022-04-15 06:50:30,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:50:30,658 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-15 06:50:30,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:50:30,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:30,748 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-15 06:50:30,748 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 06:50:30,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:50:30,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 06:50:30,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=3297, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 06:50:30,749 INFO L87 Difference]: Start difference. First operand 202 states and 271 transitions. Second operand has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:35,327 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:50:45,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:45,331 INFO L93 Difference]: Finished difference Result 421 states and 629 transitions. [2022-04-15 06:50:45,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 06:50:45,331 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-15 06:50:45,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:50:45,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:45,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 142 transitions. [2022-04-15 06:50:45,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:45,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 142 transitions. [2022-04-15 06:50:45,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 142 transitions. [2022-04-15 06:50:45,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:50:45,761 INFO L225 Difference]: With dead ends: 421 [2022-04-15 06:50:45,761 INFO L226 Difference]: Without dead ends: 393 [2022-04-15 06:50:45,762 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=612, Invalid=6697, Unknown=1, NotChecked=0, Total=7310 [2022-04-15 06:50:45,762 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 194 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:50:45,762 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 67 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-15 06:50:45,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2022-04-15 06:50:48,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 216. [2022-04-15 06:50:48,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:50:48,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 393 states. Second operand has 216 states, 211 states have (on average 1.3554502369668247) internal successors, (286), 211 states have internal predecessors, (286), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:48,249 INFO L74 IsIncluded]: Start isIncluded. First operand 393 states. Second operand has 216 states, 211 states have (on average 1.3554502369668247) internal successors, (286), 211 states have internal predecessors, (286), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:48,249 INFO L87 Difference]: Start difference. First operand 393 states. Second operand has 216 states, 211 states have (on average 1.3554502369668247) internal successors, (286), 211 states have internal predecessors, (286), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:48,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:48,255 INFO L93 Difference]: Finished difference Result 393 states and 541 transitions. [2022-04-15 06:50:48,255 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 541 transitions. [2022-04-15 06:50:48,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:48,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:48,255 INFO L74 IsIncluded]: Start isIncluded. First operand has 216 states, 211 states have (on average 1.3554502369668247) internal successors, (286), 211 states have internal predecessors, (286), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 393 states. [2022-04-15 06:50:48,255 INFO L87 Difference]: Start difference. First operand has 216 states, 211 states have (on average 1.3554502369668247) internal successors, (286), 211 states have internal predecessors, (286), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 393 states. [2022-04-15 06:50:48,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:48,261 INFO L93 Difference]: Finished difference Result 393 states and 541 transitions. [2022-04-15 06:50:48,261 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 541 transitions. [2022-04-15 06:50:48,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:48,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:48,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:50:48,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:50:48,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 211 states have (on average 1.3554502369668247) internal successors, (286), 211 states have internal predecessors, (286), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:48,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 290 transitions. [2022-04-15 06:50:48,265 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 290 transitions. Word has length 43 [2022-04-15 06:50:48,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:50:48,265 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 290 transitions. [2022-04-15 06:50:48,266 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:48,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 216 states and 290 transitions. [2022-04-15 06:51:09,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 290 edges. 286 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-15 06:51:09,326 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 290 transitions. [2022-04-15 06:51:09,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 06:51:09,327 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:51:09,327 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:51:09,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-15 06:51:09,550 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:51:09,550 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:51:09,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:51:09,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1786865828, now seen corresponding path program 23 times [2022-04-15 06:51:09,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:51:09,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1795169230] [2022-04-15 06:51:09,789 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-15 06:51:09,791 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:51:09,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1890217456, now seen corresponding path program 1 times [2022-04-15 06:51:09,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:51:09,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802394146] [2022-04-15 06:51:09,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:51:09,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:51:09,811 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_39.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:51:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:09,853 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_39.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:51:10,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:51:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:10,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {43020#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42996#true} is VALID [2022-04-15 06:51:10,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {42996#true} assume true; {42996#true} is VALID [2022-04-15 06:51:10,302 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42996#true} {42996#true} #83#return; {42996#true} is VALID [2022-04-15 06:51:10,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {42996#true} call ULTIMATE.init(); {43020#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:51:10,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {43020#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42996#true} is VALID [2022-04-15 06:51:10,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {42996#true} assume true; {42996#true} is VALID [2022-04-15 06:51:10,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42996#true} {42996#true} #83#return; {42996#true} is VALID [2022-04-15 06:51:10,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {42996#true} call #t~ret15 := main(); {42996#true} is VALID [2022-04-15 06:51:10,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {42996#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43001#(= main_~y~0 0)} is VALID [2022-04-15 06:51:10,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {43001#(= main_~y~0 0)} [163] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_756 v_main_~y~0_755)) (.cse2 (= |v_main_#t~post5_189| |v_main_#t~post5_188|)) (.cse3 (= |v_main_#t~post6_189| |v_main_#t~post6_188|)) (.cse0 (mod v_main_~x~0_586 4294967296)) (.cse4 (= v_main_~x~0_586 v_main_~x~0_585))) (or (and (= (+ v_main_~x~0_586 v_main_~y~0_756 (* (- 1) v_main_~y~0_755)) v_main_~x~0_585) (forall ((v_it_39 Int)) (or (not (<= 1 v_it_39)) (< 0 (mod (+ v_main_~x~0_586 (* 4294967295 v_it_39)) 4294967296)) (not (<= (+ v_main_~y~0_756 v_it_39 1) v_main_~y~0_755)))) (< 0 .cse0) (< v_main_~y~0_756 v_main_~y~0_755)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 (<= .cse0 0) .cse4))) InVars {main_~y~0=v_main_~y~0_756, main_#t~post5=|v_main_#t~post5_189|, main_~x~0=v_main_~x~0_586, main_#t~post6=|v_main_#t~post6_189|} OutVars{main_~y~0=v_main_~y~0_755, main_#t~post5=|v_main_#t~post5_188|, main_~x~0=v_main_~x~0_585, main_#t~post6=|v_main_#t~post6_188|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43002#(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-15 06:51:10,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {43002#(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)))} [162] 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[] {43003#(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-15 06:51:10,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {43003#(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; {43004#(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-15 06:51:10,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {43004#(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; {43005#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:10,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {43005#(<= 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; {43006#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 06:51:10,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {43006#(<= 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; {43007#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:10,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {43007#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43008#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:10,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {43008#(<= main_~z~0 (+ 4294967291 (* (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; {43009#(<= main_~z~0 (+ 4294967290 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:10,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {43009#(<= main_~z~0 (+ 4294967290 (* (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; {43010#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967289))} is VALID [2022-04-15 06:51:10,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {43010#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43011#(<= main_~z~0 (+ 4294967288 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:10,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {43011#(<= main_~z~0 (+ 4294967288 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {43011#(<= main_~z~0 (+ 4294967288 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:10,315 INFO L290 TraceCheckUtils]: 17: Hoare triple {43011#(<= main_~z~0 (+ 4294967288 (* (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; {43012#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 4294967289))} is VALID [2022-04-15 06:51:10,316 INFO L290 TraceCheckUtils]: 18: Hoare triple {43012#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 4294967289))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43013#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967290))} is VALID [2022-04-15 06:51:10,317 INFO L290 TraceCheckUtils]: 19: Hoare triple {43013#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967290))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43014#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:10,317 INFO L290 TraceCheckUtils]: 20: Hoare triple {43014#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43015#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967292))} is VALID [2022-04-15 06:51:10,318 INFO L290 TraceCheckUtils]: 21: Hoare triple {43015#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967292))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43016#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 06:51:10,319 INFO L290 TraceCheckUtils]: 22: Hoare triple {43016#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43017#(<= main_~z~0 (+ 4294967294 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:10,320 INFO L290 TraceCheckUtils]: 23: Hoare triple {43017#(<= main_~z~0 (+ 4294967294 (* (div (+ main_~z~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; {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-15 06:51:10,320 INFO L290 TraceCheckUtils]: 24: Hoare triple {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296) 4294967295))} assume !(~y~0 % 4294967296 > 0); {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-15 06:51:10,321 INFO L290 TraceCheckUtils]: 25: Hoare triple {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296) 4294967295))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-15 06:51:10,321 INFO L290 TraceCheckUtils]: 26: Hoare triple {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296) 4294967295))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-15 06:51:10,321 INFO L290 TraceCheckUtils]: 27: Hoare triple {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296) 4294967295))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-15 06:51:10,322 INFO L290 TraceCheckUtils]: 28: Hoare triple {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296) 4294967295))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-15 06:51:10,322 INFO L290 TraceCheckUtils]: 29: Hoare triple {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296) 4294967295))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-15 06:51:10,323 INFO L290 TraceCheckUtils]: 30: Hoare triple {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296) 4294967295))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-15 06:51:10,323 INFO L290 TraceCheckUtils]: 31: Hoare triple {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296) 4294967295))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-15 06:51:10,323 INFO L290 TraceCheckUtils]: 32: Hoare triple {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296) 4294967295))} assume !(~x~0 % 4294967296 > 0); {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-15 06:51:10,324 INFO L290 TraceCheckUtils]: 33: Hoare triple {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296) 4294967295))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {43019#(<= (+ 6 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:51:10,325 INFO L290 TraceCheckUtils]: 34: Hoare triple {43019#(<= (+ 6 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {42997#false} is VALID [2022-04-15 06:51:10,325 INFO L272 TraceCheckUtils]: 35: Hoare triple {42997#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {42997#false} is VALID [2022-04-15 06:51:10,325 INFO L290 TraceCheckUtils]: 36: Hoare triple {42997#false} ~cond := #in~cond; {42997#false} is VALID [2022-04-15 06:51:10,325 INFO L290 TraceCheckUtils]: 37: Hoare triple {42997#false} assume 0 == ~cond; {42997#false} is VALID [2022-04-15 06:51:10,325 INFO L290 TraceCheckUtils]: 38: Hoare triple {42997#false} assume !false; {42997#false} is VALID [2022-04-15 06:51:10,325 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 21 proven. 36 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 06:51:10,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:51:10,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802394146] [2022-04-15 06:51:10,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802394146] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:51:10,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345357117] [2022-04-15 06:51:10,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:51:10,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:51:10,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:51:10,327 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:51:10,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-15 06:51:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:10,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 06:51:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:10,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:51:11,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {42996#true} call ULTIMATE.init(); {42996#true} is VALID [2022-04-15 06:51:11,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {42996#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42996#true} is VALID [2022-04-15 06:51:11,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {42996#true} assume true; {42996#true} is VALID [2022-04-15 06:51:11,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42996#true} {42996#true} #83#return; {42996#true} is VALID [2022-04-15 06:51:11,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {42996#true} call #t~ret15 := main(); {42996#true} is VALID [2022-04-15 06:51:11,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {42996#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42996#true} is VALID [2022-04-15 06:51:11,047 INFO L290 TraceCheckUtils]: 6: Hoare triple {42996#true} [163] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_756 v_main_~y~0_755)) (.cse2 (= |v_main_#t~post5_189| |v_main_#t~post5_188|)) (.cse3 (= |v_main_#t~post6_189| |v_main_#t~post6_188|)) (.cse0 (mod v_main_~x~0_586 4294967296)) (.cse4 (= v_main_~x~0_586 v_main_~x~0_585))) (or (and (= (+ v_main_~x~0_586 v_main_~y~0_756 (* (- 1) v_main_~y~0_755)) v_main_~x~0_585) (forall ((v_it_39 Int)) (or (not (<= 1 v_it_39)) (< 0 (mod (+ v_main_~x~0_586 (* 4294967295 v_it_39)) 4294967296)) (not (<= (+ v_main_~y~0_756 v_it_39 1) v_main_~y~0_755)))) (< 0 .cse0) (< v_main_~y~0_756 v_main_~y~0_755)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 (<= .cse0 0) .cse4))) InVars {main_~y~0=v_main_~y~0_756, main_#t~post5=|v_main_#t~post5_189|, main_~x~0=v_main_~x~0_586, main_#t~post6=|v_main_#t~post6_189|} OutVars{main_~y~0=v_main_~y~0_755, main_#t~post5=|v_main_#t~post5_188|, main_~x~0=v_main_~x~0_585, main_#t~post6=|v_main_#t~post6_188|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {42996#true} is VALID [2022-04-15 06:51:11,047 INFO L290 TraceCheckUtils]: 7: Hoare triple {42996#true} [162] 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[] {42996#true} is VALID [2022-04-15 06:51:11,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {42996#true} ~z~0 := ~y~0; {43048#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:51:11,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {43048#(= 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; {43052#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:51:11,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {43052#(= 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; {43056#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-15 06:51:11,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {43056#(= 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; {43060#(= main_~y~0 (+ main_~z~0 3))} is VALID [2022-04-15 06:51:11,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {43060#(= 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; {43064#(= main_~y~0 (+ main_~z~0 4))} is VALID [2022-04-15 06:51:11,050 INFO L290 TraceCheckUtils]: 13: Hoare triple {43064#(= main_~y~0 (+ main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43068#(= (+ main_~y~0 (- 4)) (+ main_~z~0 1))} is VALID [2022-04-15 06:51:11,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {43068#(= (+ 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; {43072#(= (+ main_~y~0 (- 5)) (+ main_~z~0 1))} is VALID [2022-04-15 06:51:11,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {43072#(= (+ main_~y~0 (- 5)) (+ 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; {43076#(= (+ main_~y~0 (- 6)) (+ main_~z~0 1))} is VALID [2022-04-15 06:51:11,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {43076#(= (+ main_~y~0 (- 6)) (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {43076#(= (+ main_~y~0 (- 6)) (+ main_~z~0 1))} is VALID [2022-04-15 06:51:11,053 INFO L290 TraceCheckUtils]: 17: Hoare triple {43076#(= (+ main_~y~0 (- 6)) (+ 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; {43068#(= (+ main_~y~0 (- 4)) (+ main_~z~0 1))} is VALID [2022-04-15 06:51:11,053 INFO L290 TraceCheckUtils]: 18: Hoare triple {43068#(= (+ main_~y~0 (- 4)) (+ 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; {43086#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 06:51:11,054 INFO L290 TraceCheckUtils]: 19: Hoare triple {43086#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43090#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 06:51:11,055 INFO L290 TraceCheckUtils]: 20: Hoare triple {43090#(< 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; {43094#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:51:11,056 INFO L290 TraceCheckUtils]: 21: Hoare triple {43094#(< 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; {43005#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:11,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {43005#(<= 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; {43101#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 06:51:11,057 INFO L290 TraceCheckUtils]: 23: Hoare triple {43101#(<= main_~z~0 (+ 4294967295 (* 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; {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:51:11,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~y~0 % 4294967296 > 0); {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:51:11,058 INFO L290 TraceCheckUtils]: 25: Hoare triple {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) 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; {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:51:11,059 INFO L290 TraceCheckUtils]: 26: Hoare triple {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) 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; {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:51:11,059 INFO L290 TraceCheckUtils]: 27: Hoare triple {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) 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; {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:51:11,059 INFO L290 TraceCheckUtils]: 28: Hoare triple {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) 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; {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:51:11,060 INFO L290 TraceCheckUtils]: 29: Hoare triple {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) 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; {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:51:11,060 INFO L290 TraceCheckUtils]: 30: Hoare triple {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) 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; {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:51:11,060 INFO L290 TraceCheckUtils]: 31: Hoare triple {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) 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; {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:51:11,061 INFO L290 TraceCheckUtils]: 32: Hoare triple {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~x~0 % 4294967296 > 0); {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:51:11,062 INFO L290 TraceCheckUtils]: 33: Hoare triple {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {43101#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 06:51:11,063 INFO L290 TraceCheckUtils]: 34: Hoare triple {43101#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {42997#false} is VALID [2022-04-15 06:51:11,063 INFO L272 TraceCheckUtils]: 35: Hoare triple {42997#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {42997#false} is VALID [2022-04-15 06:51:11,063 INFO L290 TraceCheckUtils]: 36: Hoare triple {42997#false} ~cond := #in~cond; {42997#false} is VALID [2022-04-15 06:51:11,063 INFO L290 TraceCheckUtils]: 37: Hoare triple {42997#false} assume 0 == ~cond; {42997#false} is VALID [2022-04-15 06:51:11,063 INFO L290 TraceCheckUtils]: 38: Hoare triple {42997#false} assume !false; {42997#false} is VALID [2022-04-15 06:51:11,063 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 06:51:11,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:51:11,706 INFO L290 TraceCheckUtils]: 38: Hoare triple {42997#false} assume !false; {42997#false} is VALID [2022-04-15 06:51:11,706 INFO L290 TraceCheckUtils]: 37: Hoare triple {42997#false} assume 0 == ~cond; {42997#false} is VALID [2022-04-15 06:51:11,706 INFO L290 TraceCheckUtils]: 36: Hoare triple {42997#false} ~cond := #in~cond; {42997#false} is VALID [2022-04-15 06:51:11,706 INFO L272 TraceCheckUtils]: 35: Hoare triple {42997#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {42997#false} is VALID [2022-04-15 06:51:11,707 INFO L290 TraceCheckUtils]: 34: Hoare triple {43101#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {42997#false} is VALID [2022-04-15 06:51:11,708 INFO L290 TraceCheckUtils]: 33: Hoare triple {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {43101#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 06:51:11,708 INFO L290 TraceCheckUtils]: 32: Hoare triple {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~x~0 % 4294967296 > 0); {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:51:11,708 INFO L290 TraceCheckUtils]: 31: Hoare triple {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) 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; {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:51:11,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) 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; {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:51:11,709 INFO L290 TraceCheckUtils]: 29: Hoare triple {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) 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; {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:51:11,710 INFO L290 TraceCheckUtils]: 28: Hoare triple {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) 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; {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:51:11,710 INFO L290 TraceCheckUtils]: 27: Hoare triple {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) 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; {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:51:11,710 INFO L290 TraceCheckUtils]: 26: Hoare triple {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) 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; {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:51:11,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) 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; {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:51:11,711 INFO L290 TraceCheckUtils]: 24: Hoare triple {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~y~0 % 4294967296 > 0); {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:51:11,712 INFO L290 TraceCheckUtils]: 23: Hoare triple {43101#(<= main_~z~0 (+ 4294967295 (* 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; {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:51:11,713 INFO L290 TraceCheckUtils]: 22: Hoare triple {43005#(<= 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; {43101#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 06:51:11,714 INFO L290 TraceCheckUtils]: 21: Hoare triple {43094#(< 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; {43005#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:11,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {43090#(< 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; {43094#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:51:11,716 INFO L290 TraceCheckUtils]: 19: Hoare triple {43086#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43090#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 06:51:11,716 INFO L290 TraceCheckUtils]: 18: Hoare triple {43211#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ 5 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; {43086#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 06:51:11,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {43215#(or (< 0 (mod (+ main_~z~0 6) 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; {43211#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ 5 main_~z~0) 4294967296)))} is VALID [2022-04-15 06:51:11,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {43215#(or (< 0 (mod (+ main_~z~0 6) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {43215#(or (< 0 (mod (+ main_~z~0 6) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-15 06:51:11,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {43222#(or (< 0 (mod (+ 5 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; {43215#(or (< 0 (mod (+ main_~z~0 6) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-15 06:51:11,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {43226#(or (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))) (< 0 (mod (+ main_~z~0 4) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43222#(or (< 0 (mod (+ 5 main_~z~0) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-15 06:51:11,721 INFO L290 TraceCheckUtils]: 13: Hoare triple {43230#(or (< 0 (mod (+ main_~z~0 3) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43226#(or (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))) (< 0 (mod (+ main_~z~0 4) 4294967296)))} is VALID [2022-04-15 06:51:11,722 INFO L290 TraceCheckUtils]: 12: Hoare triple {43234#(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; {43230#(or (< 0 (mod (+ main_~z~0 3) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-15 06:51:11,723 INFO L290 TraceCheckUtils]: 11: Hoare triple {43238#(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; {43234#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-15 06:51:11,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {43242#(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; {43238#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-15 06:51:11,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {43246#(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; {43242#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-15 06:51:11,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {42996#true} ~z~0 := ~y~0; {43246#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-15 06:51:11,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {42996#true} [162] 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[] {42996#true} is VALID [2022-04-15 06:51:11,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {42996#true} [163] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_756 v_main_~y~0_755)) (.cse2 (= |v_main_#t~post5_189| |v_main_#t~post5_188|)) (.cse3 (= |v_main_#t~post6_189| |v_main_#t~post6_188|)) (.cse0 (mod v_main_~x~0_586 4294967296)) (.cse4 (= v_main_~x~0_586 v_main_~x~0_585))) (or (and (= (+ v_main_~x~0_586 v_main_~y~0_756 (* (- 1) v_main_~y~0_755)) v_main_~x~0_585) (forall ((v_it_39 Int)) (or (not (<= 1 v_it_39)) (< 0 (mod (+ v_main_~x~0_586 (* 4294967295 v_it_39)) 4294967296)) (not (<= (+ v_main_~y~0_756 v_it_39 1) v_main_~y~0_755)))) (< 0 .cse0) (< v_main_~y~0_756 v_main_~y~0_755)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 (<= .cse0 0) .cse4))) InVars {main_~y~0=v_main_~y~0_756, main_#t~post5=|v_main_#t~post5_189|, main_~x~0=v_main_~x~0_586, main_#t~post6=|v_main_#t~post6_189|} OutVars{main_~y~0=v_main_~y~0_755, main_#t~post5=|v_main_#t~post5_188|, main_~x~0=v_main_~x~0_585, main_#t~post6=|v_main_#t~post6_188|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {42996#true} is VALID [2022-04-15 06:51:11,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {42996#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42996#true} is VALID [2022-04-15 06:51:11,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {42996#true} call #t~ret15 := main(); {42996#true} is VALID [2022-04-15 06:51:11,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42996#true} {42996#true} #83#return; {42996#true} is VALID [2022-04-15 06:51:11,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {42996#true} assume true; {42996#true} is VALID [2022-04-15 06:51:11,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {42996#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42996#true} is VALID [2022-04-15 06:51:11,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {42996#true} call ULTIMATE.init(); {42996#true} is VALID [2022-04-15 06:51:11,726 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 06:51:11,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345357117] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:51:11,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:51:11,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16, 17] total 44 [2022-04-15 06:51:29,059 WARN L232 SmtUtils]: Spent 6.84s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 06:51:53,204 WARN L232 SmtUtils]: Spent 7.44s 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-15 06:52:21,848 WARN L232 SmtUtils]: Spent 10.41s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 06:52:21,863 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:52:21,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1795169230] [2022-04-15 06:52:21,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1795169230] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:52:21,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:52:21,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 06:52:21,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596723990] [2022-04-15 06:52:21,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:52:21,864 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-15 06:52:21,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:52:21,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:25,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 37 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:52:25,051 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 06:52:25,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:52:25,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 06:52:25,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=2231, Unknown=4, NotChecked=0, Total=2550 [2022-04-15 06:52:25,052 INFO L87 Difference]: Start difference. First operand 216 states and 290 transitions. Second operand has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:29,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:29,515 INFO L93 Difference]: Finished difference Result 265 states and 371 transitions. [2022-04-15 06:52:29,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 06:52:29,515 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-15 06:52:29,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:52:29,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:29,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 83 transitions. [2022-04-15 06:52:29,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:29,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 83 transitions. [2022-04-15 06:52:29,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 83 transitions. [2022-04-15 06:52:41,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 78 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-15 06:52:41,558 INFO L225 Difference]: With dead ends: 265 [2022-04-15 06:52:41,558 INFO L226 Difference]: Without dead ends: 260 [2022-04-15 06:52:41,559 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1278 ImplicationChecksByTransitivity, 71.4s TimeCoverageRelationStatistics Valid=587, Invalid=3831, Unknown=4, NotChecked=0, Total=4422 [2022-04-15 06:52:41,559 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 43 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:52:41,559 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 62 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 249 Invalid, 0 Unknown, 48 Unchecked, 0.4s Time] [2022-04-15 06:52:41,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-04-15 06:52:44,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 211. [2022-04-15 06:52:44,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:52:44,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 260 states. Second operand has 211 states, 206 states have (on average 1.3349514563106797) internal successors, (275), 206 states have internal predecessors, (275), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:44,139 INFO L74 IsIncluded]: Start isIncluded. First operand 260 states. Second operand has 211 states, 206 states have (on average 1.3349514563106797) internal successors, (275), 206 states have internal predecessors, (275), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:44,140 INFO L87 Difference]: Start difference. First operand 260 states. Second operand has 211 states, 206 states have (on average 1.3349514563106797) internal successors, (275), 206 states have internal predecessors, (275), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:44,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:44,144 INFO L93 Difference]: Finished difference Result 260 states and 351 transitions. [2022-04-15 06:52:44,144 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 351 transitions. [2022-04-15 06:52:44,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:52:44,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:52:44,145 INFO L74 IsIncluded]: Start isIncluded. First operand has 211 states, 206 states have (on average 1.3349514563106797) internal successors, (275), 206 states have internal predecessors, (275), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 260 states. [2022-04-15 06:52:44,145 INFO L87 Difference]: Start difference. First operand has 211 states, 206 states have (on average 1.3349514563106797) internal successors, (275), 206 states have internal predecessors, (275), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 260 states. [2022-04-15 06:52:44,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:44,149 INFO L93 Difference]: Finished difference Result 260 states and 351 transitions. [2022-04-15 06:52:44,149 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 351 transitions. [2022-04-15 06:52:44,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:52:44,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:52:44,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:52:44,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:52:44,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 206 states have (on average 1.3349514563106797) internal successors, (275), 206 states have internal predecessors, (275), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:44,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 279 transitions. [2022-04-15 06:52:44,154 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 279 transitions. Word has length 44 [2022-04-15 06:52:44,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:52:44,154 INFO L478 AbstractCegarLoop]: Abstraction has 211 states and 279 transitions. [2022-04-15 06:52:44,154 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:44,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 211 states and 279 transitions. [2022-04-15 06:53:10,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 279 edges. 275 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:10,141 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 279 transitions. [2022-04-15 06:53:10,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 06:53:10,141 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:53:10,141 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:53:10,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-04-15 06:53:10,342 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:53:10,342 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:53:10,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:53:10,342 INFO L85 PathProgramCache]: Analyzing trace with hash -107841918, now seen corresponding path program 13 times [2022-04-15 06:53:10,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:10,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1564753638] [2022-04-15 06:53:12,566 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-15 06:53:12,568 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:53:12,570 INFO L85 PathProgramCache]: Analyzing trace with hash 197882766, now seen corresponding path program 1 times [2022-04-15 06:53:12,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:53:12,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883073298] [2022-04-15 06:53:12,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:53:12,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:53:12,581 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_40.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:53:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:12,614 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_40.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:53:12,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:53:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:12,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {44801#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {44787#true} is VALID [2022-04-15 06:53:12,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {44787#true} assume true; {44787#true} is VALID [2022-04-15 06:53:12,785 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44787#true} {44787#true} #83#return; {44787#true} is VALID [2022-04-15 06:53:12,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {44787#true} call ULTIMATE.init(); {44801#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:53:12,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {44801#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {44787#true} is VALID [2022-04-15 06:53:12,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {44787#true} assume true; {44787#true} is VALID [2022-04-15 06:53:12,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44787#true} {44787#true} #83#return; {44787#true} is VALID [2022-04-15 06:53:12,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {44787#true} call #t~ret15 := main(); {44787#true} is VALID [2022-04-15 06:53:12,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {44787#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {44787#true} is VALID [2022-04-15 06:53:12,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {44787#true} [165] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_612 4294967296)) (.cse1 (= |v_main_#t~post5_194| |v_main_#t~post5_193|)) (.cse2 (= v_main_~x~0_612 v_main_~x~0_611)) (.cse3 (= v_main_~y~0_784 v_main_~y~0_783)) (.cse4 (= |v_main_#t~post6_194| |v_main_#t~post6_193|))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (= (+ v_main_~x~0_612 (* v_main_~x~0_611 (- 1)) v_main_~y~0_784) v_main_~y~0_783) (< v_main_~x~0_611 v_main_~x~0_612) (forall ((v_it_40 Int)) (or (not (<= 1 v_it_40)) (not (<= (+ v_main_~x~0_611 v_it_40 1) v_main_~x~0_612)) (< 0 (mod (+ v_main_~x~0_612 (* 4294967295 v_it_40)) 4294967296))))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_784, main_#t~post5=|v_main_#t~post5_194|, main_~x~0=v_main_~x~0_612, main_#t~post6=|v_main_#t~post6_194|} OutVars{main_~y~0=v_main_~y~0_783, main_#t~post5=|v_main_#t~post5_193|, main_~x~0=v_main_~x~0_611, main_#t~post6=|v_main_#t~post6_193|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {44787#true} is VALID [2022-04-15 06:53:12,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {44787#true} [164] 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[] {44787#true} is VALID [2022-04-15 06:53:12,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {44787#true} ~z~0 := ~y~0; {44787#true} is VALID [2022-04-15 06:53:12,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {44787#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; {44787#true} is VALID [2022-04-15 06:53:12,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {44787#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; {44787#true} is VALID [2022-04-15 06:53:12,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {44787#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; {44787#true} is VALID [2022-04-15 06:53:12,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {44787#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; {44787#true} is VALID [2022-04-15 06:53:12,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {44787#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; {44787#true} is VALID [2022-04-15 06:53:12,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {44787#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; {44787#true} is VALID [2022-04-15 06:53:12,786 INFO L290 TraceCheckUtils]: 15: Hoare triple {44787#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; {44787#true} is VALID [2022-04-15 06:53:12,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {44787#true} assume !(~z~0 % 4294967296 > 0); {44792#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 06:53:12,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {44792#(<= 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; {44793#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 06:53:12,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {44793#(<= 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; {44794#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 06:53:12,790 INFO L290 TraceCheckUtils]: 19: Hoare triple {44794#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {44795#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:53:12,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {44795#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {44796#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 06:53:12,791 INFO L290 TraceCheckUtils]: 21: Hoare triple {44796#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {44797#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 5))} is VALID [2022-04-15 06:53:12,792 INFO L290 TraceCheckUtils]: 22: Hoare triple {44797#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 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; {44798#(<= main_~z~0 (+ 6 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:53:12,793 INFO L290 TraceCheckUtils]: 23: Hoare triple {44798#(<= main_~z~0 (+ 6 (* (div (+ main_~z~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; {44799#(<= main_~z~0 (+ 7 (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:53:12,794 INFO L290 TraceCheckUtils]: 24: Hoare triple {44799#(<= main_~z~0 (+ 7 (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {44800#(<= (+ 8 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:53:12,794 INFO L290 TraceCheckUtils]: 25: Hoare triple {44800#(<= (+ 8 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {44800#(<= (+ 8 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:53:12,795 INFO L290 TraceCheckUtils]: 26: Hoare triple {44800#(<= (+ 8 (* (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; {44800#(<= (+ 8 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:53:12,795 INFO L290 TraceCheckUtils]: 27: Hoare triple {44800#(<= (+ 8 (* (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; {44800#(<= (+ 8 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:53:12,796 INFO L290 TraceCheckUtils]: 28: Hoare triple {44800#(<= (+ 8 (* (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; {44800#(<= (+ 8 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:53:12,796 INFO L290 TraceCheckUtils]: 29: Hoare triple {44800#(<= (+ 8 (* (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; {44800#(<= (+ 8 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:53:12,796 INFO L290 TraceCheckUtils]: 30: Hoare triple {44800#(<= (+ 8 (* (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; {44800#(<= (+ 8 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:53:12,797 INFO L290 TraceCheckUtils]: 31: Hoare triple {44800#(<= (+ 8 (* (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; {44800#(<= (+ 8 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:53:12,797 INFO L290 TraceCheckUtils]: 32: Hoare triple {44800#(<= (+ 8 (* (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; {44800#(<= (+ 8 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:53:12,797 INFO L290 TraceCheckUtils]: 33: Hoare triple {44800#(<= (+ 8 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {44800#(<= (+ 8 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:53:12,798 INFO L290 TraceCheckUtils]: 34: Hoare triple {44800#(<= (+ 8 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {44788#false} is VALID [2022-04-15 06:53:12,798 INFO L272 TraceCheckUtils]: 35: Hoare triple {44788#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {44788#false} is VALID [2022-04-15 06:53:12,798 INFO L290 TraceCheckUtils]: 36: Hoare triple {44788#false} ~cond := #in~cond; {44788#false} is VALID [2022-04-15 06:53:12,798 INFO L290 TraceCheckUtils]: 37: Hoare triple {44788#false} assume 0 == ~cond; {44788#false} is VALID [2022-04-15 06:53:12,798 INFO L290 TraceCheckUtils]: 38: Hoare triple {44788#false} assume !false; {44788#false} is VALID [2022-04-15 06:53:12,798 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-15 06:53:12,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:53:12,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883073298] [2022-04-15 06:53:12,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883073298] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:53:12,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296565581] [2022-04-15 06:53:12,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:53:12,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:53:12,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:53:12,804 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:53:12,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-15 06:53:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:12,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 06:53:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:12,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:53:13,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {44787#true} call ULTIMATE.init(); {44787#true} is VALID [2022-04-15 06:53:13,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {44787#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {44787#true} is VALID [2022-04-15 06:53:13,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {44787#true} assume true; {44787#true} is VALID [2022-04-15 06:53:13,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44787#true} {44787#true} #83#return; {44787#true} is VALID [2022-04-15 06:53:13,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {44787#true} call #t~ret15 := main(); {44787#true} is VALID [2022-04-15 06:53:13,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {44787#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {44787#true} is VALID [2022-04-15 06:53:13,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {44787#true} [165] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_612 4294967296)) (.cse1 (= |v_main_#t~post5_194| |v_main_#t~post5_193|)) (.cse2 (= v_main_~x~0_612 v_main_~x~0_611)) (.cse3 (= v_main_~y~0_784 v_main_~y~0_783)) (.cse4 (= |v_main_#t~post6_194| |v_main_#t~post6_193|))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (= (+ v_main_~x~0_612 (* v_main_~x~0_611 (- 1)) v_main_~y~0_784) v_main_~y~0_783) (< v_main_~x~0_611 v_main_~x~0_612) (forall ((v_it_40 Int)) (or (not (<= 1 v_it_40)) (not (<= (+ v_main_~x~0_611 v_it_40 1) v_main_~x~0_612)) (< 0 (mod (+ v_main_~x~0_612 (* 4294967295 v_it_40)) 4294967296))))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_784, main_#t~post5=|v_main_#t~post5_194|, main_~x~0=v_main_~x~0_612, main_#t~post6=|v_main_#t~post6_194|} OutVars{main_~y~0=v_main_~y~0_783, main_#t~post5=|v_main_#t~post5_193|, main_~x~0=v_main_~x~0_611, main_#t~post6=|v_main_#t~post6_193|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {44787#true} is VALID [2022-04-15 06:53:13,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {44787#true} [164] 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[] {44787#true} is VALID [2022-04-15 06:53:13,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {44787#true} ~z~0 := ~y~0; {44829#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:53:13,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {44829#(= 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; {44833#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:53:13,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {44833#(= 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; {44837#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:53:13,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {44837#(= (+ 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; {44841#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-15 06:53:13,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {44841#(= (+ (- 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; {44845#(= (+ main_~y~0 (- 3)) (+ main_~z~0 1))} is VALID [2022-04-15 06:53:13,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {44845#(= (+ 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; {44849#(= (+ main_~y~0 (- 3)) (+ main_~z~0 2))} is VALID [2022-04-15 06:53:13,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {44849#(= (+ main_~y~0 (- 3)) (+ main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {44853#(= (+ main_~y~0 (- 3)) (+ main_~z~0 3))} is VALID [2022-04-15 06:53:13,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {44853#(= (+ main_~y~0 (- 3)) (+ main_~z~0 3))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {44857#(= (+ main_~y~0 (- 3)) (+ main_~z~0 4))} is VALID [2022-04-15 06:53:13,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {44857#(= (+ main_~y~0 (- 3)) (+ main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {44861#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-15 06:53:13,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {44861#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {44865#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:53:13,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {44865#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {44869#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:53:13,434 INFO L290 TraceCheckUtils]: 19: Hoare triple {44869#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {44873#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:53:13,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {44873#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {44877#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:53:13,435 INFO L290 TraceCheckUtils]: 21: Hoare triple {44877#(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; {44881#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-15 06:53:13,436 INFO L290 TraceCheckUtils]: 22: Hoare triple {44881#(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; {44885#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:53:13,437 INFO L290 TraceCheckUtils]: 23: Hoare triple {44885#(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; {44889#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:53:13,437 INFO L290 TraceCheckUtils]: 24: Hoare triple {44889#(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; {44788#false} is VALID [2022-04-15 06:53:13,437 INFO L290 TraceCheckUtils]: 25: Hoare triple {44788#false} assume !(~y~0 % 4294967296 > 0); {44788#false} is VALID [2022-04-15 06:53:13,437 INFO L290 TraceCheckUtils]: 26: Hoare triple {44788#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; {44788#false} is VALID [2022-04-15 06:53:13,437 INFO L290 TraceCheckUtils]: 27: Hoare triple {44788#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; {44788#false} is VALID [2022-04-15 06:53:13,437 INFO L290 TraceCheckUtils]: 28: Hoare triple {44788#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; {44788#false} is VALID [2022-04-15 06:53:13,438 INFO L290 TraceCheckUtils]: 29: Hoare triple {44788#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; {44788#false} is VALID [2022-04-15 06:53:13,438 INFO L290 TraceCheckUtils]: 30: Hoare triple {44788#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; {44788#false} is VALID [2022-04-15 06:53:13,438 INFO L290 TraceCheckUtils]: 31: Hoare triple {44788#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; {44788#false} is VALID [2022-04-15 06:53:13,438 INFO L290 TraceCheckUtils]: 32: Hoare triple {44788#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; {44788#false} is VALID [2022-04-15 06:53:13,438 INFO L290 TraceCheckUtils]: 33: Hoare triple {44788#false} assume !(~x~0 % 4294967296 > 0); {44788#false} is VALID [2022-04-15 06:53:13,438 INFO L290 TraceCheckUtils]: 34: Hoare triple {44788#false} assume !(~z~0 % 4294967296 > 0); {44788#false} is VALID [2022-04-15 06:53:13,438 INFO L272 TraceCheckUtils]: 35: Hoare triple {44788#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {44788#false} is VALID [2022-04-15 06:53:13,438 INFO L290 TraceCheckUtils]: 36: Hoare triple {44788#false} ~cond := #in~cond; {44788#false} is VALID [2022-04-15 06:53:13,438 INFO L290 TraceCheckUtils]: 37: Hoare triple {44788#false} assume 0 == ~cond; {44788#false} is VALID [2022-04-15 06:53:13,438 INFO L290 TraceCheckUtils]: 38: Hoare triple {44788#false} assume !false; {44788#false} is VALID [2022-04-15 06:53:13,438 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 06:53:13,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:53:14,061 INFO L290 TraceCheckUtils]: 38: Hoare triple {44788#false} assume !false; {44788#false} is VALID [2022-04-15 06:53:14,061 INFO L290 TraceCheckUtils]: 37: Hoare triple {44788#false} assume 0 == ~cond; {44788#false} is VALID [2022-04-15 06:53:14,061 INFO L290 TraceCheckUtils]: 36: Hoare triple {44788#false} ~cond := #in~cond; {44788#false} is VALID [2022-04-15 06:53:14,061 INFO L272 TraceCheckUtils]: 35: Hoare triple {44788#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {44788#false} is VALID [2022-04-15 06:53:14,061 INFO L290 TraceCheckUtils]: 34: Hoare triple {44788#false} assume !(~z~0 % 4294967296 > 0); {44788#false} is VALID [2022-04-15 06:53:14,061 INFO L290 TraceCheckUtils]: 33: Hoare triple {44788#false} assume !(~x~0 % 4294967296 > 0); {44788#false} is VALID [2022-04-15 06:53:14,061 INFO L290 TraceCheckUtils]: 32: Hoare triple {44788#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; {44788#false} is VALID [2022-04-15 06:53:14,062 INFO L290 TraceCheckUtils]: 31: Hoare triple {44788#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; {44788#false} is VALID [2022-04-15 06:53:14,062 INFO L290 TraceCheckUtils]: 30: Hoare triple {44788#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; {44788#false} is VALID [2022-04-15 06:53:14,062 INFO L290 TraceCheckUtils]: 29: Hoare triple {44788#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; {44788#false} is VALID [2022-04-15 06:53:14,062 INFO L290 TraceCheckUtils]: 28: Hoare triple {44788#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; {44788#false} is VALID [2022-04-15 06:53:14,062 INFO L290 TraceCheckUtils]: 27: Hoare triple {44788#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; {44788#false} is VALID [2022-04-15 06:53:14,062 INFO L290 TraceCheckUtils]: 26: Hoare triple {44788#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; {44788#false} is VALID [2022-04-15 06:53:14,062 INFO L290 TraceCheckUtils]: 25: Hoare triple {44788#false} assume !(~y~0 % 4294967296 > 0); {44788#false} is VALID [2022-04-15 06:53:14,062 INFO L290 TraceCheckUtils]: 24: Hoare triple {44889#(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; {44788#false} is VALID [2022-04-15 06:53:14,063 INFO L290 TraceCheckUtils]: 23: Hoare triple {44885#(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; {44889#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:53:14,064 INFO L290 TraceCheckUtils]: 22: Hoare triple {44881#(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; {44885#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:53:14,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {44877#(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; {44881#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-15 06:53:14,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {44873#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {44877#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:53:14,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {44869#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {44873#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:53:14,067 INFO L290 TraceCheckUtils]: 18: Hoare triple {44865#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {44869#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:53:14,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {44861#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {44865#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:53:14,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {45001#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {44861#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-15 06:53:14,069 INFO L290 TraceCheckUtils]: 15: Hoare triple {45005#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {45001#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 06:53:14,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {45009#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {45005#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:53:14,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {45013#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {45009#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-15 06:53:14,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {45017#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {45013#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:53:14,073 INFO L290 TraceCheckUtils]: 11: Hoare triple {45021#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {45017#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-15 06:53:14,074 INFO L290 TraceCheckUtils]: 10: Hoare triple {45025#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {45021#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-15 06:53:14,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {45029#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {45025#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-15 06:53:14,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {44787#true} ~z~0 := ~y~0; {45029#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-15 06:53:14,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {44787#true} [164] 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[] {44787#true} is VALID [2022-04-15 06:53:14,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {44787#true} [165] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_612 4294967296)) (.cse1 (= |v_main_#t~post5_194| |v_main_#t~post5_193|)) (.cse2 (= v_main_~x~0_612 v_main_~x~0_611)) (.cse3 (= v_main_~y~0_784 v_main_~y~0_783)) (.cse4 (= |v_main_#t~post6_194| |v_main_#t~post6_193|))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (= (+ v_main_~x~0_612 (* v_main_~x~0_611 (- 1)) v_main_~y~0_784) v_main_~y~0_783) (< v_main_~x~0_611 v_main_~x~0_612) (forall ((v_it_40 Int)) (or (not (<= 1 v_it_40)) (not (<= (+ v_main_~x~0_611 v_it_40 1) v_main_~x~0_612)) (< 0 (mod (+ v_main_~x~0_612 (* 4294967295 v_it_40)) 4294967296))))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_784, main_#t~post5=|v_main_#t~post5_194|, main_~x~0=v_main_~x~0_612, main_#t~post6=|v_main_#t~post6_194|} OutVars{main_~y~0=v_main_~y~0_783, main_#t~post5=|v_main_#t~post5_193|, main_~x~0=v_main_~x~0_611, main_#t~post6=|v_main_#t~post6_193|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {44787#true} is VALID [2022-04-15 06:53:14,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {44787#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {44787#true} is VALID [2022-04-15 06:53:14,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {44787#true} call #t~ret15 := main(); {44787#true} is VALID [2022-04-15 06:53:14,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44787#true} {44787#true} #83#return; {44787#true} is VALID [2022-04-15 06:53:14,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {44787#true} assume true; {44787#true} is VALID [2022-04-15 06:53:14,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {44787#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {44787#true} is VALID [2022-04-15 06:53:14,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {44787#true} call ULTIMATE.init(); {44787#true} is VALID [2022-04-15 06:53:14,076 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 06:53:14,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296565581] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:53:14,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:53:14,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 18] total 36 [2022-04-15 06:53:14,978 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:53:14,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1564753638] [2022-04-15 06:53:14,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1564753638] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:53:14,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:53:14,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 06:53:14,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171915541] [2022-04-15 06:53:14,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:53:14,979 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-15 06:53:14,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:53:14,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:15,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:15,016 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 06:53:15,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:15,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 06:53:15,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1546, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 06:53:15,017 INFO L87 Difference]: Start difference. First operand 211 states and 279 transitions. Second operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:33,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:33,132 INFO L93 Difference]: Finished difference Result 423 states and 525 transitions. [2022-04-15 06:53:33,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-15 06:53:33,132 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-15 06:53:33,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:53:33,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:33,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 130 transitions. [2022-04-15 06:53:33,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:33,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 130 transitions. [2022-04-15 06:53:33,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 130 transitions. [2022-04-15 06:53:33,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:33,586 INFO L225 Difference]: With dead ends: 423 [2022-04-15 06:53:33,586 INFO L226 Difference]: Without dead ends: 417 [2022-04-15 06:53:33,587 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=972, Invalid=6338, Unknown=0, NotChecked=0, Total=7310 [2022-04-15 06:53:33,587 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 70 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:53:33,587 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 84 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-15 06:53:33,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-04-15 06:53:36,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 240. [2022-04-15 06:53:36,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:53:36,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 417 states. Second operand has 240 states, 235 states have (on average 1.3574468085106384) internal successors, (319), 235 states have internal predecessors, (319), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:36,471 INFO L74 IsIncluded]: Start isIncluded. First operand 417 states. Second operand has 240 states, 235 states have (on average 1.3574468085106384) internal successors, (319), 235 states have internal predecessors, (319), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:36,471 INFO L87 Difference]: Start difference. First operand 417 states. Second operand has 240 states, 235 states have (on average 1.3574468085106384) internal successors, (319), 235 states have internal predecessors, (319), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:36,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:36,477 INFO L93 Difference]: Finished difference Result 417 states and 512 transitions. [2022-04-15 06:53:36,477 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 512 transitions. [2022-04-15 06:53:36,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:53:36,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:53:36,477 INFO L74 IsIncluded]: Start isIncluded. First operand has 240 states, 235 states have (on average 1.3574468085106384) internal successors, (319), 235 states have internal predecessors, (319), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 417 states. [2022-04-15 06:53:36,477 INFO L87 Difference]: Start difference. First operand has 240 states, 235 states have (on average 1.3574468085106384) internal successors, (319), 235 states have internal predecessors, (319), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 417 states. [2022-04-15 06:53:36,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:36,486 INFO L93 Difference]: Finished difference Result 417 states and 512 transitions. [2022-04-15 06:53:36,487 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 512 transitions. [2022-04-15 06:53:36,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:53:36,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:53:36,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:53:36,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:53:36,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 235 states have (on average 1.3574468085106384) internal successors, (319), 235 states have internal predecessors, (319), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:36,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 323 transitions. [2022-04-15 06:53:36,492 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 323 transitions. Word has length 44 [2022-04-15 06:53:36,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:53:36,492 INFO L478 AbstractCegarLoop]: Abstraction has 240 states and 323 transitions. [2022-04-15 06:53:36,492 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:36,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 240 states and 323 transitions. [2022-04-15 06:53:57,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 323 edges. 321 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:57,373 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 323 transitions. [2022-04-15 06:53:57,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 06:53:57,374 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:53:57,374 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:53:57,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-15 06:53:57,574 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-04-15 06:53:57,574 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:53:57,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:53:57,575 INFO L85 PathProgramCache]: Analyzing trace with hash 986362945, now seen corresponding path program 24 times [2022-04-15 06:53:57,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:57,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1592295761] [2022-04-15 06:53:57,850 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:53:57,852 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:53:57,854 INFO L85 PathProgramCache]: Analyzing trace with hash -442476299, now seen corresponding path program 1 times [2022-04-15 06:53:57,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:53:57,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253560871] [2022-04-15 06:53:57,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:53:57,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:53:57,868 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_41.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-15 06:53:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:57,906 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_41.2))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-15 06:53:58,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:53:58,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:58,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {47334#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {47319#true} is VALID [2022-04-15 06:53:58,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {47319#true} assume true; {47319#true} is VALID [2022-04-15 06:53:58,119 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47319#true} {47319#true} #83#return; {47319#true} is VALID [2022-04-15 06:53:58,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {47319#true} call ULTIMATE.init(); {47334#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:53:58,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {47334#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {47319#true} is VALID [2022-04-15 06:53:58,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {47319#true} assume true; {47319#true} is VALID [2022-04-15 06:53:58,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47319#true} {47319#true} #83#return; {47319#true} is VALID [2022-04-15 06:53:58,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {47319#true} call #t~ret15 := main(); {47319#true} is VALID [2022-04-15 06:53:58,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {47319#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47319#true} is VALID [2022-04-15 06:53:58,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {47319#true} [167] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_638 v_main_~x~0_637)) (.cse2 (= v_main_~y~0_818 v_main_~y~0_817)) (.cse3 (= |v_main_#t~post6_199| |v_main_#t~post6_198|)) (.cse4 (= |v_main_#t~post5_199| |v_main_#t~post5_198|)) (.cse0 (mod v_main_~x~0_638 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (< v_main_~x~0_637 v_main_~x~0_638) (forall ((v_it_41 Int)) (or (not (<= 1 v_it_41)) (not (<= (+ v_main_~x~0_637 v_it_41 1) v_main_~x~0_638)) (< 0 (mod (+ (* 4294967295 v_it_41) v_main_~x~0_638) 4294967296)))) (= v_main_~y~0_817 (+ v_main_~x~0_638 v_main_~y~0_818 (* v_main_~x~0_637 (- 1))))))) InVars {main_~y~0=v_main_~y~0_818, main_#t~post5=|v_main_#t~post5_199|, main_~x~0=v_main_~x~0_638, main_#t~post6=|v_main_#t~post6_199|} OutVars{main_~y~0=v_main_~y~0_817, main_#t~post5=|v_main_#t~post5_198|, main_~x~0=v_main_~x~0_637, main_#t~post6=|v_main_#t~post6_198|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {47319#true} is VALID [2022-04-15 06:53:58,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {47319#true} [166] 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[] {47319#true} is VALID [2022-04-15 06:53:58,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {47319#true} ~z~0 := ~y~0; {47319#true} is VALID [2022-04-15 06:53:58,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {47319#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; {47319#true} is VALID [2022-04-15 06:53:58,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {47319#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; {47319#true} is VALID [2022-04-15 06:53:58,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {47319#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; {47319#true} is VALID [2022-04-15 06:53:58,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {47319#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; {47319#true} is VALID [2022-04-15 06:53:58,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {47319#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; {47319#true} is VALID [2022-04-15 06:53:58,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {47319#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; {47319#true} is VALID [2022-04-15 06:53:58,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {47319#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; {47319#true} is VALID [2022-04-15 06:53:58,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {47319#true} assume !(~z~0 % 4294967296 > 0); {47324#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 06:53:58,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {47324#(<= 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; {47325#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 06:53:58,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {47325#(<= 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; {47326#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 06:53:58,124 INFO L290 TraceCheckUtils]: 19: Hoare triple {47326#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {47327#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:53:58,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {47327#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47328#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 06:53:58,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {47328#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47329#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 5))} is VALID [2022-04-15 06:53:58,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {47329#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 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; {47330#(<= main_~z~0 (+ 6 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:53:58,127 INFO L290 TraceCheckUtils]: 23: Hoare triple {47330#(<= main_~z~0 (+ 6 (* (div (+ main_~z~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; {47331#(<= main_~z~0 (+ 7 (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:53:58,128 INFO L290 TraceCheckUtils]: 24: Hoare triple {47331#(<= main_~z~0 (+ 7 (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47332#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-15 06:53:58,129 INFO L290 TraceCheckUtils]: 25: Hoare triple {47332#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} assume !(~y~0 % 4294967296 > 0); {47332#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-15 06:53:58,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {47332#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {47332#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-15 06:53:58,129 INFO L290 TraceCheckUtils]: 27: Hoare triple {47332#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {47332#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-15 06:53:58,129 INFO L290 TraceCheckUtils]: 28: Hoare triple {47332#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {47332#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-15 06:53:58,130 INFO L290 TraceCheckUtils]: 29: Hoare triple {47332#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {47332#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-15 06:53:58,132 INFO L290 TraceCheckUtils]: 30: Hoare triple {47332#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {47332#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-15 06:53:58,132 INFO L290 TraceCheckUtils]: 31: Hoare triple {47332#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {47332#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-15 06:53:58,132 INFO L290 TraceCheckUtils]: 32: Hoare triple {47332#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {47332#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-15 06:53:58,132 INFO L290 TraceCheckUtils]: 33: Hoare triple {47332#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} assume !(~x~0 % 4294967296 > 0); {47332#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-15 06:53:58,153 INFO L290 TraceCheckUtils]: 34: Hoare triple {47332#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {47333#(<= (+ 7 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:53:58,155 INFO L290 TraceCheckUtils]: 35: Hoare triple {47333#(<= (+ 7 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {47320#false} is VALID [2022-04-15 06:53:58,155 INFO L272 TraceCheckUtils]: 36: Hoare triple {47320#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {47320#false} is VALID [2022-04-15 06:53:58,155 INFO L290 TraceCheckUtils]: 37: Hoare triple {47320#false} ~cond := #in~cond; {47320#false} is VALID [2022-04-15 06:53:58,155 INFO L290 TraceCheckUtils]: 38: Hoare triple {47320#false} assume 0 == ~cond; {47320#false} is VALID [2022-04-15 06:53:58,155 INFO L290 TraceCheckUtils]: 39: Hoare triple {47320#false} assume !false; {47320#false} is VALID [2022-04-15 06:53:58,155 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-15 06:53:58,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:53:58,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253560871] [2022-04-15 06:53:58,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253560871] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:53:58,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209771161] [2022-04-15 06:53:58,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:53:58,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:53:58,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:53:58,160 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:53:58,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-15 06:53:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:58,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 06:53:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:58,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:53:58,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {47319#true} call ULTIMATE.init(); {47319#true} is VALID [2022-04-15 06:53:58,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {47319#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {47319#true} is VALID [2022-04-15 06:53:58,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {47319#true} assume true; {47319#true} is VALID [2022-04-15 06:53:58,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47319#true} {47319#true} #83#return; {47319#true} is VALID [2022-04-15 06:53:58,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {47319#true} call #t~ret15 := main(); {47319#true} is VALID [2022-04-15 06:53:58,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {47319#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47319#true} is VALID [2022-04-15 06:53:58,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {47319#true} [167] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_638 v_main_~x~0_637)) (.cse2 (= v_main_~y~0_818 v_main_~y~0_817)) (.cse3 (= |v_main_#t~post6_199| |v_main_#t~post6_198|)) (.cse4 (= |v_main_#t~post5_199| |v_main_#t~post5_198|)) (.cse0 (mod v_main_~x~0_638 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (< v_main_~x~0_637 v_main_~x~0_638) (forall ((v_it_41 Int)) (or (not (<= 1 v_it_41)) (not (<= (+ v_main_~x~0_637 v_it_41 1) v_main_~x~0_638)) (< 0 (mod (+ (* 4294967295 v_it_41) v_main_~x~0_638) 4294967296)))) (= v_main_~y~0_817 (+ v_main_~x~0_638 v_main_~y~0_818 (* v_main_~x~0_637 (- 1))))))) InVars {main_~y~0=v_main_~y~0_818, main_#t~post5=|v_main_#t~post5_199|, main_~x~0=v_main_~x~0_638, main_#t~post6=|v_main_#t~post6_199|} OutVars{main_~y~0=v_main_~y~0_817, main_#t~post5=|v_main_#t~post5_198|, main_~x~0=v_main_~x~0_637, main_#t~post6=|v_main_#t~post6_198|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {47319#true} is VALID [2022-04-15 06:53:58,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {47319#true} [166] 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[] {47319#true} is VALID [2022-04-15 06:53:58,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {47319#true} ~z~0 := ~y~0; {47362#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:53:58,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {47362#(= 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; {47366#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:53:58,757 INFO L290 TraceCheckUtils]: 10: Hoare triple {47366#(= 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; {47370#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-15 06:53:58,757 INFO L290 TraceCheckUtils]: 11: Hoare triple {47370#(= 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; {47374#(= main_~y~0 (+ main_~z~0 3))} is VALID [2022-04-15 06:53:58,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {47374#(= 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; {47378#(= main_~y~0 (+ main_~z~0 4))} is VALID [2022-04-15 06:53:58,758 INFO L290 TraceCheckUtils]: 13: Hoare triple {47378#(= main_~y~0 (+ main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47382#(= (+ main_~y~0 (- 4)) (+ main_~z~0 1))} is VALID [2022-04-15 06:53:58,759 INFO L290 TraceCheckUtils]: 14: Hoare triple {47382#(= (+ 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; {47386#(= (+ main_~y~0 (- 4)) (+ main_~z~0 2))} is VALID [2022-04-15 06:53:58,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {47386#(= (+ main_~y~0 (- 4)) (+ 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; {47390#(= (+ main_~y~0 (- 4)) (+ main_~z~0 3))} is VALID [2022-04-15 06:53:58,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {47390#(= (+ main_~y~0 (- 4)) (+ main_~z~0 3))} assume !(~z~0 % 4294967296 > 0); {47394#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-15 06:53:58,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {47394#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47398#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:53:58,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {47398#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47402#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:53:58,763 INFO L290 TraceCheckUtils]: 19: Hoare triple {47402#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47406#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:53:58,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {47406#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47410#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:53:58,765 INFO L290 TraceCheckUtils]: 21: Hoare triple {47410#(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; {47414#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-15 06:53:58,766 INFO L290 TraceCheckUtils]: 22: Hoare triple {47414#(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; {47418#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:53:58,766 INFO L290 TraceCheckUtils]: 23: Hoare triple {47418#(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; {47422#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:53:58,767 INFO L290 TraceCheckUtils]: 24: Hoare triple {47422#(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; {47320#false} is VALID [2022-04-15 06:53:58,767 INFO L290 TraceCheckUtils]: 25: Hoare triple {47320#false} assume !(~y~0 % 4294967296 > 0); {47320#false} is VALID [2022-04-15 06:53:58,767 INFO L290 TraceCheckUtils]: 26: Hoare triple {47320#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; {47320#false} is VALID [2022-04-15 06:53:58,767 INFO L290 TraceCheckUtils]: 27: Hoare triple {47320#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; {47320#false} is VALID [2022-04-15 06:53:58,767 INFO L290 TraceCheckUtils]: 28: Hoare triple {47320#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; {47320#false} is VALID [2022-04-15 06:53:58,767 INFO L290 TraceCheckUtils]: 29: Hoare triple {47320#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; {47320#false} is VALID [2022-04-15 06:53:58,767 INFO L290 TraceCheckUtils]: 30: Hoare triple {47320#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; {47320#false} is VALID [2022-04-15 06:53:58,767 INFO L290 TraceCheckUtils]: 31: Hoare triple {47320#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; {47320#false} is VALID [2022-04-15 06:53:58,767 INFO L290 TraceCheckUtils]: 32: Hoare triple {47320#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; {47320#false} is VALID [2022-04-15 06:53:58,767 INFO L290 TraceCheckUtils]: 33: Hoare triple {47320#false} assume !(~x~0 % 4294967296 > 0); {47320#false} is VALID [2022-04-15 06:53:58,767 INFO L290 TraceCheckUtils]: 34: Hoare triple {47320#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {47320#false} is VALID [2022-04-15 06:53:58,767 INFO L290 TraceCheckUtils]: 35: Hoare triple {47320#false} assume !(~z~0 % 4294967296 > 0); {47320#false} is VALID [2022-04-15 06:53:58,767 INFO L272 TraceCheckUtils]: 36: Hoare triple {47320#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {47320#false} is VALID [2022-04-15 06:53:58,767 INFO L290 TraceCheckUtils]: 37: Hoare triple {47320#false} ~cond := #in~cond; {47320#false} is VALID [2022-04-15 06:53:58,767 INFO L290 TraceCheckUtils]: 38: Hoare triple {47320#false} assume 0 == ~cond; {47320#false} is VALID [2022-04-15 06:53:58,767 INFO L290 TraceCheckUtils]: 39: Hoare triple {47320#false} assume !false; {47320#false} is VALID [2022-04-15 06:53:58,771 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-15 06:53:58,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:53:59,355 INFO L290 TraceCheckUtils]: 39: Hoare triple {47320#false} assume !false; {47320#false} is VALID [2022-04-15 06:53:59,355 INFO L290 TraceCheckUtils]: 38: Hoare triple {47320#false} assume 0 == ~cond; {47320#false} is VALID [2022-04-15 06:53:59,355 INFO L290 TraceCheckUtils]: 37: Hoare triple {47320#false} ~cond := #in~cond; {47320#false} is VALID [2022-04-15 06:53:59,355 INFO L272 TraceCheckUtils]: 36: Hoare triple {47320#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {47320#false} is VALID [2022-04-15 06:53:59,355 INFO L290 TraceCheckUtils]: 35: Hoare triple {47320#false} assume !(~z~0 % 4294967296 > 0); {47320#false} is VALID [2022-04-15 06:53:59,355 INFO L290 TraceCheckUtils]: 34: Hoare triple {47320#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {47320#false} is VALID [2022-04-15 06:53:59,355 INFO L290 TraceCheckUtils]: 33: Hoare triple {47320#false} assume !(~x~0 % 4294967296 > 0); {47320#false} is VALID [2022-04-15 06:53:59,355 INFO L290 TraceCheckUtils]: 32: Hoare triple {47320#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; {47320#false} is VALID [2022-04-15 06:53:59,355 INFO L290 TraceCheckUtils]: 31: Hoare triple {47320#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; {47320#false} is VALID [2022-04-15 06:53:59,356 INFO L290 TraceCheckUtils]: 30: Hoare triple {47320#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; {47320#false} is VALID [2022-04-15 06:53:59,356 INFO L290 TraceCheckUtils]: 29: Hoare triple {47320#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; {47320#false} is VALID [2022-04-15 06:53:59,356 INFO L290 TraceCheckUtils]: 28: Hoare triple {47320#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; {47320#false} is VALID [2022-04-15 06:53:59,356 INFO L290 TraceCheckUtils]: 27: Hoare triple {47320#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; {47320#false} is VALID [2022-04-15 06:53:59,356 INFO L290 TraceCheckUtils]: 26: Hoare triple {47320#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; {47320#false} is VALID [2022-04-15 06:53:59,356 INFO L290 TraceCheckUtils]: 25: Hoare triple {47320#false} assume !(~y~0 % 4294967296 > 0); {47320#false} is VALID [2022-04-15 06:53:59,356 INFO L290 TraceCheckUtils]: 24: Hoare triple {47422#(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; {47320#false} is VALID [2022-04-15 06:53:59,358 INFO L290 TraceCheckUtils]: 23: Hoare triple {47418#(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; {47422#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:53:59,359 INFO L290 TraceCheckUtils]: 22: Hoare triple {47414#(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; {47418#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:53:59,360 INFO L290 TraceCheckUtils]: 21: Hoare triple {47410#(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; {47414#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-15 06:53:59,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {47406#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47410#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:53:59,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {47402#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47406#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:53:59,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {47398#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47402#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:53:59,365 INFO L290 TraceCheckUtils]: 17: Hoare triple {47394#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47398#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:53:59,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {47540#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {47394#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-15 06:53:59,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {47544#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47540#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 06:53:59,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {47548#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47544#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:53:59,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {47552#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47548#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-15 06:53:59,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {47556#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47552#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:53:59,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {47560#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47556#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-15 06:53:59,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {47564#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47560#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-15 06:53:59,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {47568#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47564#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-15 06:53:59,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {47319#true} ~z~0 := ~y~0; {47568#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-15 06:53:59,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {47319#true} [166] 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[] {47319#true} is VALID [2022-04-15 06:53:59,376 INFO L290 TraceCheckUtils]: 6: Hoare triple {47319#true} [167] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_638 v_main_~x~0_637)) (.cse2 (= v_main_~y~0_818 v_main_~y~0_817)) (.cse3 (= |v_main_#t~post6_199| |v_main_#t~post6_198|)) (.cse4 (= |v_main_#t~post5_199| |v_main_#t~post5_198|)) (.cse0 (mod v_main_~x~0_638 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (< v_main_~x~0_637 v_main_~x~0_638) (forall ((v_it_41 Int)) (or (not (<= 1 v_it_41)) (not (<= (+ v_main_~x~0_637 v_it_41 1) v_main_~x~0_638)) (< 0 (mod (+ (* 4294967295 v_it_41) v_main_~x~0_638) 4294967296)))) (= v_main_~y~0_817 (+ v_main_~x~0_638 v_main_~y~0_818 (* v_main_~x~0_637 (- 1))))))) InVars {main_~y~0=v_main_~y~0_818, main_#t~post5=|v_main_#t~post5_199|, main_~x~0=v_main_~x~0_638, main_#t~post6=|v_main_#t~post6_199|} OutVars{main_~y~0=v_main_~y~0_817, main_#t~post5=|v_main_#t~post5_198|, main_~x~0=v_main_~x~0_637, main_#t~post6=|v_main_#t~post6_198|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {47319#true} is VALID [2022-04-15 06:53:59,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {47319#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47319#true} is VALID [2022-04-15 06:53:59,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {47319#true} call #t~ret15 := main(); {47319#true} is VALID [2022-04-15 06:53:59,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47319#true} {47319#true} #83#return; {47319#true} is VALID [2022-04-15 06:53:59,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {47319#true} assume true; {47319#true} is VALID [2022-04-15 06:53:59,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {47319#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {47319#true} is VALID [2022-04-15 06:53:59,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {47319#true} call ULTIMATE.init(); {47319#true} is VALID [2022-04-15 06:53:59,376 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-15 06:53:59,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209771161] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:53:59,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:53:59,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 18] total 37 [2022-04-15 06:54:00,454 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:00,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1592295761] [2022-04-15 06:54:00,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1592295761] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:00,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:00,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 06:54:00,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146232358] [2022-04-15 06:54:00,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:00,455 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 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 45 [2022-04-15 06:54:00,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:00,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 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-15 06:54:00,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:00,520 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 06:54:00,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:00,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 06:54:00,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1619, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 06:54:00,520 INFO L87 Difference]: Start difference. First operand 240 states and 323 transitions. Second operand has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 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)