/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sumt6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 12:17:55,811 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 12:17:55,812 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 12:17:55,843 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 12:17:55,844 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 12:17:55,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 12:17:55,847 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 12:17:55,853 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 12:17:55,855 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 12:17:55,860 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 12:17:55,861 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 12:17:55,862 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 12:17:55,862 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 12:17:55,864 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 12:17:55,864 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 12:17:55,865 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 12:17:55,866 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 12:17:55,866 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 12:17:55,867 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 12:17:55,868 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 12:17:55,869 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 12:17:55,871 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 12:17:55,871 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 12:17:55,872 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 12:17:55,873 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 12:17:55,875 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 12:17:55,875 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 12:17:55,875 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 12:17:55,876 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 12:17:55,876 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 12:17:55,877 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 12:17:55,877 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 12:17:55,877 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 12:17:55,878 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 12:17:55,878 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 12:17:55,879 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 12:17:55,879 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 12:17:55,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 12:17:55,880 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 12:17:55,880 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 12:17:55,881 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 12:17:55,886 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 12:17:55,887 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-07 12:17:55,918 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 12:17:55,918 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 12:17:55,919 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 12:17:55,919 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 12:17:55,919 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 12:17:55,919 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 12:17:55,920 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 12:17:55,920 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 12:17:55,920 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 12:17:55,920 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 12:17:55,920 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 12:17:55,921 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 12:17:55,921 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 12:17:55,921 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 12:17:55,921 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 12:17:55,921 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 12:17:55,921 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 12:17:55,921 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 12:17:55,921 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 12:17:55,921 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 12:17:55,922 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 12:17:55,922 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 12:17:55,922 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 12:17:55,922 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 12:17:55,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 12:17:55,922 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 12:17:55,922 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 12:17:55,922 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 12:17:55,923 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 12:17:55,923 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 12:17:55,926 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 12:17:55,926 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 12:17:55,926 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 12:17:55,927 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-07 12:17:56,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 12:17:56,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 12:17:56,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 12:17:56,185 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 12:17:56,187 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 12:17:56,188 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt6.c [2022-04-07 12:17:56,239 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eb67ddca/7ae36cf0f59244ecae81f3b03d2829d1/FLAGcd9351292 [2022-04-07 12:17:56,647 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 12:17:56,648 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt6.c [2022-04-07 12:17:56,654 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eb67ddca/7ae36cf0f59244ecae81f3b03d2829d1/FLAGcd9351292 [2022-04-07 12:17:56,686 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eb67ddca/7ae36cf0f59244ecae81f3b03d2829d1 [2022-04-07 12:17:56,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 12:17:56,689 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 12:17:56,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 12:17:56,690 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 12:17:56,692 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 12:17:56,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:17:56" (1/1) ... [2022-04-07 12:17:56,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d10457c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:17:56, skipping insertion in model container [2022-04-07 12:17:56,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:17:56" (1/1) ... [2022-04-07 12:17:56,704 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 12:17:56,718 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 12:17:56,918 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/sumt6.c[403,416] [2022-04-07 12:17:56,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 12:17:56,958 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 12:17:56,970 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/sumt6.c[403,416] [2022-04-07 12:17:56,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 12:17:56,994 INFO L208 MainTranslator]: Completed translation [2022-04-07 12:17:56,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:17:56 WrapperNode [2022-04-07 12:17:56,994 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 12:17:56,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 12:17:56,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 12:17:56,996 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 12:17:57,004 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:17:56" (1/1) ... [2022-04-07 12:17:57,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:17:56" (1/1) ... [2022-04-07 12:17:57,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:17:56" (1/1) ... [2022-04-07 12:17:57,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:17:56" (1/1) ... [2022-04-07 12:17:57,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:17:56" (1/1) ... [2022-04-07 12:17:57,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:17:56" (1/1) ... [2022-04-07 12:17:57,033 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:17:56" (1/1) ... [2022-04-07 12:17:57,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 12:17:57,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 12:17:57,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 12:17:57,036 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 12:17:57,037 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:17:56" (1/1) ... [2022-04-07 12:17:57,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 12:17:57,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:17:57,064 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-07 12:17:57,090 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-07 12:17:57,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 12:17:57,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 12:17:57,112 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 12:17:57,113 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 12:17:57,113 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 12:17:57,113 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 12:17:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 12:17:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 12:17:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 12:17:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 12:17:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 12:17:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 12:17:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 12:17:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 12:17:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 12:17:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 12:17:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 12:17:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 12:17:57,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 12:17:57,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 12:17:57,174 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 12:17:57,176 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 12:18:03,829 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 12:18:03,834 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 12:18:03,834 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 12:18:03,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:18:03 BoogieIcfgContainer [2022-04-07 12:18:03,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 12:18:03,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 12:18:03,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 12:18:03,840 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 12:18:03,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 12:17:56" (1/3) ... [2022-04-07 12:18:03,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50d4bb90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:18:03, skipping insertion in model container [2022-04-07 12:18:03,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:17:56" (2/3) ... [2022-04-07 12:18:03,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50d4bb90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:18:03, skipping insertion in model container [2022-04-07 12:18:03,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:18:03" (3/3) ... [2022-04-07 12:18:03,842 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt6.c [2022-04-07 12:18:03,846 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 12:18:03,846 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 12:18:03,895 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 12:18:03,906 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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-07 12:18:03,906 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 12:18:03,922 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 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-07 12:18:03,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 12:18:03,927 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:18:03,927 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:18:03,928 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:18:03,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:18:03,932 INFO L85 PathProgramCache]: Analyzing trace with hash 503999003, now seen corresponding path program 1 times [2022-04-07 12:18:03,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:18:03,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799397902] [2022-04-07 12:18:03,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:18:03,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:18:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:18:04,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:18:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:18:04,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {29#true} is VALID [2022-04-07 12:18:04,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-07 12:18:04,154 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #76#return; {29#true} is VALID [2022-04-07 12:18:04,156 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {34#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:18:04,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {29#true} is VALID [2022-04-07 12:18:04,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-07 12:18:04,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #76#return; {29#true} is VALID [2022-04-07 12:18:04,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret5 := main(); {29#true} is VALID [2022-04-07 12:18:04,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {29#true} is VALID [2022-04-07 12:18:04,157 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {29#true} is VALID [2022-04-07 12:18:04,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-07 12:18:04,158 INFO L272 TraceCheckUtils]: 8: Hoare triple {30#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {30#false} is VALID [2022-04-07 12:18:04,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-07 12:18:04,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-07 12:18:04,159 INFO L290 TraceCheckUtils]: 11: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-07 12:18:04,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:18:04,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:18:04,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799397902] [2022-04-07 12:18:04,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799397902] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:18:04,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:18:04,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 12:18:04,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729730626] [2022-04-07 12:18:04,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:18:04,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 12:18:04,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:18:04,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:18:04,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:18:04,201 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 12:18:04,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:18:04,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 12:18:04,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 12:18:04,219 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 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 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:18:10,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:18:10,858 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-07 12:18:10,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 12:18:10,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 12:18:10,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:18:10,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:18:10,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-07 12:18:10,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:18:10,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-07 12:18:10,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2022-04-07 12:18:10,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:18:10,966 INFO L225 Difference]: With dead ends: 38 [2022-04-07 12:18:10,966 INFO L226 Difference]: Without dead ends: 19 [2022-04-07 12:18:10,969 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-07 12:18:10,974 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 12:18:10,975 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 32 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 12:18:10,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-07 12:18:11,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-07 12:18:11,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:18:11,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:18:11,007 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:18:11,008 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:18:11,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:18:11,020 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-07 12:18:11,020 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-07 12:18:11,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:18:11,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:18:11,022 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-07 12:18:11,023 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-07 12:18:11,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:18:11,026 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-07 12:18:11,026 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-07 12:18:11,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:18:11,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:18:11,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:18:11,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:18:11,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:18:11,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-04-07 12:18:11,031 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 12 [2022-04-07 12:18:11,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:18:11,031 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-04-07 12:18:11,032 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:18:11,033 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-07 12:18:11,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 12:18:11,036 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:18:11,041 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:18:11,041 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 12:18:11,041 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:18:11,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:18:11,042 INFO L85 PathProgramCache]: Analyzing trace with hash 475369852, now seen corresponding path program 1 times [2022-04-07 12:18:11,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:18:11,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128206985] [2022-04-07 12:18:11,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:18:11,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:18:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:18:11,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:18:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:18:11,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {156#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {148#true} is VALID [2022-04-07 12:18:11,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#true} assume true; {148#true} is VALID [2022-04-07 12:18:11,466 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {148#true} {148#true} #76#return; {148#true} is VALID [2022-04-07 12:18:11,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {148#true} call ULTIMATE.init(); {156#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:18:11,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {148#true} is VALID [2022-04-07 12:18:11,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {148#true} assume true; {148#true} is VALID [2022-04-07 12:18:11,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {148#true} {148#true} #76#return; {148#true} is VALID [2022-04-07 12:18:11,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {148#true} call #t~ret5 := main(); {148#true} is VALID [2022-04-07 12:18:11,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {148#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {153#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:18:11,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {153#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {153#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:18:11,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {153#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {153#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:18:11,474 INFO L272 TraceCheckUtils]: 8: Hoare triple {153#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {154#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:18:11,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {154#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {155#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 12:18:11,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {155#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {149#false} is VALID [2022-04-07 12:18:11,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {149#false} assume !false; {149#false} is VALID [2022-04-07 12:18:11,476 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-07 12:18:11,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:18:11,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128206985] [2022-04-07 12:18:11,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128206985] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:18:11,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:18:11,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 12:18:11,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502354990] [2022-04-07 12:18:11,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:18:11,478 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 12:18:11,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:18:11,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:18:11,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:18:11,492 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:18:11,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:18:11,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:18:11,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 12:18:11,493 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:18:13,636 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:18:20,150 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:18:26,706 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:18:28,948 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:18:33,373 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:18:33,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:18:33,417 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-07 12:18:33,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:18:33,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 12:18:33,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:18:33,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:18:33,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-07 12:18:33,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:18:33,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-07 12:18:33,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-04-07 12:18:33,459 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-07 12:18:33,460 INFO L225 Difference]: With dead ends: 26 [2022-04-07 12:18:33,460 INFO L226 Difference]: Without dead ends: 21 [2022-04-07 12:18:33,460 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-07 12:18:33,461 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-04-07 12:18:33,462 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 39 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 4 Unknown, 0 Unchecked, 10.4s Time] [2022-04-07 12:18:33,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-07 12:18:33,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-04-07 12:18:33,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:18:33,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:18:33,466 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:18:33,466 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:18:33,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:18:33,468 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-04-07 12:18:33,468 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-07 12:18:33,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:18:33,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:18:33,468 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-07 12:18:33,469 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-07 12:18:33,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:18:33,470 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-04-07 12:18:33,470 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-07 12:18:33,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:18:33,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:18:33,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:18:33,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:18:33,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:18:33,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-04-07 12:18:33,483 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 12 [2022-04-07 12:18:33,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:18:33,483 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-04-07 12:18:33,483 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:18:33,483 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-07 12:18:33,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-07 12:18:33,484 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:18:33,484 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:18:33,484 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 12:18:33,485 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:18:33,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:18:33,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1279795021, now seen corresponding path program 1 times [2022-04-07 12:18:33,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:18:33,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995623029] [2022-04-07 12:18:33,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:18:33,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:18:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:18:34,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:18:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:18:34,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {283#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {271#true} is VALID [2022-04-07 12:18:34,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {271#true} assume true; {271#true} is VALID [2022-04-07 12:18:34,101 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {271#true} {271#true} #76#return; {271#true} is VALID [2022-04-07 12:18:34,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {271#true} call ULTIMATE.init(); {283#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:18:34,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {283#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {271#true} is VALID [2022-04-07 12:18:34,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {271#true} assume true; {271#true} is VALID [2022-04-07 12:18:34,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {271#true} {271#true} #76#return; {271#true} is VALID [2022-04-07 12:18:34,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {271#true} call #t~ret5 := main(); {271#true} is VALID [2022-04-07 12:18:34,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {271#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:18:34,103 INFO L290 TraceCheckUtils]: 6: Hoare triple {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:18:34,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {277#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0) (= main_~v3~0 0))} is VALID [2022-04-07 12:18:34,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {277#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {278#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~v2~0)) (<= 1 main_~v2~0) (<= main_~v2~0 1) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:18:34,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {278#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~v2~0)) (<= 1 main_~v2~0) (<= main_~v2~0 1) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {279#(and (or (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (and (<= main_~v2~0 main_~l~0) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v2~0)))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296))) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:18:34,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {279#(and (or (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (and (<= main_~v2~0 main_~l~0) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v2~0)))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296))) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {280#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~v2~0 (+ 4294967295 (* (div main_~l~0 4294967296) 4294967296))) (= main_~v3~0 0))} is VALID [2022-04-07 12:18:34,119 INFO L272 TraceCheckUtils]: 11: Hoare triple {280#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~v2~0 (+ 4294967295 (* (div main_~l~0 4294967296) 4294967296))) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {281#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:18:34,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {281#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {282#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 12:18:34,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {282#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {272#false} is VALID [2022-04-07 12:18:34,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {272#false} assume !false; {272#false} is VALID [2022-04-07 12:18:34,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:18:34,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:18:34,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995623029] [2022-04-07 12:18:34,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995623029] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:18:34,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92738408] [2022-04-07 12:18:34,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:18:34,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:18:34,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:18:34,131 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-07 12:18:34,138 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-07 12:18:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:18:34,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-07 12:18:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:18:34,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:18:34,579 INFO L272 TraceCheckUtils]: 0: Hoare triple {271#true} call ULTIMATE.init(); {271#true} is VALID [2022-04-07 12:18:34,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {271#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {271#true} is VALID [2022-04-07 12:18:34,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {271#true} assume true; {271#true} is VALID [2022-04-07 12:18:34,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {271#true} {271#true} #76#return; {271#true} is VALID [2022-04-07 12:18:34,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {271#true} call #t~ret5 := main(); {271#true} is VALID [2022-04-07 12:18:34,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {271#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:18:34,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:18:34,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:18:34,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {311#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:18:34,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {311#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {315#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:18:34,585 INFO L290 TraceCheckUtils]: 10: Hoare triple {315#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {315#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:18:34,586 INFO L272 TraceCheckUtils]: 11: Hoare triple {315#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {322#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:18:34,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {322#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {326#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:18:34,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {326#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {272#false} is VALID [2022-04-07 12:18:34,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {272#false} assume !false; {272#false} is VALID [2022-04-07 12:18:34,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:18:34,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:18:34,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {272#false} assume !false; {272#false} is VALID [2022-04-07 12:18:34,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {326#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {272#false} is VALID [2022-04-07 12:18:34,862 INFO L290 TraceCheckUtils]: 12: Hoare triple {322#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {326#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:18:34,863 INFO L272 TraceCheckUtils]: 11: Hoare triple {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {322#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:18:34,864 INFO L290 TraceCheckUtils]: 10: Hoare triple {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:18:34,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:18:34,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 12:18:34,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:18:34,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:18:34,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {271#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:18:34,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {271#true} call #t~ret5 := main(); {271#true} is VALID [2022-04-07 12:18:34,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {271#true} {271#true} #76#return; {271#true} is VALID [2022-04-07 12:18:34,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {271#true} assume true; {271#true} is VALID [2022-04-07 12:18:34,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {271#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {271#true} is VALID [2022-04-07 12:18:34,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {271#true} call ULTIMATE.init(); {271#true} is VALID [2022-04-07 12:18:34,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 12:18:34,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92738408] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 12:18:34,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:18:34,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 7] total 16 [2022-04-07 12:18:34,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480723919] [2022-04-07 12:18:34,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:18:34,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 15 [2022-04-07 12:18:34,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:18:34,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-07 12:18:37,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 14 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:18:37,056 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:18:37,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:18:37,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:18:37,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-07 12:18:37,057 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-07 12:18:39,124 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:18:41,243 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:18:50,031 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:18:52,193 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:19:01,020 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:19:03,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:19:03,541 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-07 12:19:03,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:19:03,541 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 15 [2022-04-07 12:19:03,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:19:03,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-07 12:19:03,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-07 12:19:03,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-07 12:19:03,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-07 12:19:03,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 33 transitions. [2022-04-07 12:19:05,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 32 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:19:05,713 INFO L225 Difference]: With dead ends: 28 [2022-04-07 12:19:05,713 INFO L226 Difference]: Without dead ends: 23 [2022-04-07 12:19:05,714 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-04-07 12:19:05,714 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-04-07 12:19:05,715 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 66 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 5 Unknown, 0 Unchecked, 10.9s Time] [2022-04-07 12:19:05,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-07 12:19:05,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-07 12:19:05,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:19:05,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:19:05,718 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:19:05,718 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:19:05,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:19:05,734 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-07 12:19:05,734 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-07 12:19:05,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:19:05,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:19:05,735 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-07 12:19:05,735 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-07 12:19:05,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:19:05,736 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-07 12:19:05,736 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-07 12:19:05,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:19:05,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:19:05,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:19:05,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:19:05,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:19:05,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-04-07 12:19:05,738 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 15 [2022-04-07 12:19:05,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:19:05,738 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-04-07 12:19:05,738 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-07 12:19:05,739 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-07 12:19:05,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-07 12:19:05,739 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:19:05,739 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:19:05,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 12:19:05,941 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:19:05,941 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:19:05,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:19:05,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1309439716, now seen corresponding path program 1 times [2022-04-07 12:19:05,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:19:05,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949988338] [2022-04-07 12:19:05,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:19:05,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:19:06,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:19:06,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:19:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:19:06,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {504#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:19:06,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:19:06,310 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {496#true} #76#return; {501#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:19:06,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {496#true} call ULTIMATE.init(); {504#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:19:06,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {504#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:19:06,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:19:06,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {496#true} #76#return; {501#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:19:06,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {501#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {501#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:19:06,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {501#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {502#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:19:06,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {502#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {503#(= main_~l~0 0)} is VALID [2022-04-07 12:19:06,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {503#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {503#(= main_~l~0 0)} is VALID [2022-04-07 12:19:06,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {503#(= main_~l~0 0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {497#false} is VALID [2022-04-07 12:19:06,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {497#false} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {497#false} is VALID [2022-04-07 12:19:06,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {497#false} ~l~0 := 1 + ~l~0; {497#false} is VALID [2022-04-07 12:19:06,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {497#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {497#false} is VALID [2022-04-07 12:19:06,318 INFO L272 TraceCheckUtils]: 12: Hoare triple {497#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {497#false} is VALID [2022-04-07 12:19:06,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {497#false} ~cond := #in~cond; {497#false} is VALID [2022-04-07 12:19:06,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {497#false} assume 0 == ~cond; {497#false} is VALID [2022-04-07 12:19:06,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {497#false} assume !false; {497#false} is VALID [2022-04-07 12:19:06,319 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-07 12:19:06,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:19:06,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949988338] [2022-04-07 12:19:06,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949988338] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:19:06,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:19:06,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 12:19:06,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789134494] [2022-04-07 12:19:06,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:19:06,320 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-07 12:19:06,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:19:06,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:19:08,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:19:08,515 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 12:19:08,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:19:08,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 12:19:08,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-07 12:19:08,517 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:19:12,828 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:19:17,170 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:19:21,594 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:19:21,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:19:21,880 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2022-04-07 12:19:21,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:19:21,880 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-07 12:19:21,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:19:21,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:19:21,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-07 12:19:21,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:19:21,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-07 12:19:21,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-07 12:19:24,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 44 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:19:24,172 INFO L225 Difference]: With dead ends: 37 [2022-04-07 12:19:24,172 INFO L226 Difference]: Without dead ends: 25 [2022-04-07 12:19:24,172 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-07 12:19:24,173 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 67 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 9 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:19:24,173 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 27 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 20 Invalid, 3 Unknown, 0 Unchecked, 6.1s Time] [2022-04-07 12:19:24,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-07 12:19:24,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-07 12:19:24,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:19:24,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:19:24,209 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:19:24,209 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:19:24,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:19:24,212 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-07 12:19:24,213 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-07 12:19:24,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:19:24,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:19:24,214 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-07 12:19:24,214 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-07 12:19:24,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:19:24,217 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-07 12:19:24,217 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-07 12:19:24,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:19:24,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:19:24,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:19:24,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:19:24,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:19:24,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2022-04-07 12:19:24,219 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 16 [2022-04-07 12:19:24,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:19:24,219 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-04-07 12:19:24,220 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:19:24,220 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-04-07 12:19:24,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-07 12:19:24,220 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:19:24,220 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:19:24,221 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 12:19:24,221 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:19:24,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:19:24,221 INFO L85 PathProgramCache]: Analyzing trace with hash 57783349, now seen corresponding path program 1 times [2022-04-07 12:19:24,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:19:24,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754794623] [2022-04-07 12:19:24,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:19:24,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:19:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:19:24,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:19:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:19:24,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {653#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {654#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:19:24,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {654#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {654#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:19:24,728 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {654#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {644#true} #76#return; {649#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:19:24,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {644#true} call ULTIMATE.init(); {653#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:19:24,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {653#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {654#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:19:24,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {654#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {654#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:19:24,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {654#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {644#true} #76#return; {649#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:19:24,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {649#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {649#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:19:24,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {649#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {650#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:19:24,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {650#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {651#(= main_~l~0 0)} is VALID [2022-04-07 12:19:24,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {651#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {651#(= main_~l~0 0)} is VALID [2022-04-07 12:19:24,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {651#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {651#(= main_~l~0 0)} is VALID [2022-04-07 12:19:24,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {651#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {652#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-07 12:19:24,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {652#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {652#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-07 12:19:24,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {652#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {652#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-07 12:19:24,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {652#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {645#false} is VALID [2022-04-07 12:19:24,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {645#false} ~l~0 := 1 + ~l~0; {645#false} is VALID [2022-04-07 12:19:24,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {645#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {645#false} is VALID [2022-04-07 12:19:24,742 INFO L272 TraceCheckUtils]: 15: Hoare triple {645#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {645#false} is VALID [2022-04-07 12:19:24,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {645#false} ~cond := #in~cond; {645#false} is VALID [2022-04-07 12:19:24,743 INFO L290 TraceCheckUtils]: 17: Hoare triple {645#false} assume 0 == ~cond; {645#false} is VALID [2022-04-07 12:19:24,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {645#false} assume !false; {645#false} is VALID [2022-04-07 12:19:24,743 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:19:24,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:19:24,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754794623] [2022-04-07 12:19:24,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754794623] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:19:24,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545945739] [2022-04-07 12:19:24,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:19:24,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:19:24,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:19:24,759 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-07 12:19:24,807 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-07 12:19:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:19:24,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-07 12:19:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:19:24,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:19:25,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {644#true} call ULTIMATE.init(); {644#true} is VALID [2022-04-07 12:19:25,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {644#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {644#true} is VALID [2022-04-07 12:19:25,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {644#true} assume true; {644#true} is VALID [2022-04-07 12:19:25,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {644#true} {644#true} #76#return; {644#true} is VALID [2022-04-07 12:19:25,463 INFO L272 TraceCheckUtils]: 4: Hoare triple {644#true} call #t~ret5 := main(); {644#true} is VALID [2022-04-07 12:19:25,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {644#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {673#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:19:25,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {673#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {673#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:19:25,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {673#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {673#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:19:25,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {673#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {683#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:19:25,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {683#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {687#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:19:25,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {687#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {687#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:19:25,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {687#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {687#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:19:25,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {687#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {697#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 12:19:25,470 INFO L290 TraceCheckUtils]: 13: Hoare triple {697#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} ~l~0 := 1 + ~l~0; {701#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1))} is VALID [2022-04-07 12:19:25,470 INFO L290 TraceCheckUtils]: 14: Hoare triple {701#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {701#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1))} is VALID [2022-04-07 12:19:25,471 INFO L272 TraceCheckUtils]: 15: Hoare triple {701#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {708#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:19:25,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {708#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {712#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:19:25,472 INFO L290 TraceCheckUtils]: 17: Hoare triple {712#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {645#false} is VALID [2022-04-07 12:19:25,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {645#false} assume !false; {645#false} is VALID [2022-04-07 12:19:25,473 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:19:25,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:19:25,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {645#false} assume !false; {645#false} is VALID [2022-04-07 12:19:25,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {712#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {645#false} is VALID [2022-04-07 12:19:25,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {708#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {712#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:19:25,818 INFO L272 TraceCheckUtils]: 15: Hoare triple {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {708#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:19:25,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:19:25,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {735#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:19:27,952 WARN L290 TraceCheckUtils]: 12: Hoare triple {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {735#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 12:19:27,953 INFO L290 TraceCheckUtils]: 11: Hoare triple {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:19:27,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:19:27,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {735#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:19:30,075 WARN L290 TraceCheckUtils]: 8: Hoare triple {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {735#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 12:19:30,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:19:30,080 INFO L290 TraceCheckUtils]: 6: Hoare triple {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:19:30,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {644#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:19:30,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {644#true} call #t~ret5 := main(); {644#true} is VALID [2022-04-07 12:19:30,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {644#true} {644#true} #76#return; {644#true} is VALID [2022-04-07 12:19:30,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {644#true} assume true; {644#true} is VALID [2022-04-07 12:19:30,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {644#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {644#true} is VALID [2022-04-07 12:19:30,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {644#true} call ULTIMATE.init(); {644#true} is VALID [2022-04-07 12:19:30,082 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-07 12:19:30,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545945739] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 12:19:30,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:19:30,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 9] total 17 [2022-04-07 12:19:30,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782410646] [2022-04-07 12:19:30,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:19:30,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 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-07 12:19:30,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:19:30,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 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-07 12:19:34,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 15 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 12:19:34,333 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:19:34,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:19:34,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:19:34,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-04-07 12:19:34,333 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 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-07 12:19:36,381 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:19:38,606 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:19:40,829 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:19:43,094 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:19:47,408 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:19:53,971 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:19:54,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:19:54,332 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-04-07 12:19:54,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:19:54,332 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 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-07 12:19:54,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:19:54,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 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-07 12:19:54,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-07 12:19:54,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 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-07 12:19:54,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-07 12:19:54,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2022-04-07 12:19:58,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 33 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 12:19:58,671 INFO L225 Difference]: With dead ends: 33 [2022-04-07 12:19:58,671 INFO L226 Difference]: Without dead ends: 28 [2022-04-07 12:19:58,671 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-07 12:19:58,672 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2022-04-07 12:19:58,672 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 6 Unknown, 0 Unchecked, 13.0s Time] [2022-04-07 12:19:58,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-07 12:19:58,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-04-07 12:19:58,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:19:58,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 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-07 12:19:58,704 INFO L74 IsIncluded]: Start isIncluded. First operand 28 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-07 12:19:58,704 INFO L87 Difference]: Start difference. First operand 28 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-07 12:19:58,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:19:58,707 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-07 12:19:58,707 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-07 12:19:58,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:19:58,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:19:58,709 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 28 states. [2022-04-07 12:19:58,709 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 28 states. [2022-04-07 12:19:58,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:19:58,712 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-07 12:19:58,712 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-07 12:19:58,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:19:58,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:19:58,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:19:58,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:19:58,714 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-07 12:19:58,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-04-07 12:19:58,716 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 19 [2022-04-07 12:19:58,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:19:58,717 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-04-07 12:19:58,717 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 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-07 12:19:58,717 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-07 12:19:58,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 12:19:58,718 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:19:58,718 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:19:58,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 12:19:58,924 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:19:58,924 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:19:58,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:19:58,928 INFO L85 PathProgramCache]: Analyzing trace with hash -2070632639, now seen corresponding path program 1 times [2022-04-07 12:19:58,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:19:58,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247133357] [2022-04-07 12:19:58,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:19:58,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:19:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:19:59,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:19:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:19:59,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {921#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {914#true} is VALID [2022-04-07 12:19:59,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {914#true} assume true; {914#true} is VALID [2022-04-07 12:19:59,057 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {914#true} {914#true} #76#return; {914#true} is VALID [2022-04-07 12:19:59,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {914#true} call ULTIMATE.init(); {921#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:19:59,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {921#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {914#true} is VALID [2022-04-07 12:19:59,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {914#true} assume true; {914#true} is VALID [2022-04-07 12:19:59,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {914#true} {914#true} #76#return; {914#true} is VALID [2022-04-07 12:19:59,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {914#true} call #t~ret5 := main(); {914#true} is VALID [2022-04-07 12:19:59,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {914#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {919#(= main_~l~0 0)} is VALID [2022-04-07 12:19:59,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {919#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {919#(= main_~l~0 0)} is VALID [2022-04-07 12:19:59,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {919#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {919#(= main_~l~0 0)} is VALID [2022-04-07 12:19:59,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {919#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {919#(= main_~l~0 0)} is VALID [2022-04-07 12:19:59,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {919#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {920#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 12:19:59,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {920#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {920#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 12:19:59,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {920#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {920#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 12:19:59,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {920#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {920#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 12:19:59,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {920#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {915#false} is VALID [2022-04-07 12:19:59,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {915#false} ~l~0 := 1 + ~l~0; {915#false} is VALID [2022-04-07 12:19:59,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {915#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {915#false} is VALID [2022-04-07 12:19:59,076 INFO L272 TraceCheckUtils]: 16: Hoare triple {915#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {915#false} is VALID [2022-04-07 12:19:59,076 INFO L290 TraceCheckUtils]: 17: Hoare triple {915#false} ~cond := #in~cond; {915#false} is VALID [2022-04-07 12:19:59,077 INFO L290 TraceCheckUtils]: 18: Hoare triple {915#false} assume 0 == ~cond; {915#false} is VALID [2022-04-07 12:19:59,077 INFO L290 TraceCheckUtils]: 19: Hoare triple {915#false} assume !false; {915#false} is VALID [2022-04-07 12:19:59,077 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:19:59,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:19:59,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247133357] [2022-04-07 12:19:59,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247133357] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:19:59,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965784517] [2022-04-07 12:19:59,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:19:59,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:19:59,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:19:59,079 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-07 12:19:59,080 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-07 12:19:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:19:59,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-07 12:19:59,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:19:59,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:19:59,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {914#true} call ULTIMATE.init(); {914#true} is VALID [2022-04-07 12:19:59,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {914#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {914#true} is VALID [2022-04-07 12:19:59,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {914#true} assume true; {914#true} is VALID [2022-04-07 12:19:59,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {914#true} {914#true} #76#return; {914#true} is VALID [2022-04-07 12:19:59,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {914#true} call #t~ret5 := main(); {914#true} is VALID [2022-04-07 12:19:59,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {914#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {940#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:19:59,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {940#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {940#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:19:59,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {940#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {940#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:19:59,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {940#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {950#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:19:59,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {950#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {954#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:19:59,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {954#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {954#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:19:59,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {954#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {954#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:19:59,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {954#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {954#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:19:59,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {954#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {967#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:19:59,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {967#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {971#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:19:59,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {971#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {971#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:19:59,610 INFO L272 TraceCheckUtils]: 16: Hoare triple {971#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {978#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:19:59,611 INFO L290 TraceCheckUtils]: 17: Hoare triple {978#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {982#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:19:59,611 INFO L290 TraceCheckUtils]: 18: Hoare triple {982#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {915#false} is VALID [2022-04-07 12:19:59,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {915#false} assume !false; {915#false} is VALID [2022-04-07 12:19:59,612 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:19:59,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:19:59,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {915#false} assume !false; {915#false} is VALID [2022-04-07 12:19:59,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {982#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {915#false} is VALID [2022-04-07 12:19:59,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {978#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {982#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:19:59,893 INFO L272 TraceCheckUtils]: 16: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {978#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:19:59,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:19:59,895 INFO L290 TraceCheckUtils]: 14: Hoare triple {1005#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:19:59,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {1005#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 12:19:59,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:19:59,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:19:59,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:19:59,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {1005#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:02,034 WARN L290 TraceCheckUtils]: 8: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {1005#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 12:20:02,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:02,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:02,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {914#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:02,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {914#true} call #t~ret5 := main(); {914#true} is VALID [2022-04-07 12:20:02,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {914#true} {914#true} #76#return; {914#true} is VALID [2022-04-07 12:20:02,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {914#true} assume true; {914#true} is VALID [2022-04-07 12:20:02,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {914#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {914#true} is VALID [2022-04-07 12:20:02,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {914#true} call ULTIMATE.init(); {914#true} is VALID [2022-04-07 12:20:02,036 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-07 12:20:02,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965784517] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 12:20:02,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:20:02,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-07 12:20:02,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049832902] [2022-04-07 12:20:02,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:20:02,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 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 20 [2022-04-07 12:20:02,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:20:02,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 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-07 12:20:04,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 17 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:20:04,238 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:20:04,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:20:04,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:20:04,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-07 12:20:04,239 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 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-07 12:20:08,490 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:20:10,718 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:20:12,953 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:20:15,124 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:20:17,247 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:20:19,534 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:20:19,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:20:19,777 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-07 12:20:19,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:20:19,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 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 20 [2022-04-07 12:20:19,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:20:19,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 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-07 12:20:19,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-07 12:20:19,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 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-07 12:20:19,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-07 12:20:19,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-04-07 12:20:21,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 38 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:20:21,993 INFO L225 Difference]: With dead ends: 40 [2022-04-07 12:20:21,993 INFO L226 Difference]: Without dead ends: 35 [2022-04-07 12:20:21,994 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-07 12:20:21,994 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2022-04-07 12:20:21,995 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 48 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 6 Unknown, 0 Unchecked, 13.0s Time] [2022-04-07 12:20:21,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-07 12:20:22,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-07 12:20:22,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:20:22,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:20:22,012 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:20:22,012 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:20:22,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:20:22,014 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2022-04-07 12:20:22,014 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2022-04-07 12:20:22,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:20:22,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:20:22,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-07 12:20:22,015 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-07 12:20:22,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:20:22,016 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2022-04-07 12:20:22,017 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2022-04-07 12:20:22,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:20:22,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:20:22,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:20:22,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:20:22,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:20:22,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-07 12:20:22,019 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 20 [2022-04-07 12:20:22,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:20:22,019 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-04-07 12:20:22,019 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 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-07 12:20:22,019 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-07 12:20:22,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 12:20:22,020 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:20:22,020 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:20:22,054 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-07 12:20:22,246 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:20:22,246 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:20:22,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:20:22,247 INFO L85 PathProgramCache]: Analyzing trace with hash 810499578, now seen corresponding path program 1 times [2022-04-07 12:20:22,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:20:22,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095576498] [2022-04-07 12:20:22,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:20:22,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:20:22,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:20:22,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:20:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:20:22,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {1232#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1233#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:20:22,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {1233#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {1233#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:20:22,682 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1233#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1220#true} #76#return; {1225#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:20:22,682 INFO L272 TraceCheckUtils]: 0: Hoare triple {1220#true} call ULTIMATE.init(); {1232#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:20:22,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {1232#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1233#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:20:22,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {1233#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {1233#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:20:22,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1233#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1220#true} #76#return; {1225#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:20:22,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {1225#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {1225#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:20:22,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {1225#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1226#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:20:22,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {1226#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1227#(= main_~l~0 0)} is VALID [2022-04-07 12:20:22,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {1227#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1227#(= main_~l~0 0)} is VALID [2022-04-07 12:20:22,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {1227#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {1227#(= main_~l~0 0)} is VALID [2022-04-07 12:20:22,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {1227#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {1228#(<= (+ (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296) 1) main_~l~0)} is VALID [2022-04-07 12:20:22,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {1228#(<= (+ (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296) 1) main_~l~0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1229#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-07 12:20:22,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {1229#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1229#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-07 12:20:22,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {1229#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1229#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-07 12:20:22,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {1229#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1229#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-07 12:20:22,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {1229#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {1230#(<= (+ (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-07 12:20:22,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {1230#(<= (+ (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} ~l~0 := 1 + ~l~0; {1231#(<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 2147483648) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} is VALID [2022-04-07 12:20:22,709 INFO L290 TraceCheckUtils]: 16: Hoare triple {1231#(<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 2147483648) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1221#false} is VALID [2022-04-07 12:20:22,709 INFO L272 TraceCheckUtils]: 17: Hoare triple {1221#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1221#false} is VALID [2022-04-07 12:20:22,709 INFO L290 TraceCheckUtils]: 18: Hoare triple {1221#false} ~cond := #in~cond; {1221#false} is VALID [2022-04-07 12:20:22,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {1221#false} assume 0 == ~cond; {1221#false} is VALID [2022-04-07 12:20:22,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {1221#false} assume !false; {1221#false} is VALID [2022-04-07 12:20:22,709 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:20:22,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:20:22,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095576498] [2022-04-07 12:20:22,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095576498] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:20:22,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555272995] [2022-04-07 12:20:22,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:20:22,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:20:22,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:20:22,722 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-07 12:20:22,728 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-07 12:20:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:20:22,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-07 12:20:22,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:20:22,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:20:23,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {1220#true} call ULTIMATE.init(); {1220#true} is VALID [2022-04-07 12:20:23,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {1220#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1220#true} is VALID [2022-04-07 12:20:23,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {1220#true} assume true; {1220#true} is VALID [2022-04-07 12:20:23,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1220#true} {1220#true} #76#return; {1220#true} is VALID [2022-04-07 12:20:23,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {1220#true} call #t~ret5 := main(); {1220#true} is VALID [2022-04-07 12:20:23,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {1220#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1252#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:23,518 INFO L290 TraceCheckUtils]: 6: Hoare triple {1252#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1252#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:23,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {1252#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1252#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:23,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {1252#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {1262#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:23,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {1262#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:23,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:23,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:23,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:23,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:23,526 INFO L290 TraceCheckUtils]: 14: Hoare triple {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {1282#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:23,527 INFO L290 TraceCheckUtils]: 15: Hoare triple {1282#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {1286#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:23,527 INFO L290 TraceCheckUtils]: 16: Hoare triple {1286#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1286#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:23,528 INFO L272 TraceCheckUtils]: 17: Hoare triple {1286#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1293#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:20:23,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {1293#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1297#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:20:23,529 INFO L290 TraceCheckUtils]: 19: Hoare triple {1297#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1221#false} is VALID [2022-04-07 12:20:23,529 INFO L290 TraceCheckUtils]: 20: Hoare triple {1221#false} assume !false; {1221#false} is VALID [2022-04-07 12:20:23,529 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:20:23,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:20:23,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {1221#false} assume !false; {1221#false} is VALID [2022-04-07 12:20:23,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {1297#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1221#false} is VALID [2022-04-07 12:20:23,911 INFO L290 TraceCheckUtils]: 18: Hoare triple {1293#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1297#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:20:23,912 INFO L272 TraceCheckUtils]: 17: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1293#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:20:23,912 INFO L290 TraceCheckUtils]: 16: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:23,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {1320#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:26,044 WARN L290 TraceCheckUtils]: 14: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {1320#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 12:20:26,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:26,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:26,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:26,059 INFO L290 TraceCheckUtils]: 10: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:26,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {1320#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:28,168 WARN L290 TraceCheckUtils]: 8: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {1320#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 12:20:28,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:28,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:28,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {1220#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:28,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {1220#true} call #t~ret5 := main(); {1220#true} is VALID [2022-04-07 12:20:28,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1220#true} {1220#true} #76#return; {1220#true} is VALID [2022-04-07 12:20:28,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {1220#true} assume true; {1220#true} is VALID [2022-04-07 12:20:28,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {1220#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1220#true} is VALID [2022-04-07 12:20:28,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {1220#true} call ULTIMATE.init(); {1220#true} is VALID [2022-04-07 12:20:28,171 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-07 12:20:28,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555272995] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 12:20:28,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:20:28,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 9] total 20 [2022-04-07 12:20:28,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533201842] [2022-04-07 12:20:28,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:20:28,172 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), 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 21 [2022-04-07 12:20:28,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:20:28,172 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), 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-07 12:20:32,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 17 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 12:20:32,404 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:20:32,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:20:32,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:20:32,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-04-07 12:20:32,405 INFO L87 Difference]: Start difference. First operand 34 states and 46 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), 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-07 12:20:34,467 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:20:36,627 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:20:38,793 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:20:40,905 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:20:43,027 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:20:45,206 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:20:47,317 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:20:49,492 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:20:49,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:20:49,678 INFO L93 Difference]: Finished difference Result 45 states and 61 transitions. [2022-04-07 12:20:49,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:20:49,678 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), 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 21 [2022-04-07 12:20:49,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:20:49,678 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), 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-07 12:20:49,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-07 12:20:49,680 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), 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-07 12:20:49,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-07 12:20:49,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-04-07 12:20:54,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 37 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 12:20:54,007 INFO L225 Difference]: With dead ends: 45 [2022-04-07 12:20:54,007 INFO L226 Difference]: Without dead ends: 40 [2022-04-07 12:20:54,008 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-04-07 12:20:54,009 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:20:54,009 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 8 Unknown, 0 Unchecked, 17.1s Time] [2022-04-07 12:20:54,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-07 12:20:54,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2022-04-07 12:20:54,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:20:54,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:20:54,023 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:20:54,023 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:20:54,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:20:54,024 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-07 12:20:54,024 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2022-04-07 12:20:54,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:20:54,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:20:54,025 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-07 12:20:54,025 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-07 12:20:54,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:20:54,027 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-07 12:20:54,027 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2022-04-07 12:20:54,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:20:54,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:20:54,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:20:54,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:20:54,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:20:54,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2022-04-07 12:20:54,029 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 21 [2022-04-07 12:20:54,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:20:54,029 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2022-04-07 12:20:54,029 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), 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-07 12:20:54,029 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2022-04-07 12:20:54,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 12:20:54,030 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:20:54,030 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:20:54,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-07 12:20:54,243 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:20:54,243 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:20:54,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:20:54,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1848843560, now seen corresponding path program 1 times [2022-04-07 12:20:54,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:20:54,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981962886] [2022-04-07 12:20:54,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:20:54,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:20:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:20:54,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:20:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:20:55,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {1571#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1572#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:20:55,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {1572#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {1572#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:20:55,015 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1572#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1555#true} #76#return; {1560#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:20:55,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {1555#true} call ULTIMATE.init(); {1571#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:20:55,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {1571#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1572#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:20:55,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {1572#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {1572#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:20:55,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1572#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1555#true} #76#return; {1560#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:20:55,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {1560#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {1560#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:20:55,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {1560#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1561#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:55,021 INFO L290 TraceCheckUtils]: 6: Hoare triple {1561#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1562#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:55,022 INFO L290 TraceCheckUtils]: 7: Hoare triple {1562#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1562#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:55,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {1562#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {1563#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (<= (div (+ 4294967294 main_~v2~0) 4294967296) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:55,023 INFO L290 TraceCheckUtils]: 9: Hoare triple {1563#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (<= (div (+ 4294967294 main_~v2~0) 4294967296) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {1564#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-07 12:20:55,024 INFO L290 TraceCheckUtils]: 10: Hoare triple {1564#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1565#(and (= main_~k~0 0) (= main_~j~0 0) (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-07 12:20:55,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {1565#(and (= main_~k~0 0) (= main_~j~0 0) (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1565#(and (= main_~k~0 0) (= main_~j~0 0) (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-07 12:20:55,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {1565#(and (= main_~k~0 0) (= main_~j~0 0) (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1565#(and (= main_~k~0 0) (= main_~j~0 0) (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-07 12:20:55,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {1565#(and (= main_~k~0 0) (= main_~j~0 0) (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1565#(and (= main_~k~0 0) (= main_~j~0 0) (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-07 12:20:55,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {1565#(and (= main_~k~0 0) (= main_~j~0 0) (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {1565#(and (= main_~k~0 0) (= main_~j~0 0) (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-07 12:20:55,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {1565#(and (= main_~k~0 0) (= main_~j~0 0) (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296);~k~0 := 1 + ~k~0; {1566#(and (<= (+ (* (div (+ main_~k~0 main_~v2~0 4294967293) 4294967296) 4294967296) 1) main_~l~0) (<= (+ main_~l~0 1) (+ main_~k~0 main_~v2~0)) (<= (+ main_~l~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~k~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-07 12:20:55,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {1566#(and (<= (+ (* (div (+ main_~k~0 main_~v2~0 4294967293) 4294967296) 4294967296) 1) main_~l~0) (<= (+ main_~l~0 1) (+ main_~k~0 main_~v2~0)) (<= (+ main_~l~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~k~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0) (<= (div main_~l~0 4294967296) 0))} ~l~0 := 1 + ~l~0; {1567#(and (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296))) (or (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (and (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~k~0 main_~v2~0)) (<= (+ main_~k~0 main_~v2~0) main_~l~0))) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:55,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {1567#(and (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296))) (or (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (and (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~k~0 main_~v2~0)) (<= (+ main_~k~0 main_~v2~0) main_~l~0))) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1568#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296))) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:55,037 INFO L272 TraceCheckUtils]: 18: Hoare triple {1568#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296))) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1569#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:20:55,038 INFO L290 TraceCheckUtils]: 19: Hoare triple {1569#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1570#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 12:20:55,038 INFO L290 TraceCheckUtils]: 20: Hoare triple {1570#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1556#false} is VALID [2022-04-07 12:20:55,038 INFO L290 TraceCheckUtils]: 21: Hoare triple {1556#false} assume !false; {1556#false} is VALID [2022-04-07 12:20:55,039 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:20:55,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:20:55,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981962886] [2022-04-07 12:20:55,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981962886] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:20:55,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711387638] [2022-04-07 12:20:55,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:20:55,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:20:55,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:20:55,041 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-07 12:20:55,042 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-07 12:20:55,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:20:55,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-07 12:20:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:20:55,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:20:57,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {1555#true} call ULTIMATE.init(); {1555#true} is VALID [2022-04-07 12:20:57,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {1555#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1555#true} is VALID [2022-04-07 12:20:57,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {1555#true} assume true; {1555#true} is VALID [2022-04-07 12:20:57,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1555#true} {1555#true} #76#return; {1555#true} is VALID [2022-04-07 12:20:57,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {1555#true} call #t~ret5 := main(); {1555#true} is VALID [2022-04-07 12:20:57,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {1555#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1562#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:57,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {1562#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1562#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:57,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {1562#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1562#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:57,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {1562#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {1563#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (<= (div (+ 4294967294 main_~v2~0) 4294967296) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:57,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {1563#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (<= (div (+ 4294967294 main_~v2~0) 4294967296) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {1564#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-07 12:20:57,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {1564#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1564#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-07 12:20:57,492 INFO L290 TraceCheckUtils]: 11: Hoare triple {1564#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1564#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-07 12:20:57,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {1564#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1564#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-07 12:20:57,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {1564#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1564#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-07 12:20:57,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {1564#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {1564#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-07 12:20:57,495 INFO L290 TraceCheckUtils]: 15: Hoare triple {1564#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296);~k~0 := 1 + ~k~0; {1621#(and (<= 1 main_~v2~0) (= main_~j~0 0) (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-07 12:20:57,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {1621#(and (<= 1 main_~v2~0) (= main_~j~0 0) (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} ~l~0 := 1 + ~l~0; {1625#(and (<= 1 main_~v2~0) (= main_~j~0 0) (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0) (<= (+ 2 (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296)) main_~l~0) (= main_~v4~0 0) (<= (div (+ (- 1) main_~l~0) 4294967296) 0) (<= main_~l~0 (+ main_~v2~0 1)) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:57,496 INFO L290 TraceCheckUtils]: 17: Hoare triple {1625#(and (<= 1 main_~v2~0) (= main_~j~0 0) (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0) (<= (+ 2 (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296)) main_~l~0) (= main_~v4~0 0) (<= (div (+ (- 1) main_~l~0) 4294967296) 0) (<= main_~l~0 (+ main_~v2~0 1)) (= main_~v3~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1625#(and (<= 1 main_~v2~0) (= main_~j~0 0) (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0) (<= (+ 2 (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296)) main_~l~0) (= main_~v4~0 0) (<= (div (+ (- 1) main_~l~0) 4294967296) 0) (<= main_~l~0 (+ main_~v2~0 1)) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:57,499 INFO L272 TraceCheckUtils]: 18: Hoare triple {1625#(and (<= 1 main_~v2~0) (= main_~j~0 0) (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0) (<= (+ 2 (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296)) main_~l~0) (= main_~v4~0 0) (<= (div (+ (- 1) main_~l~0) 4294967296) 0) (<= main_~l~0 (+ main_~v2~0 1)) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1632#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:20:57,500 INFO L290 TraceCheckUtils]: 19: Hoare triple {1632#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1636#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:20:57,500 INFO L290 TraceCheckUtils]: 20: Hoare triple {1636#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1556#false} is VALID [2022-04-07 12:20:57,500 INFO L290 TraceCheckUtils]: 21: Hoare triple {1556#false} assume !false; {1556#false} is VALID [2022-04-07 12:20:57,501 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:20:57,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:20:57,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {1556#false} assume !false; {1556#false} is VALID [2022-04-07 12:20:57,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {1636#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1556#false} is VALID [2022-04-07 12:20:57,871 INFO L290 TraceCheckUtils]: 19: Hoare triple {1632#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1636#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:20:57,872 INFO L272 TraceCheckUtils]: 18: Hoare triple {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1632#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:20:57,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:57,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {1659#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:57,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296);~k~0 := 1 + ~k~0; {1659#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 12:20:57,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:57,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:57,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:57,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:57,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:57,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {1659#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:00,009 WARN L290 TraceCheckUtils]: 8: Hoare triple {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {1659#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 12:21:00,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:00,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:00,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {1555#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:00,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {1555#true} call #t~ret5 := main(); {1555#true} is VALID [2022-04-07 12:21:00,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1555#true} {1555#true} #76#return; {1555#true} is VALID [2022-04-07 12:21:00,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {1555#true} assume true; {1555#true} is VALID [2022-04-07 12:21:00,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {1555#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1555#true} is VALID [2022-04-07 12:21:00,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {1555#true} call ULTIMATE.init(); {1555#true} is VALID [2022-04-07 12:21:00,011 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-07 12:21:00,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711387638] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 12:21:00,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:21:00,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14, 9] total 21 [2022-04-07 12:21:00,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110612840] [2022-04-07 12:21:00,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:21:00,012 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), 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 22 [2022-04-07 12:21:00,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:21:00,012 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), 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-07 12:21:02,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 19 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:21:02,167 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:21:02,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:21:02,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:21:02,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2022-04-07 12:21:02,168 INFO L87 Difference]: Start difference. First operand 35 states and 48 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), 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-07 12:21:04,230 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:21:06,402 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:21:08,587 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:21:10,698 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:21:13,013 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:21:15,129 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:21:17,248 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:21:19,472 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:21:21,615 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:21:21,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:21:21,820 INFO L93 Difference]: Finished difference Result 53 states and 75 transitions. [2022-04-07 12:21:21,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:21:21,820 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), 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 22 [2022-04-07 12:21:21,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:21:21,821 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), 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-07 12:21:21,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-07 12:21:21,822 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), 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-07 12:21:21,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-07 12:21:21,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-07 12:21:24,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 40 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:21:24,052 INFO L225 Difference]: With dead ends: 53 [2022-04-07 12:21:24,052 INFO L226 Difference]: Without dead ends: 48 [2022-04-07 12:21:24,053 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2022-04-07 12:21:24,053 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.3s IncrementalHoareTripleChecker+Time [2022-04-07 12:21:24,054 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 9 Unknown, 0 Unchecked, 19.3s Time] [2022-04-07 12:21:24,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-07 12:21:24,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-07 12:21:24,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:21:24,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:21:24,070 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:21:24,070 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:21:24,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:21:24,072 INFO L93 Difference]: Finished difference Result 48 states and 70 transitions. [2022-04-07 12:21:24,072 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2022-04-07 12:21:24,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:21:24,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:21:24,073 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-07 12:21:24,073 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-07 12:21:24,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:21:24,074 INFO L93 Difference]: Finished difference Result 48 states and 70 transitions. [2022-04-07 12:21:24,074 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2022-04-07 12:21:24,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:21:24,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:21:24,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:21:24,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:21:24,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:21:24,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2022-04-07 12:21:24,077 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 22 [2022-04-07 12:21:24,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:21:24,077 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2022-04-07 12:21:24,077 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), 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-07 12:21:24,077 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2022-04-07 12:21:24,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-07 12:21:24,077 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:21:24,077 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:21:24,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-07 12:21:24,296 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:21:24,296 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:21:24,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:21:24,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1315888599, now seen corresponding path program 1 times [2022-04-07 12:21:24,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:21:24,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206830836] [2022-04-07 12:21:24,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:21:24,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:21:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:21:24,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:21:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:21:24,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {1944#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1937#true} is VALID [2022-04-07 12:21:24,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {1937#true} assume true; {1937#true} is VALID [2022-04-07 12:21:24,361 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1937#true} {1937#true} #76#return; {1937#true} is VALID [2022-04-07 12:21:24,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {1937#true} call ULTIMATE.init(); {1944#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:21:24,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {1944#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1937#true} is VALID [2022-04-07 12:21:24,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {1937#true} assume true; {1937#true} is VALID [2022-04-07 12:21:24,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1937#true} {1937#true} #76#return; {1937#true} is VALID [2022-04-07 12:21:24,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {1937#true} call #t~ret5 := main(); {1937#true} is VALID [2022-04-07 12:21:24,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {1937#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1942#(= main_~l~0 0)} is VALID [2022-04-07 12:21:24,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {1942#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1942#(= main_~l~0 0)} is VALID [2022-04-07 12:21:24,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {1942#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1942#(= main_~l~0 0)} is VALID [2022-04-07 12:21:24,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {1942#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {1942#(= main_~l~0 0)} is VALID [2022-04-07 12:21:24,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {1942#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {1943#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 12:21:24,364 INFO L290 TraceCheckUtils]: 10: Hoare triple {1943#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1943#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 12:21:24,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {1943#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1943#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 12:21:24,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {1943#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1943#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 12:21:24,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {1943#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {1938#false} is VALID [2022-04-07 12:21:24,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {1938#false} ~l~0 := 1 + ~l~0; {1938#false} is VALID [2022-04-07 12:21:24,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {1938#false} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1938#false} is VALID [2022-04-07 12:21:24,366 INFO L290 TraceCheckUtils]: 16: Hoare triple {1938#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1938#false} is VALID [2022-04-07 12:21:24,366 INFO L290 TraceCheckUtils]: 17: Hoare triple {1938#false} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {1938#false} is VALID [2022-04-07 12:21:24,366 INFO L290 TraceCheckUtils]: 18: Hoare triple {1938#false} ~l~0 := 1 + ~l~0; {1938#false} is VALID [2022-04-07 12:21:24,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {1938#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1938#false} is VALID [2022-04-07 12:21:24,366 INFO L272 TraceCheckUtils]: 20: Hoare triple {1938#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1938#false} is VALID [2022-04-07 12:21:24,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {1938#false} ~cond := #in~cond; {1938#false} is VALID [2022-04-07 12:21:24,367 INFO L290 TraceCheckUtils]: 22: Hoare triple {1938#false} assume 0 == ~cond; {1938#false} is VALID [2022-04-07 12:21:24,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {1938#false} assume !false; {1938#false} is VALID [2022-04-07 12:21:24,367 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-07 12:21:24,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:21:24,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206830836] [2022-04-07 12:21:24,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206830836] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:21:24,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762695104] [2022-04-07 12:21:24,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:21:24,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:21:24,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:21:24,369 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-07 12:21:24,371 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-07 12:21:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:21:24,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-07 12:21:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:21:24,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:21:24,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {1937#true} call ULTIMATE.init(); {1937#true} is VALID [2022-04-07 12:21:24,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {1937#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1937#true} is VALID [2022-04-07 12:21:24,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {1937#true} assume true; {1937#true} is VALID [2022-04-07 12:21:24,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1937#true} {1937#true} #76#return; {1937#true} is VALID [2022-04-07 12:21:24,973 INFO L272 TraceCheckUtils]: 4: Hoare triple {1937#true} call #t~ret5 := main(); {1937#true} is VALID [2022-04-07 12:21:24,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {1937#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1963#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:21:24,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {1963#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1963#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:21:24,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {1963#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1963#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:21:24,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {1963#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {1973#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:21:24,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {1973#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {1977#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:21:24,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {1977#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1977#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:21:24,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {1977#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1977#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:21:24,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {1977#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1977#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:21:24,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {1977#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {1990#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 0))} is VALID [2022-04-07 12:21:24,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {1990#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {1994#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 0))} is VALID [2022-04-07 12:21:24,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {1994#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1994#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 0))} is VALID [2022-04-07 12:21:24,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {1994#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1994#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 0))} is VALID [2022-04-07 12:21:24,979 INFO L290 TraceCheckUtils]: 17: Hoare triple {1994#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {2004#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} is VALID [2022-04-07 12:21:24,979 INFO L290 TraceCheckUtils]: 18: Hoare triple {2004#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {2008#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} is VALID [2022-04-07 12:21:24,980 INFO L290 TraceCheckUtils]: 19: Hoare triple {2008#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {2008#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} is VALID [2022-04-07 12:21:24,980 INFO L272 TraceCheckUtils]: 20: Hoare triple {2008#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2015#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:21:24,981 INFO L290 TraceCheckUtils]: 21: Hoare triple {2015#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2019#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:21:24,983 INFO L290 TraceCheckUtils]: 22: Hoare triple {2019#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1938#false} is VALID [2022-04-07 12:21:24,983 INFO L290 TraceCheckUtils]: 23: Hoare triple {1938#false} assume !false; {1938#false} is VALID [2022-04-07 12:21:24,984 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:21:24,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:21:25,280 INFO L290 TraceCheckUtils]: 23: Hoare triple {1938#false} assume !false; {1938#false} is VALID [2022-04-07 12:21:25,284 INFO L290 TraceCheckUtils]: 22: Hoare triple {2019#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1938#false} is VALID [2022-04-07 12:21:25,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {2015#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2019#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:21:25,286 INFO L272 TraceCheckUtils]: 20: Hoare triple {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2015#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:21:25,286 INFO L290 TraceCheckUtils]: 19: Hoare triple {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:25,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {2042#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:27,392 WARN L290 TraceCheckUtils]: 17: Hoare triple {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {2042#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 12:21:27,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:27,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:27,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {2042#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:27,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {2042#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 12:21:27,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:27,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:27,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:27,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {2042#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:29,542 WARN L290 TraceCheckUtils]: 8: Hoare triple {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {2042#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 12:21:29,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:29,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:29,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {1937#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:29,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {1937#true} call #t~ret5 := main(); {1937#true} is VALID [2022-04-07 12:21:29,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1937#true} {1937#true} #76#return; {1937#true} is VALID [2022-04-07 12:21:29,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {1937#true} assume true; {1937#true} is VALID [2022-04-07 12:21:29,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {1937#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1937#true} is VALID [2022-04-07 12:21:29,546 INFO L272 TraceCheckUtils]: 0: Hoare triple {1937#true} call ULTIMATE.init(); {1937#true} is VALID [2022-04-07 12:21:29,546 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-07 12:21:29,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762695104] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 12:21:29,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:21:29,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 11] total 16 [2022-04-07 12:21:29,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327734461] [2022-04-07 12:21:29,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:21:29,547 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), 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 24 [2022-04-07 12:21:29,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:21:29,547 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), 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-07 12:21:33,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 17 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 12:21:33,859 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:21:33,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:21:33,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:21:33,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-04-07 12:21:33,860 INFO L87 Difference]: Start difference. First operand 48 states and 70 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), 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-07 12:21:35,917 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:21:38,081 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:21:40,283 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:21:42,397 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:21:46,733 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:21:46,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:21:46,879 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2022-04-07 12:21:46,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:21:46,879 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), 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 24 [2022-04-07 12:21:46,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:21:46,880 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), 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-07 12:21:46,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-07 12:21:46,881 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), 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-07 12:21:46,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-07 12:21:46,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-04-07 12:21:49,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 38 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:21:49,055 INFO L225 Difference]: With dead ends: 59 [2022-04-07 12:21:49,055 INFO L226 Difference]: Without dead ends: 54 [2022-04-07 12:21:49,056 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-04-07 12:21:49,056 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2022-04-07 12:21:49,056 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 48 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 5 Unknown, 0 Unchecked, 10.8s Time] [2022-04-07 12:21:49,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-07 12:21:49,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2022-04-07 12:21:49,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:21:49,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:21:49,071 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:21:49,071 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:21:49,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:21:49,073 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2022-04-07 12:21:49,073 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2022-04-07 12:21:49,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:21:49,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:21:49,073 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-07 12:21:49,073 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-07 12:21:49,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:21:49,075 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2022-04-07 12:21:49,075 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2022-04-07 12:21:49,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:21:49,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:21:49,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:21:49,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:21:49,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:21:49,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 66 transitions. [2022-04-07 12:21:49,077 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 66 transitions. Word has length 24 [2022-04-07 12:21:49,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:21:49,077 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 66 transitions. [2022-04-07 12:21:49,077 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), 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-07 12:21:49,077 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 66 transitions. [2022-04-07 12:21:49,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-07 12:21:49,077 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:21:49,078 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:21:49,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-07 12:21:49,291 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:21:49,291 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:21:49,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:21:49,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1010807906, now seen corresponding path program 1 times [2022-04-07 12:21:49,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:21:49,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754002196] [2022-04-07 12:21:49,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:21:49,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:21:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:21:49,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:21:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:21:49,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {2352#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {2353#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:21:49,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {2353#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {2353#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:21:49,535 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2353#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {2341#true} #76#return; {2346#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:21:49,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {2341#true} call ULTIMATE.init(); {2352#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:21:49,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {2352#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {2353#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:21:49,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {2353#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {2353#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:21:49,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2353#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {2341#true} #76#return; {2346#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:21:49,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {2346#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {2346#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:21:49,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {2346#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2347#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:21:49,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {2347#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {2348#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-07 12:21:49,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {2348#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2348#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-07 12:21:49,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {2348#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {2348#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-07 12:21:49,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {2348#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} ~l~0 := 1 + ~l~0; {2349#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} is VALID [2022-04-07 12:21:49,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {2349#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2349#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} is VALID [2022-04-07 12:21:49,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {2349#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2349#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} is VALID [2022-04-07 12:21:49,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {2349#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {2349#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} is VALID [2022-04-07 12:21:49,542 INFO L290 TraceCheckUtils]: 13: Hoare triple {2349#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {2349#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} is VALID [2022-04-07 12:21:49,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {2349#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {2349#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} is VALID [2022-04-07 12:21:49,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {2349#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} ~l~0 := 1 + ~l~0; {2350#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967297) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 2 (+ (* (div main_~l~0 4294967296) 4) main_~l~0))))} is VALID [2022-04-07 12:21:49,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {2350#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967297) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 2 (+ (* (div main_~l~0 4294967296) 4) main_~l~0))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2351#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 2 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)))} is VALID [2022-04-07 12:21:49,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {2351#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 2 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2351#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 2 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)))} is VALID [2022-04-07 12:21:49,548 INFO L290 TraceCheckUtils]: 18: Hoare triple {2351#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 2 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {2342#false} is VALID [2022-04-07 12:21:49,548 INFO L290 TraceCheckUtils]: 19: Hoare triple {2342#false} ~l~0 := 1 + ~l~0; {2342#false} is VALID [2022-04-07 12:21:49,548 INFO L290 TraceCheckUtils]: 20: Hoare triple {2342#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {2342#false} is VALID [2022-04-07 12:21:49,548 INFO L272 TraceCheckUtils]: 21: Hoare triple {2342#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2342#false} is VALID [2022-04-07 12:21:49,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {2342#false} ~cond := #in~cond; {2342#false} is VALID [2022-04-07 12:21:49,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {2342#false} assume 0 == ~cond; {2342#false} is VALID [2022-04-07 12:21:49,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {2342#false} assume !false; {2342#false} is VALID [2022-04-07 12:21:49,548 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:21:49,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:21:49,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754002196] [2022-04-07 12:21:49,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754002196] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:21:49,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671277235] [2022-04-07 12:21:49,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:21:49,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:21:49,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:21:49,549 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-07 12:21:49,550 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-07 12:21:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:21:49,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-07 12:21:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:21:49,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:21:50,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {2341#true} call ULTIMATE.init(); {2341#true} is VALID [2022-04-07 12:21:50,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {2341#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {2341#true} is VALID [2022-04-07 12:21:50,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {2341#true} assume true; {2341#true} is VALID [2022-04-07 12:21:50,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2341#true} {2341#true} #76#return; {2341#true} is VALID [2022-04-07 12:21:50,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {2341#true} call #t~ret5 := main(); {2341#true} is VALID [2022-04-07 12:21:50,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {2341#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2372#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:21:50,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {2372#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {2372#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:21:50,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {2372#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2372#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:21:50,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {2372#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {2382#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:21:50,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {2382#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {2386#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:21:50,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {2386#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2386#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:21:50,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {2386#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2386#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:21:50,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {2386#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {2386#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:21:50,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {2386#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {2386#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:21:50,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {2386#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {2402#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:21:50,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {2402#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {2406#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:21:50,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {2406#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2406#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:21:50,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {2406#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2406#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:21:50,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {2406#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {2416#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:21:50,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {2416#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {2420#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:21:50,233 INFO L290 TraceCheckUtils]: 20: Hoare triple {2420#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {2420#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:21:50,234 INFO L272 TraceCheckUtils]: 21: Hoare triple {2420#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2427#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:21:50,234 INFO L290 TraceCheckUtils]: 22: Hoare triple {2427#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2431#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:21:50,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {2431#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2342#false} is VALID [2022-04-07 12:21:50,235 INFO L290 TraceCheckUtils]: 24: Hoare triple {2342#false} assume !false; {2342#false} is VALID [2022-04-07 12:21:50,235 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:21:50,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:21:50,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {2342#false} assume !false; {2342#false} is VALID [2022-04-07 12:21:50,613 INFO L290 TraceCheckUtils]: 23: Hoare triple {2431#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2342#false} is VALID [2022-04-07 12:21:50,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {2427#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2431#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:21:50,614 INFO L272 TraceCheckUtils]: 21: Hoare triple {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2427#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:21:50,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:50,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {2454#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:52,722 WARN L290 TraceCheckUtils]: 18: Hoare triple {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {2454#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 12:21:52,723 INFO L290 TraceCheckUtils]: 17: Hoare triple {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:52,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:52,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {2454#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:54,830 WARN L290 TraceCheckUtils]: 14: Hoare triple {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {2454#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 12:21:54,831 INFO L290 TraceCheckUtils]: 13: Hoare triple {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:54,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:54,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:54,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:54,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {2454#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:56,950 WARN L290 TraceCheckUtils]: 8: Hoare triple {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {2454#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 12:21:56,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:56,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:56,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {2341#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:56,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {2341#true} call #t~ret5 := main(); {2341#true} is VALID [2022-04-07 12:21:56,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2341#true} {2341#true} #76#return; {2341#true} is VALID [2022-04-07 12:21:56,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {2341#true} assume true; {2341#true} is VALID [2022-04-07 12:21:56,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {2341#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {2341#true} is VALID [2022-04-07 12:21:56,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {2341#true} call ULTIMATE.init(); {2341#true} is VALID [2022-04-07 12:21:56,953 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-07 12:21:56,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671277235] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 12:21:56,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:21:56,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 11] total 21 [2022-04-07 12:21:56,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893835465] [2022-04-07 12:21:56,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:21:56,954 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), 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 25 [2022-04-07 12:21:56,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:21:56,954 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), 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-07 12:22:03,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 17 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-07 12:22:03,349 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:22:03,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:22:03,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:22:03,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2022-04-07 12:22:03,349 INFO L87 Difference]: Start difference. First operand 45 states and 66 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), 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-07 12:22:05,388 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:07,517 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:09,682 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:12,024 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:12,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:22:12,306 INFO L93 Difference]: Finished difference Result 56 states and 81 transitions. [2022-04-07 12:22:12,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:22:12,306 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), 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 25 [2022-04-07 12:22:12,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:22:12,307 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), 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-07 12:22:12,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-07 12:22:12,308 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), 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-07 12:22:12,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-07 12:22:12,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-04-07 12:22:18,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 36 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-07 12:22:18,693 INFO L225 Difference]: With dead ends: 56 [2022-04-07 12:22:18,693 INFO L226 Difference]: Without dead ends: 51 [2022-04-07 12:22:18,694 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2022-04-07 12:22:18,694 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-04-07 12:22:18,694 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 4 Unknown, 0 Unchecked, 8.5s Time] [2022-04-07 12:22:18,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-07 12:22:18,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2022-04-07 12:22:18,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:22:18,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 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-07 12:22:18,711 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 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-07 12:22:18,711 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 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-07 12:22:18,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:22:18,712 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2022-04-07 12:22:18,712 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 76 transitions. [2022-04-07 12:22:18,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:22:18,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:22:18,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 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 51 states. [2022-04-07 12:22:18,713 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 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 51 states. [2022-04-07 12:22:18,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:22:18,714 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2022-04-07 12:22:18,714 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 76 transitions. [2022-04-07 12:22:18,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:22:18,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:22:18,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:22:18,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:22:18,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 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-07 12:22:18,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2022-04-07 12:22:18,716 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 25 [2022-04-07 12:22:18,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:22:18,716 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2022-04-07 12:22:18,716 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), 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-07 12:22:18,716 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2022-04-07 12:22:18,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-07 12:22:18,717 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:22:18,717 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:22:18,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-07 12:22:18,931 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:22:18,931 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:22:18,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:22:18,932 INFO L85 PathProgramCache]: Analyzing trace with hash 430197904, now seen corresponding path program 1 times [2022-04-07 12:22:18,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:22:18,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984025318] [2022-04-07 12:22:18,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:22:18,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:22:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:22:19,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:22:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:22:19,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {2748#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {2740#true} is VALID [2022-04-07 12:22:19,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {2740#true} assume true; {2740#true} is VALID [2022-04-07 12:22:19,111 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2740#true} {2740#true} #76#return; {2740#true} is VALID [2022-04-07 12:22:19,112 INFO L272 TraceCheckUtils]: 0: Hoare triple {2740#true} call ULTIMATE.init(); {2748#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:22:19,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {2748#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {2740#true} is VALID [2022-04-07 12:22:19,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {2740#true} assume true; {2740#true} is VALID [2022-04-07 12:22:19,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2740#true} {2740#true} #76#return; {2740#true} is VALID [2022-04-07 12:22:19,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {2740#true} call #t~ret5 := main(); {2740#true} is VALID [2022-04-07 12:22:19,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {2740#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2745#(= main_~l~0 0)} is VALID [2022-04-07 12:22:19,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {2745#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {2745#(= main_~l~0 0)} is VALID [2022-04-07 12:22:19,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {2745#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2745#(= main_~l~0 0)} is VALID [2022-04-07 12:22:19,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {2745#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {2745#(= main_~l~0 0)} is VALID [2022-04-07 12:22:19,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {2745#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {2746#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:22:19,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {2746#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2746#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:22:19,115 INFO L290 TraceCheckUtils]: 11: Hoare triple {2746#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2746#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:22:19,115 INFO L290 TraceCheckUtils]: 12: Hoare triple {2746#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {2746#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:22:19,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {2746#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {2746#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:22:19,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {2746#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {2746#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:22:19,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {2746#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296);~k~0 := 1 + ~k~0; {2746#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:22:19,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {2746#(and (<= 1 main_~l~0) (<= main_~l~0 1))} ~l~0 := 1 + ~l~0; {2747#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 2 main_~l~0))} is VALID [2022-04-07 12:22:19,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {2747#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 2 main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2747#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 2 main_~l~0))} is VALID [2022-04-07 12:22:19,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {2747#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 2 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2747#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 2 main_~l~0))} is VALID [2022-04-07 12:22:19,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {2747#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 2 main_~l~0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {2741#false} is VALID [2022-04-07 12:22:19,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {2741#false} ~l~0 := 1 + ~l~0; {2741#false} is VALID [2022-04-07 12:22:19,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {2741#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {2741#false} is VALID [2022-04-07 12:22:19,122 INFO L272 TraceCheckUtils]: 22: Hoare triple {2741#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2741#false} is VALID [2022-04-07 12:22:19,122 INFO L290 TraceCheckUtils]: 23: Hoare triple {2741#false} ~cond := #in~cond; {2741#false} is VALID [2022-04-07 12:22:19,122 INFO L290 TraceCheckUtils]: 24: Hoare triple {2741#false} assume 0 == ~cond; {2741#false} is VALID [2022-04-07 12:22:19,122 INFO L290 TraceCheckUtils]: 25: Hoare triple {2741#false} assume !false; {2741#false} is VALID [2022-04-07 12:22:19,122 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:22:19,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:22:19,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984025318] [2022-04-07 12:22:19,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984025318] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:22:19,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117185336] [2022-04-07 12:22:19,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:22:19,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:22:19,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:22:19,124 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-07 12:22:19,125 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-07 12:22:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:22:19,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-07 12:22:19,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:22:19,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:22:19,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {2740#true} call ULTIMATE.init(); {2740#true} is VALID [2022-04-07 12:22:19,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {2740#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {2740#true} is VALID [2022-04-07 12:22:19,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {2740#true} assume true; {2740#true} is VALID [2022-04-07 12:22:19,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2740#true} {2740#true} #76#return; {2740#true} is VALID [2022-04-07 12:22:19,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {2740#true} call #t~ret5 := main(); {2740#true} is VALID [2022-04-07 12:22:19,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {2740#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2767#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:19,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {2767#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {2767#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:19,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {2767#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2767#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:19,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {2767#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {2777#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:19,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {2777#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {2781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:19,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {2781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:19,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {2781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:19,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {2781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {2781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:19,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {2781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {2781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:19,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {2781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {2781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:19,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {2781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296);~k~0 := 1 + ~k~0; {2800#(and (= main_~j~0 0) (= main_~v2~0 1) (= main_~k~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:19,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {2800#(and (= main_~j~0 0) (= main_~v2~0 1) (= main_~k~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {2804#(and (= main_~l~0 2) (= main_~j~0 0) (= main_~v2~0 1) (= main_~k~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:19,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {2804#(and (= main_~l~0 2) (= main_~j~0 0) (= main_~v2~0 1) (= main_~k~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2804#(and (= main_~l~0 2) (= main_~j~0 0) (= main_~v2~0 1) (= main_~k~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:19,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {2804#(and (= main_~l~0 2) (= main_~j~0 0) (= main_~v2~0 1) (= main_~k~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2804#(and (= main_~l~0 2) (= main_~j~0 0) (= main_~v2~0 1) (= main_~k~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:19,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {2804#(and (= main_~l~0 2) (= main_~j~0 0) (= main_~v2~0 1) (= main_~k~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {2814#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~j~0 0) (= main_~v2~0 1) (= main_~k~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 12:22:19,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {2814#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~j~0 0) (= main_~v2~0 1) (= main_~k~0 1) (= main_~i~0 0) (= main_~v4~0 0))} ~l~0 := 1 + ~l~0; {2818#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~k~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)))} is VALID [2022-04-07 12:22:19,738 INFO L290 TraceCheckUtils]: 21: Hoare triple {2818#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~k~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {2818#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~k~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)))} is VALID [2022-04-07 12:22:19,739 INFO L272 TraceCheckUtils]: 22: Hoare triple {2818#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~k~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2825#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:22:19,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {2825#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2829#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:22:19,740 INFO L290 TraceCheckUtils]: 24: Hoare triple {2829#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2741#false} is VALID [2022-04-07 12:22:19,740 INFO L290 TraceCheckUtils]: 25: Hoare triple {2741#false} assume !false; {2741#false} is VALID [2022-04-07 12:22:19,740 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:22:19,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:22:20,060 INFO L290 TraceCheckUtils]: 25: Hoare triple {2741#false} assume !false; {2741#false} is VALID [2022-04-07 12:22:20,060 INFO L290 TraceCheckUtils]: 24: Hoare triple {2829#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2741#false} is VALID [2022-04-07 12:22:20,060 INFO L290 TraceCheckUtils]: 23: Hoare triple {2825#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2829#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:22:20,061 INFO L272 TraceCheckUtils]: 22: Hoare triple {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2825#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:22:20,062 INFO L290 TraceCheckUtils]: 21: Hoare triple {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:20,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {2852#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:22,176 WARN L290 TraceCheckUtils]: 19: Hoare triple {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {2852#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 12:22:22,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:22,177 INFO L290 TraceCheckUtils]: 17: Hoare triple {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:22,180 INFO L290 TraceCheckUtils]: 16: Hoare triple {2852#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:22,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296);~k~0 := 1 + ~k~0; {2852#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 12:22:22,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:22,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:22,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:22,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:22,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:22,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {2852#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:24,300 WARN L290 TraceCheckUtils]: 8: Hoare triple {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {2852#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 12:22:24,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:24,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:24,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {2740#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:24,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {2740#true} call #t~ret5 := main(); {2740#true} is VALID [2022-04-07 12:22:24,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2740#true} {2740#true} #76#return; {2740#true} is VALID [2022-04-07 12:22:24,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {2740#true} assume true; {2740#true} is VALID [2022-04-07 12:22:24,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {2740#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {2740#true} is VALID [2022-04-07 12:22:24,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {2740#true} call ULTIMATE.init(); {2740#true} is VALID [2022-04-07 12:22:24,304 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-07 12:22:24,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117185336] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 12:22:24,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:22:24,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 11] total 17 [2022-04-07 12:22:24,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413190284] [2022-04-07 12:22:24,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:22:24,306 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 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 26 [2022-04-07 12:22:24,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:22:24,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 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-07 12:22:28,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 19 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 12:22:28,583 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:22:28,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:22:28,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:22:28,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-07 12:22:28,584 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 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-07 12:22:32,750 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:34,924 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:41,370 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:41,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:22:41,652 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2022-04-07 12:22:41,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:22:41,652 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 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 26 [2022-04-07 12:22:41,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:22:41,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 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-07 12:22:41,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-07 12:22:41,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 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-07 12:22:41,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-07 12:22:41,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 24 transitions. [2022-04-07 12:22:48,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 21 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-07 12:22:48,056 INFO L225 Difference]: With dead ends: 40 [2022-04-07 12:22:48,056 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 12:22:48,056 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-04-07 12:22:48,057 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-04-07 12:22:48,057 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 33 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 3 Unknown, 0 Unchecked, 6.6s Time] [2022-04-07 12:22:48,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 12:22:48,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 12:22:48,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:22:48,057 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 12:22:48,058 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 12:22:48,058 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 12:22:48,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:22:48,058 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 12:22:48,058 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 12:22:48,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:22:48,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:22:48,058 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 12:22:48,058 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 12:22:48,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:22:48,058 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 12:22:48,058 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 12:22:48,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:22:48,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:22:48,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:22:48,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:22:48,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 12:22:48,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 12:22:48,059 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2022-04-07 12:22:48,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:22:48,059 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 12:22:48,059 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 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-07 12:22:48,059 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 12:22:48,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:22:48,061 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 12:22:48,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-07 12:22:48,271 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,SelfDestructingSolverStorable10 [2022-04-07 12:22:48,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 12:22:48,389 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-07 12:22:48,389 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-07 12:22:48,389 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-07 12:22:48,389 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 5 7) no Hoare annotation was computed. [2022-04-07 12:22:48,389 INFO L882 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2022-04-07 12:22:48,389 INFO L882 garLoopResultBuilder]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2022-04-07 12:22:48,389 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2022-04-07 12:22:48,389 INFO L882 garLoopResultBuilder]: For program point L31(lines 31 34) no Hoare annotation was computed. [2022-04-07 12:22:48,389 INFO L882 garLoopResultBuilder]: For program point L29(lines 29 34) no Hoare annotation was computed. [2022-04-07 12:22:48,389 INFO L882 garLoopResultBuilder]: For program point L31-2(lines 23 34) no Hoare annotation was computed. [2022-04-07 12:22:48,389 INFO L882 garLoopResultBuilder]: For program point L27(lines 27 34) no Hoare annotation was computed. [2022-04-07 12:22:48,389 INFO L882 garLoopResultBuilder]: For program point L25(lines 25 34) no Hoare annotation was computed. [2022-04-07 12:22:48,389 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 16 39) no Hoare annotation was computed. [2022-04-07 12:22:48,390 INFO L882 garLoopResultBuilder]: For program point L23(lines 23 34) no Hoare annotation was computed. [2022-04-07 12:22:48,390 INFO L878 garLoopResultBuilder]: At program point L21-2(lines 21 36) the Hoare annotation is: (or (= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296)) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))) [2022-04-07 12:22:48,390 INFO L878 garLoopResultBuilder]: At program point L21-3(lines 21 36) the Hoare annotation is: (or (= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296)) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))) [2022-04-07 12:22:48,390 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 16 39) no Hoare annotation was computed. [2022-04-07 12:22:48,390 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 16 39) the Hoare annotation is: true [2022-04-07 12:22:48,390 INFO L882 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2022-04-07 12:22:48,390 INFO L882 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-04-07 12:22:48,390 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-07 12:22:48,390 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-07 12:22:48,390 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-07 12:22:48,390 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-07 12:22:48,390 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2022-04-07 12:22:48,390 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 12:22:48,390 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-07 12:22:48,391 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2022-04-07 12:22:48,391 INFO L882 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2022-04-07 12:22:48,391 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 8 13) no Hoare annotation was computed. [2022-04-07 12:22:48,391 INFO L882 garLoopResultBuilder]: For program point L9(lines 9 11) no Hoare annotation was computed. [2022-04-07 12:22:48,391 INFO L882 garLoopResultBuilder]: For program point L9-2(lines 8 13) no Hoare annotation was computed. [2022-04-07 12:22:48,391 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2022-04-07 12:22:48,393 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:22:48,393 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 12:22:48,396 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-07 12:22:48,396 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 12:22:48,406 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-07 12:22:48,406 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-07 12:22:48,406 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-07 12:22:48,406 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-07 12:22:48,406 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 12:22:48,406 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 12:22:48,407 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-07 12:22:48,407 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-07 12:22:48,407 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-07 12:22:48,407 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-07 12:22:48,407 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-07 12:22:48,407 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-07 12:22:48,407 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 12:22:48,407 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 12:22:48,407 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-07 12:22:48,407 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 12:22:48,408 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-07 12:22:48,409 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-07 12:22:48,409 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-07 12:22:48,409 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-07 12:22:48,409 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 12:22:48,409 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-07 12:22:48,409 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-07 12:22:48,409 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-07 12:22:48,409 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:22:48,409 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-07 12:22:48,409 WARN L170 areAnnotationChecker]: L31-2 has no Hoare annotation [2022-04-07 12:22:48,409 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-07 12:22:48,409 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-07 12:22:48,409 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-07 12:22:48,409 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-07 12:22:48,409 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-07 12:22:48,409 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-07 12:22:48,409 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-07 12:22:48,409 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-07 12:22:48,409 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-07 12:22:48,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 12:22:48 BoogieIcfgContainer [2022-04-07 12:22:48,416 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 12:22:48,416 INFO L158 Benchmark]: Toolchain (without parser) took 291727.80ms. Allocated memory was 186.6MB in the beginning and 242.2MB in the end (delta: 55.6MB). Free memory was 157.1MB in the beginning and 131.5MB in the end (delta: 25.6MB). Peak memory consumption was 80.7MB. Max. memory is 8.0GB. [2022-04-07 12:22:48,416 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 186.6MB. Free memory is still 142.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 12:22:48,417 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.59ms. Allocated memory was 186.6MB in the beginning and 242.2MB in the end (delta: 55.6MB). Free memory was 156.9MB in the beginning and 211.7MB in the end (delta: -54.8MB). Peak memory consumption was 6.5MB. Max. memory is 8.0GB. [2022-04-07 12:22:48,417 INFO L158 Benchmark]: Boogie Preprocessor took 38.48ms. Allocated memory is still 242.2MB. Free memory was 211.7MB in the beginning and 210.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 12:22:48,417 INFO L158 Benchmark]: RCFGBuilder took 6801.42ms. Allocated memory is still 242.2MB. Free memory was 210.1MB in the beginning and 197.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 12:22:48,417 INFO L158 Benchmark]: TraceAbstraction took 284578.08ms. Allocated memory is still 242.2MB. Free memory was 197.0MB in the beginning and 131.5MB in the end (delta: 65.6MB). Peak memory consumption was 66.1MB. Max. memory is 8.0GB. [2022-04-07 12:22:48,418 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 186.6MB. Free memory is still 142.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 305.59ms. Allocated memory was 186.6MB in the beginning and 242.2MB in the end (delta: 55.6MB). Free memory was 156.9MB in the beginning and 211.7MB in the end (delta: -54.8MB). Peak memory consumption was 6.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.48ms. Allocated memory is still 242.2MB. Free memory was 211.7MB in the beginning and 210.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 6801.42ms. Allocated memory is still 242.2MB. Free memory was 210.1MB in the beginning and 197.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 284578.08ms. Allocated memory is still 242.2MB. Free memory was 197.0MB in the beginning and 131.5MB in the end (delta: 65.6MB). Peak memory consumption was 66.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 10]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 284.5s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 208.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 53 mSolverCounterUnknown, 121 SdHoareTripleChecker+Valid, 115.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 120 mSDsluCounter, 491 SdHoareTripleChecker+Invalid, 109.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 324 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 465 IncrementalHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 167 mSDtfsCounter, 465 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 449 GetRequests, 272 SyntacticMatches, 28 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=8, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 32 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 17 PreInvPairs, 24 NumberOfFragments, 64 HoareAnnotationTreeSize, 17 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 471 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 40.3s InterpolantComputationTime, 384 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 529 ConstructedInterpolants, 0 QuantifiedInterpolants, 6679 SizeOfPredicates, 8 NumberOfNonLiveVariables, 738 ConjunctsInSsa, 208 ConjunctsInUnsatCore, 27 InterpolantComputations, 11 PerfectInterpolantSequences, 88/181 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: ((i + k + j + v3 + v2 + v4) % 4294967296 == l % 4294967296 || !(20000001 <= SIZE)) || !(SIZE <= 20000001) RESULT: Ultimate proved your program to be correct! [2022-04-07 12:22:48,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...