/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/sumt5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:31:56,932 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:31:56,934 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:31:56,979 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:31:56,979 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:31:56,981 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:31:56,984 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:31:56,988 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:31:56,990 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:31:56,994 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:31:56,995 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:31:56,996 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:31:56,996 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:31:56,998 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:31:56,999 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:31:57,002 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:31:57,002 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:31:57,003 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:31:57,005 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:31:57,010 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:31:57,012 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:31:57,013 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:31:57,013 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:31:57,014 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:31:57,015 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:31:57,021 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:31:57,022 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:31:57,022 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:31:57,023 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:31:57,023 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:31:57,024 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:31:57,024 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:31:57,026 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:31:57,026 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:31:57,027 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:31:57,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:31:57,028 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:31:57,028 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:31:57,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:31:57,028 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:31:57,029 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:31:57,031 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:31:57,031 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-27 11:31:57,062 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:31:57,062 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:31:57,062 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:31:57,063 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:31:57,063 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:31:57,063 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:31:57,064 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:31:57,064 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:31:57,064 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:31:57,065 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:31:57,065 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:31:57,065 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:31:57,065 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:31:57,065 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:31:57,065 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:31:57,065 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:31:57,066 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:31:57,066 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:31:57,067 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:31:57,067 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:31:57,067 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:31:57,067 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:31:57,067 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:31:57,067 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:31:57,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:31:57,068 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:31:57,068 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:31:57,068 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:31:57,068 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:31:57,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:31:57,068 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:31:57,068 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:31:57,068 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:31:57,069 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-27 11:31:57,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:31:57,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:31:57,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:31:57,280 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:31:57,281 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:31:57,282 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt5.c [2022-04-27 11:31:57,351 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a2089bcb/014ddeb15d4140daa9cd3892c1320136/FLAG022f2b7d3 [2022-04-27 11:31:57,705 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:31:57,705 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt5.c [2022-04-27 11:31:57,711 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a2089bcb/014ddeb15d4140daa9cd3892c1320136/FLAG022f2b7d3 [2022-04-27 11:31:58,142 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a2089bcb/014ddeb15d4140daa9cd3892c1320136 [2022-04-27 11:31:58,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:31:58,145 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:31:58,146 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:31:58,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:31:58,150 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:31:58,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:31:58" (1/1) ... [2022-04-27 11:31:58,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72b64217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:31:58, skipping insertion in model container [2022-04-27 11:31:58,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:31:58" (1/1) ... [2022-04-27 11:31:58,158 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:31:58,168 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:31:58,311 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/sumt5.c[403,416] [2022-04-27 11:31:58,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:31:58,336 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:31:58,346 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/sumt5.c[403,416] [2022-04-27 11:31:58,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:31:58,364 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:31:58,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:31:58 WrapperNode [2022-04-27 11:31:58,365 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:31:58,366 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:31:58,366 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:31:58,366 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:31:58,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:31:58" (1/1) ... [2022-04-27 11:31:58,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:31:58" (1/1) ... [2022-04-27 11:31:58,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:31:58" (1/1) ... [2022-04-27 11:31:58,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:31:58" (1/1) ... [2022-04-27 11:31:58,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:31:58" (1/1) ... [2022-04-27 11:31:58,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:31:58" (1/1) ... [2022-04-27 11:31:58,390 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:31:58" (1/1) ... [2022-04-27 11:31:58,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:31:58,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:31:58,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:31:58,393 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:31:58,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:31:58" (1/1) ... [2022-04-27 11:31:58,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:31:58,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:31:58,422 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-27 11:31:58,432 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-27 11:31:58,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:31:58,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:31:58,456 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:31:58,456 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 11:31:58,456 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:31:58,456 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:31:58,456 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:31:58,456 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:31:58,456 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:31:58,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:31:58,457 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 11:31:58,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:31:58,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 11:31:58,457 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:31:58,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:31:58,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:31:58,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:31:58,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:31:58,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:31:58,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:31:58,505 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:31:58,506 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:32:02,988 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:32:02,994 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:32:02,995 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 11:32:02,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:32:02 BoogieIcfgContainer [2022-04-27 11:32:02,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:32:02,998 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:32:02,998 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:32:03,005 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:32:03,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:31:58" (1/3) ... [2022-04-27 11:32:03,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fcaded3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:32:03, skipping insertion in model container [2022-04-27 11:32:03,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:31:58" (2/3) ... [2022-04-27 11:32:03,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fcaded3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:32:03, skipping insertion in model container [2022-04-27 11:32:03,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:32:02" (3/3) ... [2022-04-27 11:32:03,008 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt5.c [2022-04-27 11:32:03,021 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:32:03,021 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:32:03,059 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:32:03,064 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1fa4eef5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1513a3ef [2022-04-27 11:32:03,065 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:32:03,072 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 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-27 11:32:03,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 11:32:03,078 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:32:03,078 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:32:03,079 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:32:03,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:32:03,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1530412705, now seen corresponding path program 1 times [2022-04-27 11:32:03,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:32:03,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940644486] [2022-04-27 11:32:03,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:32:03,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:32:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:32:03,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:32:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:32:03,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#(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; {28#true} is VALID [2022-04-27 11:32:03,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-27 11:32:03,520 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #71#return; {28#true} is VALID [2022-04-27 11:32:03,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {36#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:32:03,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#(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; {28#true} is VALID [2022-04-27 11:32:03,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-27 11:32:03,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #71#return; {28#true} is VALID [2022-04-27 11:32:03,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret5 := main(); {28#true} is VALID [2022-04-27 11:32:03,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {33#(and (= 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-27 11:32:03,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {33#(and (= main_~k~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); {33#(and (= 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-27 11:32:03,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#(and (= main_~k~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); {33#(and (= 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-27 11:32:03,527 INFO L272 TraceCheckUtils]: 8: Hoare triple {33#(and (= main_~k~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {34#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:32:03,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {35#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:32:03,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {29#false} is VALID [2022-04-27 11:32:03,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-27 11:32:03,529 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-27 11:32:03,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:32:03,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940644486] [2022-04-27 11:32:03,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940644486] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:32:03,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:32:03,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 11:32:03,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259930696] [2022-04-27 11:32:03,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:32:03,537 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-27 11:32:03,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:32:03,541 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-27 11:32:03,556 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-27 11:32:03,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 11:32:03,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:32:03,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 11:32:03,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 11:32:03,583 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 6 states have (on average 1.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-27 11:32:05,824 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-27 11:32:10,249 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-27 11:32:14,599 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-27 11:32:14,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:32:14,968 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2022-04-27 11:32:14,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 11:32:14,968 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-27 11:32:14,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:32:14,970 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-27 11:32:14,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-27 11:32:14,984 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-27 11:32:14,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-27 11:32:14,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 60 transitions. [2022-04-27 11:32:15,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:32:15,066 INFO L225 Difference]: With dead ends: 47 [2022-04-27 11:32:15,066 INFO L226 Difference]: Without dead ends: 20 [2022-04-27 11:32:15,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 11:32:15,071 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 35 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 9 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:32:15,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 46 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 71 Invalid, 3 Unknown, 0 Unchecked, 6.4s Time] [2022-04-27 11:32:15,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-27 11:32:15,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-04-27 11:32:15,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:32:15,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:32:15,097 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:32:15,098 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:32:15,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:32:15,100 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2022-04-27 11:32:15,100 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-27 11:32:15,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:32:15,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:32:15,101 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-27 11:32:15,102 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-27 11:32:15,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:32:15,104 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2022-04-27 11:32:15,104 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-27 11:32:15,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:32:15,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:32:15,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:32:15,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:32:15,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:32:15,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-04-27 11:32:15,108 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2022-04-27 11:32:15,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:32:15,109 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-04-27 11:32:15,109 INFO L496 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-27 11:32:15,109 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-04-27 11:32:15,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 11:32:15,110 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:32:15,110 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:32:15,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:32:15,110 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:32:15,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:32:15,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1637920365, now seen corresponding path program 1 times [2022-04-27 11:32:15,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:32:15,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854979266] [2022-04-27 11:32:15,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:32:15,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:32:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:32:15,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:32:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:32:15,740 INFO L290 TraceCheckUtils]: 0: Hoare triple {185#(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; {173#true} is VALID [2022-04-27 11:32:15,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#true} assume true; {173#true} is VALID [2022-04-27 11:32:15,741 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {173#true} {173#true} #71#return; {173#true} is VALID [2022-04-27 11:32:15,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {173#true} call ULTIMATE.init(); {185#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:32:15,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {185#(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; {173#true} is VALID [2022-04-27 11:32:15,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {173#true} assume true; {173#true} is VALID [2022-04-27 11:32:15,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {173#true} {173#true} #71#return; {173#true} is VALID [2022-04-27 11:32:15,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {173#true} call #t~ret5 := main(); {173#true} is VALID [2022-04-27 11:32:15,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {173#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {178#(and (= 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-27 11:32:15,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {178#(and (= main_~k~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); {178#(and (= 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-27 11:32:15,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {178#(and (= main_~k~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); {179#(and (= main_~k~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-27 11:32:15,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {179#(and (= main_~k~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 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {180#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~v3~0)) (= main_~k~0 0) (<= main_~v3~0 1) (= main_~j~0 0) (<= 1 main_~v3~0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-27 11:32:15,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {180#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~v3~0)) (= main_~k~0 0) (<= main_~v3~0 1) (= main_~j~0 0) (<= 1 main_~v3~0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} ~l~0 := 1 + ~l~0; {181#(and (= main_~k~0 0) (< (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~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_~v4~0) 4294967296))) (= main_~i~0 0) (= main_~v4~0 0) (or (and (<= main_~v3~0 main_~l~0) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v3~0))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0))))} is VALID [2022-04-27 11:32:15,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {181#(and (= main_~k~0 0) (< (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~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_~v4~0) 4294967296))) (= main_~i~0 0) (= main_~v4~0 0) (or (and (<= main_~v3~0 main_~l~0) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v3~0))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0))))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {182#(and (= main_~k~0 0) (< (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0 1)) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~v3~0 (+ 4294967295 (* (div main_~l~0 4294967296) 4294967296))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0)))} is VALID [2022-04-27 11:32:15,756 INFO L272 TraceCheckUtils]: 11: Hoare triple {182#(and (= main_~k~0 0) (< (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0 1)) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~v3~0 (+ 4294967295 (* (div main_~l~0 4294967296) 4294967296))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0)))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {183#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:32:15,757 INFO L290 TraceCheckUtils]: 12: Hoare triple {183#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {184#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:32:15,758 INFO L290 TraceCheckUtils]: 13: Hoare triple {184#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {174#false} is VALID [2022-04-27 11:32:15,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {174#false} assume !false; {174#false} is VALID [2022-04-27 11:32:15,758 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-27 11:32:15,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:32:15,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854979266] [2022-04-27 11:32:15,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854979266] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:32:15,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696387516] [2022-04-27 11:32:15,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:32:15,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:32:15,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:32:15,764 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-27 11:32:15,766 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-27 11:32:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:32:15,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 11:32:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:32:15,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:32:16,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {173#true} call ULTIMATE.init(); {173#true} is VALID [2022-04-27 11:32:16,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#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; {173#true} is VALID [2022-04-27 11:32:16,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {173#true} assume true; {173#true} is VALID [2022-04-27 11:32:16,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {173#true} {173#true} #71#return; {173#true} is VALID [2022-04-27 11:32:16,270 INFO L272 TraceCheckUtils]: 4: Hoare triple {173#true} call #t~ret5 := main(); {173#true} is VALID [2022-04-27 11:32:16,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {173#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {178#(and (= 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-27 11:32:16,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {178#(and (= main_~k~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); {178#(and (= 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-27 11:32:16,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {178#(and (= main_~k~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); {178#(and (= 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-27 11:32:16,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {178#(and (= main_~k~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 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {213#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-27 11:32:16,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {213#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {217#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-27 11:32:16,275 INFO L290 TraceCheckUtils]: 10: Hoare triple {217#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {217#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-27 11:32:16,276 INFO L272 TraceCheckUtils]: 11: Hoare triple {217#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {224#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:32:16,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {224#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {228#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:32:16,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {228#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {174#false} is VALID [2022-04-27 11:32:16,277 INFO L290 TraceCheckUtils]: 14: Hoare triple {174#false} assume !false; {174#false} is VALID [2022-04-27 11:32:16,278 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-27 11:32:16,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:32:16,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {174#false} assume !false; {174#false} is VALID [2022-04-27 11:32:16,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {228#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {174#false} is VALID [2022-04-27 11:32:16,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {224#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {228#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:32:16,747 INFO L272 TraceCheckUtils]: 11: Hoare triple {244#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {224#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:32:16,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {244#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {244#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:32:16,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {251#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {244#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:32:18,860 WARN L290 TraceCheckUtils]: 8: Hoare triple {244#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~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; {251#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-27 11:32:18,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {244#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {244#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:32:18,863 INFO L290 TraceCheckUtils]: 6: Hoare triple {244#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {244#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:32:18,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {173#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {244#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:32:18,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {173#true} call #t~ret5 := main(); {173#true} is VALID [2022-04-27 11:32:18,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {173#true} {173#true} #71#return; {173#true} is VALID [2022-04-27 11:32:18,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {173#true} assume true; {173#true} is VALID [2022-04-27 11:32:18,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#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; {173#true} is VALID [2022-04-27 11:32:18,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {173#true} call ULTIMATE.init(); {173#true} is VALID [2022-04-27 11:32:18,865 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-27 11:32:18,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696387516] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 11:32:18,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:32:18,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 7] total 16 [2022-04-27 11:32:18,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163785107] [2022-04-27 11:32:18,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:32:18,868 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-27 11:32:18,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:32:18,868 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-27 11:32:21,014 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-27 11:32:21,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 11:32:21,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:32:21,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 11:32:21,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-27 11:32:21,016 INFO L87 Difference]: Start difference. First operand 19 states and 23 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-27 11:32:23,096 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-27 11:32:27,499 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-27 11:32:31,829 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-27 11:32:34,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:32:34,248 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-04-27 11:32:34,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 11:32:34,249 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-27 11:32:34,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:32:34,249 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-27 11:32:34,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-04-27 11:32:34,251 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-27 11:32:34,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-04-27 11:32:34,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 31 transitions. [2022-04-27 11:32:36,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 30 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 11:32:36,413 INFO L225 Difference]: With dead ends: 27 [2022-04-27 11:32:36,413 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 11:32:36,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-04-27 11:32:36,415 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:32:36,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 3 Unknown, 0 Unchecked, 6.3s Time] [2022-04-27 11:32:36,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 11:32:36,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-27 11:32:36,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:32:36,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:32:36,419 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:32:36,419 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:32:36,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:32:36,421 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-27 11:32:36,421 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-27 11:32:36,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:32:36,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:32:36,422 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-27 11:32:36,422 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-27 11:32:36,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:32:36,425 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-27 11:32:36,430 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-27 11:32:36,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:32:36,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:32:36,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:32:36,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:32:36,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:32:36,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-04-27 11:32:36,434 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 15 [2022-04-27 11:32:36,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:32:36,434 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-04-27 11:32:36,435 INFO L496 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-27 11:32:36,435 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-27 11:32:36,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 11:32:36,436 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:32:36,436 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:32:36,464 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-27 11:32:36,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:32:36,660 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:32:36,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:32:36,661 INFO L85 PathProgramCache]: Analyzing trace with hash -469553554, now seen corresponding path program 1 times [2022-04-27 11:32:36,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:32:36,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622073296] [2022-04-27 11:32:36,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:32:36,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:32:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:32:36,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:32:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:32:36,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {402#(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; {403#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 11:32:36,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {403#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {403#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 11:32:36,918 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {403#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {394#true} #71#return; {399#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:32:36,919 INFO L272 TraceCheckUtils]: 0: Hoare triple {394#true} call ULTIMATE.init(); {402#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:32:36,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {402#(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; {403#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 11:32:36,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {403#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {403#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 11:32:36,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {403#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {394#true} #71#return; {399#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:32:36,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {399#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {399#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:32:36,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {399#(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;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {400#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:32:36,923 INFO L290 TraceCheckUtils]: 6: Hoare triple {400#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {401#(= main_~l~0 0)} is VALID [2022-04-27 11:32:36,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {401#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {401#(= main_~l~0 0)} is VALID [2022-04-27 11:32:36,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {401#(= main_~l~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); {395#false} is VALID [2022-04-27 11:32:36,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {395#false} 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; {395#false} is VALID [2022-04-27 11:32:36,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {395#false} ~l~0 := 1 + ~l~0; {395#false} is VALID [2022-04-27 11:32:36,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {395#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {395#false} is VALID [2022-04-27 11:32:36,925 INFO L272 TraceCheckUtils]: 12: Hoare triple {395#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {395#false} is VALID [2022-04-27 11:32:36,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {395#false} ~cond := #in~cond; {395#false} is VALID [2022-04-27 11:32:36,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {395#false} assume 0 == ~cond; {395#false} is VALID [2022-04-27 11:32:36,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {395#false} assume !false; {395#false} is VALID [2022-04-27 11:32:36,925 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-27 11:32:36,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:32:36,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622073296] [2022-04-27 11:32:36,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622073296] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:32:36,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:32:36,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 11:32:36,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122217508] [2022-04-27 11:32:36,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:32:36,926 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-27 11:32:36,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:32:36,927 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-27 11:32:39,119 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-27 11:32:39,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 11:32:39,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:32:39,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 11:32:39,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-27 11:32:39,120 INFO L87 Difference]: Start difference. First operand 21 states and 26 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-27 11:32:43,461 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-27 11:32:47,851 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-27 11:32:48,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:32:48,110 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-04-27 11:32:48,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 11:32:48,110 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-27 11:32:48,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:32:48,110 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-27 11:32:48,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-27 11:32:48,112 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-27 11:32:48,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-27 11:32:48,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-27 11:32:50,327 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-27 11:32:50,328 INFO L225 Difference]: With dead ends: 35 [2022-04-27 11:32:50,328 INFO L226 Difference]: Without dead ends: 24 [2022-04-27 11:32:50,329 INFO L412 NwaCegarLoop]: 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-27 11:32:50,332 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 42 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:32:50,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 28 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 2 Unknown, 0 Unchecked, 4.1s Time] [2022-04-27 11:32:50,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-27 11:32:50,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-04-27 11:32:50,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:32:50,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 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-27 11:32:50,352 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 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-27 11:32:50,352 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 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-27 11:32:50,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:32:50,354 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-04-27 11:32:50,354 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-04-27 11:32:50,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:32:50,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:32:50,355 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 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 24 states. [2022-04-27 11:32:50,355 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 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 24 states. [2022-04-27 11:32:50,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:32:50,356 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-04-27 11:32:50,356 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-04-27 11:32:50,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:32:50,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:32:50,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:32:50,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:32:50,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 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-27 11:32:50,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-04-27 11:32:50,358 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 16 [2022-04-27 11:32:50,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:32:50,359 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-04-27 11:32:50,359 INFO L496 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-27 11:32:50,359 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-27 11:32:50,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 11:32:50,360 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:32:50,360 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:32:50,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 11:32:50,360 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:32:50,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:32:50,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1646864326, now seen corresponding path program 1 times [2022-04-27 11:32:50,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:32:50,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372566057] [2022-04-27 11:32:50,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:32:50,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:32:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:32:50,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:32:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:32:50,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {544#(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; {537#true} is VALID [2022-04-27 11:32:50,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {537#true} assume true; {537#true} is VALID [2022-04-27 11:32:50,446 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {537#true} {537#true} #71#return; {537#true} is VALID [2022-04-27 11:32:50,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {537#true} call ULTIMATE.init(); {544#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:32:50,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {544#(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; {537#true} is VALID [2022-04-27 11:32:50,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {537#true} assume true; {537#true} is VALID [2022-04-27 11:32:50,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {537#true} {537#true} #71#return; {537#true} is VALID [2022-04-27 11:32:50,447 INFO L272 TraceCheckUtils]: 4: Hoare triple {537#true} call #t~ret5 := main(); {537#true} is VALID [2022-04-27 11:32:50,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {537#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {542#(= main_~l~0 0)} is VALID [2022-04-27 11:32:50,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {542#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {542#(= main_~l~0 0)} is VALID [2022-04-27 11:32:50,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {542#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {542#(= main_~l~0 0)} is VALID [2022-04-27 11:32:50,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {542#(= main_~l~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; {542#(= main_~l~0 0)} is VALID [2022-04-27 11:32:50,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {542#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {543#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-27 11:32:50,450 INFO L290 TraceCheckUtils]: 10: Hoare triple {543#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {543#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-27 11:32:50,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {543#(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); {543#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-27 11:32:50,452 INFO L290 TraceCheckUtils]: 12: Hoare triple {543#(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; {538#false} is VALID [2022-04-27 11:32:50,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {538#false} ~l~0 := 1 + ~l~0; {538#false} is VALID [2022-04-27 11:32:50,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {538#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {538#false} is VALID [2022-04-27 11:32:50,452 INFO L272 TraceCheckUtils]: 15: Hoare triple {538#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {538#false} is VALID [2022-04-27 11:32:50,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {538#false} ~cond := #in~cond; {538#false} is VALID [2022-04-27 11:32:50,452 INFO L290 TraceCheckUtils]: 17: Hoare triple {538#false} assume 0 == ~cond; {538#false} is VALID [2022-04-27 11:32:50,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {538#false} assume !false; {538#false} is VALID [2022-04-27 11:32:50,453 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-27 11:32:50,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:32:50,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372566057] [2022-04-27 11:32:50,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372566057] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:32:50,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569715622] [2022-04-27 11:32:50,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:32:50,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:32:50,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:32:50,455 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-27 11:32:50,482 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-27 11:32:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:32:50,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-27 11:32:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:32:50,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:32:50,967 INFO L272 TraceCheckUtils]: 0: Hoare triple {537#true} call ULTIMATE.init(); {537#true} is VALID [2022-04-27 11:32:50,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {537#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; {537#true} is VALID [2022-04-27 11:32:50,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {537#true} assume true; {537#true} is VALID [2022-04-27 11:32:50,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {537#true} {537#true} #71#return; {537#true} is VALID [2022-04-27 11:32:50,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {537#true} call #t~ret5 := main(); {537#true} is VALID [2022-04-27 11:32:50,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {537#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {563#(and (= 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-27 11:32:50,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {563#(and (= main_~k~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); {563#(and (= 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-27 11:32:50,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {563#(and (= main_~k~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); {563#(and (= 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-27 11:32:50,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {563#(and (= main_~k~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 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {573#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-27 11:32:50,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {573#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {577#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-27 11:32:50,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {577#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {577#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-27 11:32:50,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {577#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~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); {577#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-27 11:32:50,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {577#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~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;~v4~0 := 1 + ~v4~0; {587#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 1))} is VALID [2022-04-27 11:32:50,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {587#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {591#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 1))} is VALID [2022-04-27 11:32:50,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {591#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 1))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {591#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 1))} is VALID [2022-04-27 11:32:50,978 INFO L272 TraceCheckUtils]: 15: Hoare triple {591#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {598#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:32:50,979 INFO L290 TraceCheckUtils]: 16: Hoare triple {598#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {602#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:32:50,979 INFO L290 TraceCheckUtils]: 17: Hoare triple {602#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {538#false} is VALID [2022-04-27 11:32:50,979 INFO L290 TraceCheckUtils]: 18: Hoare triple {538#false} assume !false; {538#false} is VALID [2022-04-27 11:32:50,980 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-27 11:32:50,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:32:51,239 INFO L290 TraceCheckUtils]: 18: Hoare triple {538#false} assume !false; {538#false} is VALID [2022-04-27 11:32:51,242 INFO L290 TraceCheckUtils]: 17: Hoare triple {602#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {538#false} is VALID [2022-04-27 11:32:51,243 INFO L290 TraceCheckUtils]: 16: Hoare triple {598#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {602#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:32:51,244 INFO L272 TraceCheckUtils]: 15: Hoare triple {618#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {598#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:32:51,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {618#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {618#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:32:51,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {625#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {618#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:32:51,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {618#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~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; {625#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:32:51,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {618#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~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); {618#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:32:51,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {618#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {618#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:32:51,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {625#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {618#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:32:51,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {618#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~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; {625#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:32:51,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {618#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {618#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:32:51,300 INFO L290 TraceCheckUtils]: 6: Hoare triple {618#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {618#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:32:51,300 INFO L290 TraceCheckUtils]: 5: Hoare triple {537#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {618#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:32:51,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {537#true} call #t~ret5 := main(); {537#true} is VALID [2022-04-27 11:32:51,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {537#true} {537#true} #71#return; {537#true} is VALID [2022-04-27 11:32:51,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {537#true} assume true; {537#true} is VALID [2022-04-27 11:32:51,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {537#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; {537#true} is VALID [2022-04-27 11:32:51,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {537#true} call ULTIMATE.init(); {537#true} is VALID [2022-04-27 11:32:51,301 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-27 11:32:51,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569715622] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 11:32:51,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:32:51,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-27 11:32:51,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102713927] [2022-04-27 11:32:51,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:32:51,302 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-27 11:32:51,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:32:51,303 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-27 11:32:53,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 16 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 11:32:53,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 11:32:53,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:32:53,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 11:32:53,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-27 11:32:53,458 INFO L87 Difference]: Start difference. First operand 23 states and 28 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-27 11:32:55,539 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-27 11:32:57,743 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-27 11:32:59,866 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-27 11:33:02,000 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-27 11:33:02,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:33:02,315 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-04-27 11:33:02,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 11:33:02,316 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-27 11:33:02,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:33:02,316 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-27 11:33:02,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-27 11:33:02,317 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-27 11:33:02,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-27 11:33:02,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2022-04-27 11:33:04,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 34 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 11:33:04,493 INFO L225 Difference]: With dead ends: 33 [2022-04-27 11:33:04,493 INFO L226 Difference]: Without dead ends: 28 [2022-04-27 11:33:04,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 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-27 11:33:04,495 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-04-27 11:33:04,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 48 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 4 Unknown, 0 Unchecked, 8.5s Time] [2022-04-27 11:33:04,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-27 11:33:04,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-04-27 11:33:04,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:33:04,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 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-27 11:33:04,507 INFO L74 IsIncluded]: Start isIncluded. First operand 28 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-27 11:33:04,507 INFO L87 Difference]: Start difference. First operand 28 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-27 11:33:04,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:33:04,509 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-27 11:33:04,509 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-27 11:33:04,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:33:04,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:33:04,510 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 28 states. [2022-04-27 11:33:04,510 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 28 states. [2022-04-27 11:33:04,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:33:04,525 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-27 11:33:04,525 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-27 11:33:04,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:33:04,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:33:04,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:33:04,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:33:04,526 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-27 11:33:04,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2022-04-27 11:33:04,528 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 19 [2022-04-27 11:33:04,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:33:04,528 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-04-27 11:33:04,528 INFO L496 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-27 11:33:04,529 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-04-27 11:33:04,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 11:33:04,529 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:33:04,529 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:33:04,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 11:33:04,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 11:33:04,736 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:33:04,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:33:04,737 INFO L85 PathProgramCache]: Analyzing trace with hash 923887238, now seen corresponding path program 1 times [2022-04-27 11:33:04,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:33:04,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331007275] [2022-04-27 11:33:04,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:33:04,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:33:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:33:05,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:33:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:33:05,177 INFO L290 TraceCheckUtils]: 0: Hoare triple {815#(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; {816#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 11:33:05,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {816#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {816#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 11:33:05,179 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {816#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {803#true} #71#return; {808#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:33:05,180 INFO L272 TraceCheckUtils]: 0: Hoare triple {803#true} call ULTIMATE.init(); {815#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:33:05,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {815#(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; {816#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 11:33:05,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {816#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {816#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 11:33:05,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {816#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {803#true} #71#return; {808#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:33:05,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {808#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {808#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:33:05,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {808#(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;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {809#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:33:05,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {809#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {810#(= main_~l~0 0)} is VALID [2022-04-27 11:33:05,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {810#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {810#(= main_~l~0 0)} is VALID [2022-04-27 11:33:05,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {810#(= main_~l~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; {810#(= main_~l~0 0)} is VALID [2022-04-27 11:33:05,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {810#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {811#(<= (+ (* (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-27 11:33:05,218 INFO L290 TraceCheckUtils]: 10: Hoare triple {811#(<= (+ (* (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); {812#(<= (+ (* (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-27 11:33:05,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {812#(<= (+ (* (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); {812#(<= (+ (* (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-27 11:33:05,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {812#(<= (+ (* (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); {812#(<= (+ (* (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-27 11:33:05,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {812#(<= (+ (* (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; {813#(<= (+ (* (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-27 11:33:05,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {813#(<= (+ (* (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; {814#(<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 2147483648) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} is VALID [2022-04-27 11:33:05,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {814#(<= (+ 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); {804#false} is VALID [2022-04-27 11:33:05,227 INFO L272 TraceCheckUtils]: 16: Hoare triple {804#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {804#false} is VALID [2022-04-27 11:33:05,228 INFO L290 TraceCheckUtils]: 17: Hoare triple {804#false} ~cond := #in~cond; {804#false} is VALID [2022-04-27 11:33:05,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {804#false} assume 0 == ~cond; {804#false} is VALID [2022-04-27 11:33:05,228 INFO L290 TraceCheckUtils]: 19: Hoare triple {804#false} assume !false; {804#false} is VALID [2022-04-27 11:33:05,228 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-27 11:33:05,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:33:05,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331007275] [2022-04-27 11:33:05,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331007275] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:33:05,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847252338] [2022-04-27 11:33:05,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:33:05,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:33:05,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:33:05,230 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-27 11:33:05,231 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-27 11:33:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:33:05,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-27 11:33:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:33:05,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:33:05,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {803#true} call ULTIMATE.init(); {803#true} is VALID [2022-04-27 11:33:05,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {803#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; {803#true} is VALID [2022-04-27 11:33:05,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {803#true} assume true; {803#true} is VALID [2022-04-27 11:33:05,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {803#true} {803#true} #71#return; {803#true} is VALID [2022-04-27 11:33:05,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {803#true} call #t~ret5 := main(); {803#true} is VALID [2022-04-27 11:33:05,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {803#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {835#(and (= 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-27 11:33:05,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {835#(and (= main_~k~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); {835#(and (= 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-27 11:33:05,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {835#(and (= main_~k~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); {835#(and (= 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-27 11:33:05,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {835#(and (= main_~k~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 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {845#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-27 11:33:05,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {845#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} ~l~0 := 1 + ~l~0; {849#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-27 11:33:05,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {849#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {849#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-27 11:33:05,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {849#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~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); {849#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-27 11:33:05,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {849#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~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); {849#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-27 11:33:05,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {849#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~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; {862#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 1) (= main_~v4~0 0))} is VALID [2022-04-27 11:33:05,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {862#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 1) (= main_~v4~0 0))} ~l~0 := 1 + ~l~0; {866#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 0))} is VALID [2022-04-27 11:33:05,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {866#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {866#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 0))} is VALID [2022-04-27 11:33:05,905 INFO L272 TraceCheckUtils]: 16: Hoare triple {866#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {873#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:33:05,906 INFO L290 TraceCheckUtils]: 17: Hoare triple {873#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {877#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:33:05,906 INFO L290 TraceCheckUtils]: 18: Hoare triple {877#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {804#false} is VALID [2022-04-27 11:33:05,906 INFO L290 TraceCheckUtils]: 19: Hoare triple {804#false} assume !false; {804#false} is VALID [2022-04-27 11:33:05,906 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-27 11:33:05,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:33:06,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {804#false} assume !false; {804#false} is VALID [2022-04-27 11:33:06,332 INFO L290 TraceCheckUtils]: 18: Hoare triple {877#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {804#false} is VALID [2022-04-27 11:33:06,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {873#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {877#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:33:06,333 INFO L272 TraceCheckUtils]: 16: Hoare triple {893#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {873#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:33:06,334 INFO L290 TraceCheckUtils]: 15: Hoare triple {893#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {893#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:33:06,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {900#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {893#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:33:08,456 WARN L290 TraceCheckUtils]: 13: Hoare triple {893#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~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; {900#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-27 11:33:08,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {893#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~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); {893#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:33:08,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {893#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~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); {893#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:33:08,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {893#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {893#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:33:08,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {900#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {893#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:33:10,586 WARN L290 TraceCheckUtils]: 8: Hoare triple {893#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~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; {900#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-27 11:33:10,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {893#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {893#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:33:10,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {893#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {893#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:33:10,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {803#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {893#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:33:10,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {803#true} call #t~ret5 := main(); {803#true} is VALID [2022-04-27 11:33:10,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {803#true} {803#true} #71#return; {803#true} is VALID [2022-04-27 11:33:10,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {803#true} assume true; {803#true} is VALID [2022-04-27 11:33:10,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {803#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; {803#true} is VALID [2022-04-27 11:33:10,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {803#true} call ULTIMATE.init(); {803#true} is VALID [2022-04-27 11:33:10,592 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-27 11:33:10,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847252338] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 11:33:10,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:33:10,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 9] total 20 [2022-04-27 11:33:10,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634070348] [2022-04-27 11:33:10,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:33:10,594 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-27 11:33:10,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:33:10,594 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-27 11:33:14,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 16 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 11:33:14,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 11:33:14,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:33:14,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 11:33:14,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-04-27 11:33:14,859 INFO L87 Difference]: Start difference. First operand 24 states and 30 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-27 11:33:16,951 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-27 11:33:19,174 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-27 11:33:19,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:33:19,485 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-27 11:33:19,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 11:33:19,486 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-27 11:33:19,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:33:19,486 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-27 11:33:19,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-27 11:33:19,487 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-27 11:33:19,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-27 11:33:19,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2022-04-27 11:33:23,779 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-27 11:33:23,780 INFO L225 Difference]: With dead ends: 34 [2022-04-27 11:33:23,780 INFO L226 Difference]: Without dead ends: 29 [2022-04-27 11:33:23,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-04-27 11:33:23,782 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:33:23,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-04-27 11:33:23,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-27 11:33:23,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-04-27 11:33:23,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:33:23,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 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-27 11:33:23,796 INFO L74 IsIncluded]: Start isIncluded. First operand 29 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-27 11:33:23,796 INFO L87 Difference]: Start difference. First operand 29 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-27 11:33:23,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:33:23,797 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-04-27 11:33:23,797 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-04-27 11:33:23,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:33:23,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:33:23,798 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 29 states. [2022-04-27 11:33:23,798 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 29 states. [2022-04-27 11:33:23,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:33:23,800 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-04-27 11:33:23,800 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-04-27 11:33:23,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:33:23,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:33:23,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:33:23,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:33:23,800 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-27 11:33:23,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-04-27 11:33:23,802 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 20 [2022-04-27 11:33:23,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:33:23,802 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-04-27 11:33:23,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 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-27 11:33:23,802 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-27 11:33:23,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 11:33:23,803 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:33:23,803 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:33:23,827 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-27 11:33:24,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:33:24,024 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:33:24,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:33:24,024 INFO L85 PathProgramCache]: Analyzing trace with hash -844641793, now seen corresponding path program 1 times [2022-04-27 11:33:24,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:33:24,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80355394] [2022-04-27 11:33:24,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:33:24,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:33:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:33:24,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:33:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:33:24,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {1092#(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; {1085#true} is VALID [2022-04-27 11:33:24,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {1085#true} assume true; {1085#true} is VALID [2022-04-27 11:33:24,129 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1085#true} {1085#true} #71#return; {1085#true} is VALID [2022-04-27 11:33:24,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {1085#true} call ULTIMATE.init(); {1092#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:33:24,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {1092#(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; {1085#true} is VALID [2022-04-27 11:33:24,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {1085#true} assume true; {1085#true} is VALID [2022-04-27 11:33:24,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1085#true} {1085#true} #71#return; {1085#true} is VALID [2022-04-27 11:33:24,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {1085#true} call #t~ret5 := main(); {1085#true} is VALID [2022-04-27 11:33:24,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {1085#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1090#(= main_~l~0 0)} is VALID [2022-04-27 11:33:24,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {1090#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1090#(= main_~l~0 0)} is VALID [2022-04-27 11:33:24,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {1090#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1090#(= main_~l~0 0)} is VALID [2022-04-27 11:33:24,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {1090#(= main_~l~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; {1090#(= main_~l~0 0)} is VALID [2022-04-27 11:33:24,133 INFO L290 TraceCheckUtils]: 9: Hoare triple {1090#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {1091#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-27 11:33:24,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {1091#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1091#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-27 11:33:24,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {1091#(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); {1091#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-27 11:33:24,134 INFO L290 TraceCheckUtils]: 12: Hoare triple {1091#(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); {1091#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-27 11:33:24,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {1091#(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); {1091#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-27 11:33:24,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {1091#(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;~j~0 := 1 + ~j~0; {1086#false} is VALID [2022-04-27 11:33:24,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {1086#false} ~l~0 := 1 + ~l~0; {1086#false} is VALID [2022-04-27 11:33:24,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {1086#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1086#false} is VALID [2022-04-27 11:33:24,136 INFO L272 TraceCheckUtils]: 17: Hoare triple {1086#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1086#false} is VALID [2022-04-27 11:33:24,136 INFO L290 TraceCheckUtils]: 18: Hoare triple {1086#false} ~cond := #in~cond; {1086#false} is VALID [2022-04-27 11:33:24,136 INFO L290 TraceCheckUtils]: 19: Hoare triple {1086#false} assume 0 == ~cond; {1086#false} is VALID [2022-04-27 11:33:24,136 INFO L290 TraceCheckUtils]: 20: Hoare triple {1086#false} assume !false; {1086#false} is VALID [2022-04-27 11:33:24,137 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-27 11:33:24,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:33:24,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80355394] [2022-04-27 11:33:24,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80355394] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:33:24,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368955190] [2022-04-27 11:33:24,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:33:24,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:33:24,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:33:24,141 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-27 11:33:24,163 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-27 11:33:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:33:24,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-27 11:33:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:33:24,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:33:24,715 INFO L272 TraceCheckUtils]: 0: Hoare triple {1085#true} call ULTIMATE.init(); {1085#true} is VALID [2022-04-27 11:33:24,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {1085#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; {1085#true} is VALID [2022-04-27 11:33:24,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {1085#true} assume true; {1085#true} is VALID [2022-04-27 11:33:24,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1085#true} {1085#true} #71#return; {1085#true} is VALID [2022-04-27 11:33:24,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {1085#true} call #t~ret5 := main(); {1085#true} is VALID [2022-04-27 11:33:24,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {1085#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1111#(and (= 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-27 11:33:24,717 INFO L290 TraceCheckUtils]: 6: Hoare triple {1111#(and (= main_~k~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); {1111#(and (= 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-27 11:33:24,718 INFO L290 TraceCheckUtils]: 7: Hoare triple {1111#(and (= main_~k~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); {1111#(and (= 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-27 11:33:24,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {1111#(and (= main_~k~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 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {1121#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-27 11:33:24,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {1121#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} ~l~0 := 1 + ~l~0; {1125#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-27 11:33:24,720 INFO L290 TraceCheckUtils]: 10: Hoare triple {1125#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1125#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-27 11:33:24,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {1125#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~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); {1125#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-27 11:33:24,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {1125#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~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); {1125#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-27 11:33:24,721 INFO L290 TraceCheckUtils]: 13: Hoare triple {1125#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~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); {1125#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-27 11:33:24,722 INFO L290 TraceCheckUtils]: 14: Hoare triple {1125#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~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;~j~0 := 1 + ~j~0; {1141#(and (= (+ (- 1) main_~v3~0) 0) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-27 11:33:24,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {1141#(and (= (+ (- 1) main_~v3~0) 0) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} ~l~0 := 1 + ~l~0; {1145#(and (= (+ (- 1) main_~v3~0) 0) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1))} is VALID [2022-04-27 11:33:24,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {1145#(and (= (+ (- 1) main_~v3~0) 0) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1145#(and (= (+ (- 1) main_~v3~0) 0) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1))} is VALID [2022-04-27 11:33:24,725 INFO L272 TraceCheckUtils]: 17: Hoare triple {1145#(and (= (+ (- 1) main_~v3~0) 0) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= 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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1152#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:33:24,726 INFO L290 TraceCheckUtils]: 18: Hoare triple {1152#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1156#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:33:24,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {1156#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1086#false} is VALID [2022-04-27 11:33:24,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {1086#false} assume !false; {1086#false} is VALID [2022-04-27 11:33:24,728 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-27 11:33:24,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:33:24,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {1086#false} assume !false; {1086#false} is VALID [2022-04-27 11:33:24,998 INFO L290 TraceCheckUtils]: 19: Hoare triple {1156#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1086#false} is VALID [2022-04-27 11:33:24,998 INFO L290 TraceCheckUtils]: 18: Hoare triple {1152#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1156#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:33:25,000 INFO L272 TraceCheckUtils]: 17: Hoare triple {1172#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1152#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:33:25,001 INFO L290 TraceCheckUtils]: 16: Hoare triple {1172#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1172#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:33:25,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {1179#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {1172#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:33:25,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {1172#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~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;~j~0 := 1 + ~j~0; {1179#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:33:25,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {1172#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~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); {1172#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:33:25,013 INFO L290 TraceCheckUtils]: 12: Hoare triple {1172#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~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); {1172#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:33:25,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {1172#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~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); {1172#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:33:25,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {1172#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1172#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:33:25,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {1179#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {1172#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:33:27,129 WARN L290 TraceCheckUtils]: 8: Hoare triple {1172#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~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; {1179#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-27 11:33:27,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {1172#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1172#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:33:27,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {1172#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1172#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:33:27,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {1085#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1172#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:33:27,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {1085#true} call #t~ret5 := main(); {1085#true} is VALID [2022-04-27 11:33:27,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1085#true} {1085#true} #71#return; {1085#true} is VALID [2022-04-27 11:33:27,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {1085#true} assume true; {1085#true} is VALID [2022-04-27 11:33:27,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {1085#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; {1085#true} is VALID [2022-04-27 11:33:27,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {1085#true} call ULTIMATE.init(); {1085#true} is VALID [2022-04-27 11:33:27,132 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-27 11:33:27,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368955190] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 11:33:27,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:33:27,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-27 11:33:27,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475145962] [2022-04-27 11:33:27,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:33:27,133 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-27 11:33:27,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:33:27,133 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-27 11:33:29,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 11:33:29,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 11:33:29,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:33:29,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 11:33:29,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-27 11:33:29,271 INFO L87 Difference]: Start difference. First operand 25 states and 32 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-27 11:33:31,346 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-27 11:33:33,610 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-27 11:33:35,738 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:33:36,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:33:36,057 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-04-27 11:33:36,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 11:33:36,058 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-27 11:33:36,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:33:36,058 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-27 11:33:36,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-04-27 11:33:36,059 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-27 11:33:36,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-04-27 11:33:36,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2022-04-27 11:33:38,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 36 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 11:33:38,263 INFO L225 Difference]: With dead ends: 41 [2022-04-27 11:33:38,263 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 11:33:38,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-27 11:33:38,265 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-04-27 11:33:38,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 3 Unknown, 0 Unchecked, 6.6s Time] [2022-04-27 11:33:38,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 11:33:38,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-27 11:33:38,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:33:38,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:33:38,281 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:33:38,281 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:33:38,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:33:38,282 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2022-04-27 11:33:38,282 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2022-04-27 11:33:38,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:33:38,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:33:38,283 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 3 states have call successors, (3), 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 36 states. [2022-04-27 11:33:38,283 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 3 states have call successors, (3), 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 36 states. [2022-04-27 11:33:38,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:33:38,285 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2022-04-27 11:33:38,285 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2022-04-27 11:33:38,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:33:38,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:33:38,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:33:38,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:33:38,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:33:38,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2022-04-27 11:33:38,287 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 21 [2022-04-27 11:33:38,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:33:38,287 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2022-04-27 11:33:38,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 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-27 11:33:38,288 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2022-04-27 11:33:38,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 11:33:38,288 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:33:38,288 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:33:38,313 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-27 11:33:38,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:33:38,512 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:33:38,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:33:38,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1948928856, now seen corresponding path program 1 times [2022-04-27 11:33:38,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:33:38,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089808700] [2022-04-27 11:33:38,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:33:38,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:33:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:33:38,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:33:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:33:38,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {1415#(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; {1416#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 11:33:38,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {1416#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {1416#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 11:33:38,917 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1416#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1402#true} #71#return; {1407#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:33:38,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {1402#true} call ULTIMATE.init(); {1415#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:33:38,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {1415#(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; {1416#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 11:33:38,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {1416#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {1416#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 11:33:38,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1416#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1402#true} #71#return; {1407#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:33:38,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {1407#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {1407#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:33:38,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {1407#(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;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1408#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:33:38,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {1408#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1409#(= main_~l~0 0)} is VALID [2022-04-27 11:33:38,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {1409#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1409#(= main_~l~0 0)} is VALID [2022-04-27 11:33:38,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {1409#(= main_~l~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; {1409#(= main_~l~0 0)} is VALID [2022-04-27 11:33:38,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {1409#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {1410#(<= (+ (* (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-27 11:33:38,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {1410#(<= (+ (* (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); {1411#(<= (+ (* (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-27 11:33:38,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {1411#(<= (+ (* (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); {1411#(<= (+ (* (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-27 11:33:38,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {1411#(<= (+ (* (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); {1411#(<= (+ (* (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-27 11:33:41,049 WARN L290 TraceCheckUtils]: 13: Hoare triple {1411#(<= (+ (* (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; {1412#(<= (+ (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is UNKNOWN [2022-04-27 11:33:41,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {1412#(<= (+ (* (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; {1413#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-27 11:33:41,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {1413#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1413#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-27 11:33:41,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {1413#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) 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); {1413#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-27 11:33:41,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {1413#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) 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); {1413#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-27 11:33:41,056 INFO L290 TraceCheckUtils]: 18: Hoare triple {1413#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) 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); {1413#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-27 11:33:41,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {1413#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~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;~j~0 := 1 + ~j~0; {1413#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-27 11:33:41,059 INFO L290 TraceCheckUtils]: 20: Hoare triple {1413#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} ~l~0 := 1 + ~l~0; {1414#(<= (+ 2147483647 main_~l~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} is VALID [2022-04-27 11:33:41,061 INFO L290 TraceCheckUtils]: 21: Hoare triple {1414#(<= (+ 2147483647 main_~l~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1403#false} is VALID [2022-04-27 11:33:41,061 INFO L272 TraceCheckUtils]: 22: Hoare triple {1403#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1403#false} is VALID [2022-04-27 11:33:41,061 INFO L290 TraceCheckUtils]: 23: Hoare triple {1403#false} ~cond := #in~cond; {1403#false} is VALID [2022-04-27 11:33:41,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {1403#false} assume 0 == ~cond; {1403#false} is VALID [2022-04-27 11:33:41,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {1403#false} assume !false; {1403#false} is VALID [2022-04-27 11:33:41,062 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:33:41,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:33:41,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089808700] [2022-04-27 11:33:41,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089808700] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:33:41,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434505589] [2022-04-27 11:33:41,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:33:41,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:33:41,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:33:41,065 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-27 11:33:41,068 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-27 11:33:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:33:41,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-27 11:33:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:33:41,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:33:41,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {1402#true} call ULTIMATE.init(); {1402#true} is VALID [2022-04-27 11:33:41,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {1402#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; {1402#true} is VALID [2022-04-27 11:33:41,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {1402#true} assume true; {1402#true} is VALID [2022-04-27 11:33:41,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1402#true} {1402#true} #71#return; {1402#true} is VALID [2022-04-27 11:33:41,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {1402#true} call #t~ret5 := main(); {1402#true} is VALID [2022-04-27 11:33:41,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {1402#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1435#(and (= 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-27 11:33:41,936 INFO L290 TraceCheckUtils]: 6: Hoare triple {1435#(and (= main_~k~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); {1435#(and (= 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-27 11:33:41,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {1435#(and (= main_~k~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); {1435#(and (= 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-27 11:33:41,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {1435#(and (= main_~k~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 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {1445#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-27 11:33:41,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {1445#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} ~l~0 := 1 + ~l~0; {1449#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-27 11:33:41,939 INFO L290 TraceCheckUtils]: 10: Hoare triple {1449#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1449#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-27 11:33:41,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {1449#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~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); {1449#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-27 11:33:41,940 INFO L290 TraceCheckUtils]: 12: Hoare triple {1449#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~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); {1449#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-27 11:33:41,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {1449#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~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; {1462#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 11:33:41,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {1462#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} ~l~0 := 1 + ~l~0; {1466#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 11:33:41,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {1466#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1466#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 11:33:41,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {1466#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~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); {1466#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 11:33:41,943 INFO L290 TraceCheckUtils]: 17: Hoare triple {1466#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~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); {1466#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 11:33:41,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {1466#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~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); {1466#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 11:33:41,944 INFO L290 TraceCheckUtils]: 19: Hoare triple {1466#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~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;~j~0 := 1 + ~j~0; {1482#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 11:33:41,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {1482#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} ~l~0 := 1 + ~l~0; {1486#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~k~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= (+ main_~l~0 (- 3)) 0))} is VALID [2022-04-27 11:33:41,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {1486#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~k~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= (+ main_~l~0 (- 3)) 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1486#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~k~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= (+ main_~l~0 (- 3)) 0))} is VALID [2022-04-27 11:33:41,946 INFO L272 TraceCheckUtils]: 22: Hoare triple {1486#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~k~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= (+ main_~l~0 (- 3)) 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1493#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:33:41,947 INFO L290 TraceCheckUtils]: 23: Hoare triple {1493#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1497#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:33:41,947 INFO L290 TraceCheckUtils]: 24: Hoare triple {1497#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1403#false} is VALID [2022-04-27 11:33:41,947 INFO L290 TraceCheckUtils]: 25: Hoare triple {1403#false} assume !false; {1403#false} is VALID [2022-04-27 11:33:41,947 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:33:41,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:33:42,546 INFO L290 TraceCheckUtils]: 25: Hoare triple {1403#false} assume !false; {1403#false} is VALID [2022-04-27 11:33:42,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {1497#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1403#false} is VALID [2022-04-27 11:33:42,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {1493#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1497#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:33:42,550 INFO L272 TraceCheckUtils]: 22: Hoare triple {1513#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1493#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:33:42,551 INFO L290 TraceCheckUtils]: 21: Hoare triple {1513#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1513#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:33:42,552 INFO L290 TraceCheckUtils]: 20: Hoare triple {1520#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {1513#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:33:42,562 INFO L290 TraceCheckUtils]: 19: Hoare triple {1513#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~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;~j~0 := 1 + ~j~0; {1520#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:33:42,563 INFO L290 TraceCheckUtils]: 18: Hoare triple {1513#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~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); {1513#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:33:42,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {1513#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~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); {1513#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:33:42,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {1513#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~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); {1513#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:33:42,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {1513#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1513#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:33:42,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {1520#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {1513#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:33:44,683 WARN L290 TraceCheckUtils]: 13: Hoare triple {1513#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~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; {1520#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-27 11:33:44,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {1513#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~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); {1513#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:33:44,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {1513#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~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); {1513#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:33:44,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {1513#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1513#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:33:44,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {1520#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {1513#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:33:46,816 WARN L290 TraceCheckUtils]: 8: Hoare triple {1513#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~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; {1520#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-27 11:33:46,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {1513#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1513#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:33:46,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {1513#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1513#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:33:46,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {1402#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1513#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-27 11:33:46,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {1402#true} call #t~ret5 := main(); {1402#true} is VALID [2022-04-27 11:33:46,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1402#true} {1402#true} #71#return; {1402#true} is VALID [2022-04-27 11:33:46,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {1402#true} assume true; {1402#true} is VALID [2022-04-27 11:33:46,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {1402#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; {1402#true} is VALID [2022-04-27 11:33:46,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {1402#true} call ULTIMATE.init(); {1402#true} is VALID [2022-04-27 11:33:46,818 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-27 11:33:46,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434505589] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 11:33:46,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:33:46,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 11] total 23 [2022-04-27 11:33:46,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925987988] [2022-04-27 11:33:46,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:33:46,819 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 26 [2022-04-27 11:33:46,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:33:46,819 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-27 11:33:51,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 18 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 11:33:51,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 11:33:51,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:33:51,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 11:33:51,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2022-04-27 11:33:51,102 INFO L87 Difference]: Start difference. First operand 36 states and 50 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-27 11:33:53,180 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-27 11:33:55,508 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-27 11:33:55,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:33:55,801 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2022-04-27 11:33:55,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 11:33:55,801 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 26 [2022-04-27 11:33:55,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:33:55,801 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-27 11:33:55,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-04-27 11:33:55,802 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-27 11:33:55,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-04-27 11:33:55,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 22 transitions. [2022-04-27 11:34:00,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 20 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 11:34:00,110 INFO L225 Difference]: With dead ends: 36 [2022-04-27 11:34:00,110 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 11:34:00,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2022-04-27 11:34:00,111 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:34:00,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 33 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-04-27 11:34:00,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 11:34:00,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 11:34:00,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:34:00,112 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-27 11:34:00,112 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-27 11:34:00,112 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-27 11:34:00,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:34:00,112 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:34:00,113 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:34:00,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:34:00,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:34:00,113 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-27 11:34:00,113 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-27 11:34:00,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:34:00,113 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:34:00,113 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:34:00,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:34:00,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:34:00,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:34:00,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:34:00,113 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-27 11:34:00,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 11:34:00,114 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2022-04-27 11:34:00,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:34:00,114 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 11:34:00,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 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-27 11:34:00,114 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:34:00,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:34:00,116 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 11:34:00,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 11:34:00,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:34:00,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 11:34:00,467 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-27 11:34:00,467 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-27 11:34:00,467 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-27 11:34:00,467 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 5 7) no Hoare annotation was computed. [2022-04-27 11:34:00,468 INFO L899 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2022-04-27 11:34:00,468 INFO L899 garLoopResultBuilder]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2022-04-27 11:34:00,468 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2022-04-27 11:34:00,468 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 32) no Hoare annotation was computed. [2022-04-27 11:34:00,468 INFO L899 garLoopResultBuilder]: For program point L27(lines 27 32) no Hoare annotation was computed. [2022-04-27 11:34:00,468 INFO L899 garLoopResultBuilder]: For program point L29-2(lines 23 32) no Hoare annotation was computed. [2022-04-27 11:34:00,468 INFO L899 garLoopResultBuilder]: For program point L25(lines 25 32) no Hoare annotation was computed. [2022-04-27 11:34:00,468 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 16 37) no Hoare annotation was computed. [2022-04-27 11:34:00,468 INFO L899 garLoopResultBuilder]: For program point L23(lines 23 32) no Hoare annotation was computed. [2022-04-27 11:34:00,468 INFO L895 garLoopResultBuilder]: At program point L21-2(lines 21 34) the Hoare annotation is: (or (= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296)) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))) [2022-04-27 11:34:00,468 INFO L895 garLoopResultBuilder]: At program point L21-3(lines 21 34) the Hoare annotation is: (or (= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296)) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))) [2022-04-27 11:34:00,468 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 16 37) no Hoare annotation was computed. [2022-04-27 11:34:00,468 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 16 37) the Hoare annotation is: true [2022-04-27 11:34:00,468 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2022-04-27 11:34:00,469 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-04-27 11:34:00,469 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:34:00,469 INFO L895 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-27 11:34:00,469 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:34:00,469 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:34:00,469 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2022-04-27 11:34:00,469 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 11:34:00,469 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:34:00,469 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2022-04-27 11:34:00,469 INFO L899 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2022-04-27 11:34:00,469 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 8 13) no Hoare annotation was computed. [2022-04-27 11:34:00,469 INFO L899 garLoopResultBuilder]: For program point L9(lines 9 11) no Hoare annotation was computed. [2022-04-27 11:34:00,469 INFO L899 garLoopResultBuilder]: For program point L9-2(lines 8 13) no Hoare annotation was computed. [2022-04-27 11:34:00,469 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2022-04-27 11:34:00,472 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:34:00,474 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 11:34:00,477 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 11:34:00,477 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:34:00,478 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 11:34:00,478 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-27 11:34:00,478 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 11:34:00,479 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 11:34:00,479 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:34:00,479 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:34:00,479 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 11:34:00,479 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 11:34:00,479 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-27 11:34:00,479 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-27 11:34:00,479 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 11:34:00,479 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 11:34:00,479 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 11:34:00,479 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:34:00,479 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-27 11:34:00,479 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 11:34:00,481 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-27 11:34:00,481 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 11:34:00,481 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 11:34:00,481 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-27 11:34:00,481 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 11:34:00,481 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 11:34:00,481 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-27 11:34:00,481 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-27 11:34:00,482 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:34:00,482 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 11:34:00,482 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2022-04-27 11:34:00,482 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 11:34:00,482 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 11:34:00,482 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-27 11:34:00,482 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-27 11:34:00,482 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 11:34:00,482 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 11:34:00,482 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-27 11:34:00,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:34:00 BoogieIcfgContainer [2022-04-27 11:34:00,490 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 11:34:00,491 INFO L158 Benchmark]: Toolchain (without parser) took 122345.82ms. Allocated memory was 182.5MB in the beginning and 264.2MB in the end (delta: 81.8MB). Free memory was 123.6MB in the beginning and 198.5MB in the end (delta: -74.9MB). Peak memory consumption was 8.1MB. Max. memory is 8.0GB. [2022-04-27 11:34:00,491 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 182.5MB. Free memory is still 139.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 11:34:00,491 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.60ms. Allocated memory was 182.5MB in the beginning and 264.2MB in the end (delta: 81.8MB). Free memory was 123.4MB in the beginning and 234.2MB in the end (delta: -110.8MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. [2022-04-27 11:34:00,492 INFO L158 Benchmark]: Boogie Preprocessor took 26.21ms. Allocated memory is still 264.2MB. Free memory was 234.2MB in the beginning and 233.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 11:34:00,492 INFO L158 Benchmark]: RCFGBuilder took 4604.00ms. Allocated memory is still 264.2MB. Free memory was 232.6MB in the beginning and 220.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 11:34:00,492 INFO L158 Benchmark]: TraceAbstraction took 117492.25ms. Allocated memory is still 264.2MB. Free memory was 219.5MB in the beginning and 198.5MB in the end (delta: 21.0MB). Peak memory consumption was 22.1MB. Max. memory is 8.0GB. [2022-04-27 11:34:00,493 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.37ms. Allocated memory is still 182.5MB. Free memory is still 139.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 218.60ms. Allocated memory was 182.5MB in the beginning and 264.2MB in the end (delta: 81.8MB). Free memory was 123.4MB in the beginning and 234.2MB in the end (delta: -110.8MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.21ms. Allocated memory is still 264.2MB. Free memory was 234.2MB in the beginning and 233.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 4604.00ms. Allocated memory is still 264.2MB. Free memory was 232.6MB in the beginning and 220.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 117492.25ms. Allocated memory is still 264.2MB. Free memory was 219.5MB in the beginning and 198.5MB in the end (delta: 21.0MB). Peak memory consumption was 22.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, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 117.4s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 76.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 19 mSolverCounterUnknown, 84 SdHoareTripleChecker+Valid, 40.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 83 mSDsluCounter, 305 SdHoareTripleChecker+Invalid, 38.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 208 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 343 IncrementalHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 97 mSDtfsCounter, 343 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 272 GetRequests, 160 SyntacticMatches, 15 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=6, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 11 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 14 PreInvPairs, 20 NumberOfFragments, 62 HoareAnnotationTreeSize, 14 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 277 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 22.1s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 314 ConstructedInterpolants, 0 QuantifiedInterpolants, 3391 SizeOfPredicates, 5 NumberOfNonLiveVariables, 441 ConjunctsInSsa, 115 ConjunctsInUnsatCore, 17 InterpolantComputations, 7 PerfectInterpolantSequences, 37/91 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: (l % 4294967296 == (i + k + j + v3 + v4) % 4294967296 || !(20000001 <= SIZE)) || !(SIZE <= 20000001) RESULT: Ultimate proved your program to be correct! [2022-04-27 11:34:00,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...