/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/loopv3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:15:25,032 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:15:25,034 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:15:25,095 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:15:25,096 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:15:25,096 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:15:25,099 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:15:25,101 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:15:25,102 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:15:25,106 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:15:25,107 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:15:25,107 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:15:25,108 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:15:25,108 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:15:25,109 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:15:25,109 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:15:25,110 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:15:25,110 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:15:25,111 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:15:25,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:15:25,112 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:15:25,114 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:15:25,115 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:15:25,117 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:15:25,118 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:15:25,123 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:15:25,123 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:15:25,123 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:15:25,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:15:25,124 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:15:25,125 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:15:25,125 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:15:25,126 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:15:25,126 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:15:25,127 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:15:25,127 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:15:25,127 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:15:25,128 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:15:25,128 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:15:25,128 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:15:25,128 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:15:25,130 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:15:25,130 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:15:25,151 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:15:25,151 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:15:25,152 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:15:25,152 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:15:25,152 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:15:25,152 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:15:25,153 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:15:25,153 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:15:25,153 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:15:25,153 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:15:25,153 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:15:25,153 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:15:25,154 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:15:25,154 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:15:25,154 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:15:25,154 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:15:25,154 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:15:25,154 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:15:25,154 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:15:25,154 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:15:25,154 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:15:25,155 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:15:25,155 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:15:25,155 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:15:25,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:15:25,155 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:15:25,156 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:15:25,156 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:15:25,156 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:15:25,156 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:15:25,156 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:15:25,156 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:15:25,156 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:15:25,156 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:15:25,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:15:25,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:15:25,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:15:25,359 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:15:25,359 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:15:25,360 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/loopv3.c [2022-04-27 11:15:25,406 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fa4141ab/11f5d6fc89714885905f55801aa18d61/FLAG11d7f310a [2022-04-27 11:15:25,774 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:15:25,774 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/loopv3.c [2022-04-27 11:15:25,778 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fa4141ab/11f5d6fc89714885905f55801aa18d61/FLAG11d7f310a [2022-04-27 11:15:25,791 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fa4141ab/11f5d6fc89714885905f55801aa18d61 [2022-04-27 11:15:25,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:15:25,793 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:15:25,794 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:15:25,794 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:15:25,796 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:15:25,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:15:25" (1/1) ... [2022-04-27 11:15:25,798 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58faf229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:15:25, skipping insertion in model container [2022-04-27 11:15:25,798 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:15:25" (1/1) ... [2022-04-27 11:15:25,803 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:15:25,811 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:15:25,934 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/loopv3.c[456,469] [2022-04-27 11:15:25,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:15:25,966 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:15:25,975 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/loopv3.c[456,469] [2022-04-27 11:15:25,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:15:25,991 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:15:25,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:15:25 WrapperNode [2022-04-27 11:15:25,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:15:25,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:15:25,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:15:25,992 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:15:25,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:15:25" (1/1) ... [2022-04-27 11:15:26,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:15:25" (1/1) ... [2022-04-27 11:15:26,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:15:25" (1/1) ... [2022-04-27 11:15:26,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:15:25" (1/1) ... [2022-04-27 11:15:26,011 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:15:25" (1/1) ... [2022-04-27 11:15:26,016 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:15:25" (1/1) ... [2022-04-27 11:15:26,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:15:25" (1/1) ... [2022-04-27 11:15:26,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:15:26,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:15:26,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:15:26,022 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:15:26,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:15:25" (1/1) ... [2022-04-27 11:15:26,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:15:26,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:15:26,044 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:15:26,056 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:15:26,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:15:26,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:15:26,073 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:15:26,073 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 11:15:26,074 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:15:26,074 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:15:26,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 11:15:26,074 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:15:26,074 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:15:26,074 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:15:26,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:15:26,074 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 11:15:26,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:15:26,075 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:15:26,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:15:26,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:15:26,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:15:26,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:15:26,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:15:26,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:15:26,119 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:15:26,120 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:15:26,187 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:15:26,191 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:15:26,191 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 11:15:26,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:15:26 BoogieIcfgContainer [2022-04-27 11:15:26,192 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:15:26,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:15:26,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:15:26,196 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:15:26,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:15:25" (1/3) ... [2022-04-27 11:15:26,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6940654b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:15:26, skipping insertion in model container [2022-04-27 11:15:26,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:15:25" (2/3) ... [2022-04-27 11:15:26,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6940654b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:15:26, skipping insertion in model container [2022-04-27 11:15:26,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:15:26" (3/3) ... [2022-04-27 11:15:26,198 INFO L111 eAbstractionObserver]: Analyzing ICFG loopv3.c [2022-04-27 11:15:26,206 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:15:26,207 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:15:26,240 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:15:26,245 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@12ec6407, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@247f1f8d [2022-04-27 11:15:26,245 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:15:26,278 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 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:15:26,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 11:15:26,282 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:26,282 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:15:26,283 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:26,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:26,287 INFO L85 PathProgramCache]: Analyzing trace with hash -380103047, now seen corresponding path program 1 times [2022-04-27 11:15:26,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:26,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777667979] [2022-04-27 11:15:26,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:26,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:26,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:15:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:26,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(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(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {29#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:26,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(<= 50000001 ~SIZE~0)} assume true; {29#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:26,503 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#(<= 50000001 ~SIZE~0)} {24#true} #52#return; {29#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:26,505 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {31#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:15:26,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(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(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {29#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:26,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#(<= 50000001 ~SIZE~0)} assume true; {29#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:26,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#(<= 50000001 ~SIZE~0)} {24#true} #52#return; {29#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:26,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#(<= 50000001 ~SIZE~0)} call #t~ret5 := main(); {29#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:26,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#(<= 50000001 ~SIZE~0)} havoc ~i~0;havoc ~j~0;~i~0 := 0;~j~0 := 0; {30#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:26,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {25#false} is VALID [2022-04-27 11:15:26,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#false} ~j~0 := (if ~i~0 < 0 && 0 != ~i~0 % 4 then 1 + ~i~0 / 4 else ~i~0 / 4); {25#false} is VALID [2022-04-27 11:15:26,514 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#false} call __VERIFIER_assert((if 4 * ~j~0 == ~i~0 then 1 else 0)); {25#false} is VALID [2022-04-27 11:15:26,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-27 11:15:26,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-27 11:15:26,514 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-27 11:15:26,515 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:15:26,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:15:26,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777667979] [2022-04-27 11:15:26,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777667979] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:15:26,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:15:26,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 11:15:26,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049291959] [2022-04-27 11:15:26,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:15:26,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 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:15:26,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:26,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states 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:15:26,541 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:15:26,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:15:26,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:26,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:15:26,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:15:26,560 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 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 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states 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:15:26,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:26,744 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-27 11:15:26,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 11:15:26,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 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:15:26,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:15:26,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states 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:15:26,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-27 11:15:26,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states 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:15:26,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-27 11:15:26,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2022-04-27 11:15:26,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:26,806 INFO L225 Difference]: With dead ends: 36 [2022-04-27 11:15:26,807 INFO L226 Difference]: Without dead ends: 16 [2022-04-27 11:15:26,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-27 11:15:26,812 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 29 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:15:26,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 22 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:15:26,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-27 11:15:26,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-04-27 11:15:26,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:15:26,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:26,837 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:26,837 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:26,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:26,839 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-27 11:15:26,839 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-27 11:15:26,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:26,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:26,840 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 11:15:26,840 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 11:15:26,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:26,841 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-27 11:15:26,841 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-27 11:15:26,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:26,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:26,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:15:26,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:15:26,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:26,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-27 11:15:26,844 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-27 11:15:26,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:15:26,844 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-27 11:15:26,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states 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:15:26,844 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 11:15:26,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 11:15:26,845 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:26,845 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:15:26,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:15:26,845 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:26,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:26,846 INFO L85 PathProgramCache]: Analyzing trace with hash 437044508, now seen corresponding path program 1 times [2022-04-27 11:15:26,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:26,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030828886] [2022-04-27 11:15:26,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:26,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:26,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:15:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:26,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {147#(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(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {144#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:26,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {144#(<= 50000001 ~SIZE~0)} assume true; {144#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:26,903 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {144#(<= 50000001 ~SIZE~0)} {139#true} #52#return; {144#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:26,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {139#true} call ULTIMATE.init(); {147#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:15:26,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {147#(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(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {144#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:26,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {144#(<= 50000001 ~SIZE~0)} assume true; {144#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:26,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144#(<= 50000001 ~SIZE~0)} {139#true} #52#return; {144#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:26,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {144#(<= 50000001 ~SIZE~0)} call #t~ret5 := main(); {144#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:26,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {144#(<= 50000001 ~SIZE~0)} havoc ~i~0;havoc ~j~0;~i~0 := 0;~j~0 := 0; {145#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:26,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {145#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {145#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:26,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {145#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {146#(<= (+ main_~i~0 49999993) ~SIZE~0)} is VALID [2022-04-27 11:15:26,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {146#(<= (+ main_~i~0 49999993) ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {140#false} is VALID [2022-04-27 11:15:26,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {140#false} ~j~0 := (if ~i~0 < 0 && 0 != ~i~0 % 4 then 1 + ~i~0 / 4 else ~i~0 / 4); {140#false} is VALID [2022-04-27 11:15:26,908 INFO L272 TraceCheckUtils]: 10: Hoare triple {140#false} call __VERIFIER_assert((if 4 * ~j~0 == ~i~0 then 1 else 0)); {140#false} is VALID [2022-04-27 11:15:26,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {140#false} ~cond := #in~cond; {140#false} is VALID [2022-04-27 11:15:26,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {140#false} assume 0 == ~cond; {140#false} is VALID [2022-04-27 11:15:26,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {140#false} assume !false; {140#false} is VALID [2022-04-27 11:15:26,908 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:15:26,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:15:26,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030828886] [2022-04-27 11:15:26,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030828886] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:15:26,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116889664] [2022-04-27 11:15:26,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:26,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:26,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:15:26,910 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:15:26,911 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:15:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:26,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 11:15:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:26,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:15:27,054 INFO L272 TraceCheckUtils]: 0: Hoare triple {139#true} call ULTIMATE.init(); {139#true} is VALID [2022-04-27 11:15:27,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {139#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(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {144#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:27,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {144#(<= 50000001 ~SIZE~0)} assume true; {144#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:27,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144#(<= 50000001 ~SIZE~0)} {139#true} #52#return; {144#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:27,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {144#(<= 50000001 ~SIZE~0)} call #t~ret5 := main(); {144#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:27,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {144#(<= 50000001 ~SIZE~0)} havoc ~i~0;havoc ~j~0;~i~0 := 0;~j~0 := 0; {166#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:27,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {166#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {166#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:27,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {166#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {173#(and (<= main_~i~0 8) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:27,058 INFO L290 TraceCheckUtils]: 8: Hoare triple {173#(and (<= main_~i~0 8) (<= 50000001 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {140#false} is VALID [2022-04-27 11:15:27,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {140#false} ~j~0 := (if ~i~0 < 0 && 0 != ~i~0 % 4 then 1 + ~i~0 / 4 else ~i~0 / 4); {140#false} is VALID [2022-04-27 11:15:27,058 INFO L272 TraceCheckUtils]: 10: Hoare triple {140#false} call __VERIFIER_assert((if 4 * ~j~0 == ~i~0 then 1 else 0)); {140#false} is VALID [2022-04-27 11:15:27,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {140#false} ~cond := #in~cond; {140#false} is VALID [2022-04-27 11:15:27,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {140#false} assume 0 == ~cond; {140#false} is VALID [2022-04-27 11:15:27,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {140#false} assume !false; {140#false} is VALID [2022-04-27 11:15:27,059 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:15:27,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:15:27,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {140#false} assume !false; {140#false} is VALID [2022-04-27 11:15:27,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {140#false} assume 0 == ~cond; {140#false} is VALID [2022-04-27 11:15:27,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {140#false} ~cond := #in~cond; {140#false} is VALID [2022-04-27 11:15:27,140 INFO L272 TraceCheckUtils]: 10: Hoare triple {140#false} call __VERIFIER_assert((if 4 * ~j~0 == ~i~0 then 1 else 0)); {140#false} is VALID [2022-04-27 11:15:27,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {140#false} ~j~0 := (if ~i~0 < 0 && 0 != ~i~0 % 4 then 1 + ~i~0 / 4 else ~i~0 / 4); {140#false} is VALID [2022-04-27 11:15:27,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {207#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {140#false} is VALID [2022-04-27 11:15:27,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {211#(< (+ main_~i~0 8) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {207#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-27 11:15:27,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {211#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {211#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-27 11:15:27,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {218#(< 8 ~SIZE~0)} havoc ~i~0;havoc ~j~0;~i~0 := 0;~j~0 := 0; {211#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-27 11:15:27,142 INFO L272 TraceCheckUtils]: 4: Hoare triple {218#(< 8 ~SIZE~0)} call #t~ret5 := main(); {218#(< 8 ~SIZE~0)} is VALID [2022-04-27 11:15:27,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {218#(< 8 ~SIZE~0)} {139#true} #52#return; {218#(< 8 ~SIZE~0)} is VALID [2022-04-27 11:15:27,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {218#(< 8 ~SIZE~0)} assume true; {218#(< 8 ~SIZE~0)} is VALID [2022-04-27 11:15:27,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {139#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(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {218#(< 8 ~SIZE~0)} is VALID [2022-04-27 11:15:27,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {139#true} call ULTIMATE.init(); {139#true} is VALID [2022-04-27 11:15:27,144 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:15:27,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116889664] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:15:27,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:15:27,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-04-27 11:15:27,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38286762] [2022-04-27 11:15:27,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:15:27,146 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2022-04-27 11:15:27,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:27,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:15:27,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:27,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 11:15:27,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:27,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 11:15:27,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-27 11:15:27,165 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:15:27,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:27,355 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-27 11:15:27,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 11:15:27,356 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2022-04-27 11:15:27,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:15:27,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:15:27,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 33 transitions. [2022-04-27 11:15:27,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:15:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 33 transitions. [2022-04-27 11:15:27,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 33 transitions. [2022-04-27 11:15:27,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:27,386 INFO L225 Difference]: With dead ends: 27 [2022-04-27 11:15:27,386 INFO L226 Difference]: Without dead ends: 21 [2022-04-27 11:15:27,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2022-04-27 11:15:27,388 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 33 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:15:27,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 19 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:15:27,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-27 11:15:27,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-27 11:15:27,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:15:27,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:27,396 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:27,396 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:27,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:27,397 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-04-27 11:15:27,397 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-04-27 11:15:27,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:27,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:27,398 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-27 11:15:27,398 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-27 11:15:27,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:27,399 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-04-27 11:15:27,399 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-04-27 11:15:27,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:27,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:27,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:15:27,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:15:27,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:27,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-04-27 11:15:27,400 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2022-04-27 11:15:27,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:15:27,401 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-04-27 11:15:27,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:15:27,401 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-04-27 11:15:27,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 11:15:27,401 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:27,401 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:15:27,420 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:15:27,615 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:15:27,616 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:27,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:27,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1216930949, now seen corresponding path program 2 times [2022-04-27 11:15:27,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:27,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106608128] [2022-04-27 11:15:27,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:27,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:27,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:15:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:27,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {371#(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(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {365#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:27,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {365#(<= 50000001 ~SIZE~0)} assume true; {365#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:27,742 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {365#(<= 50000001 ~SIZE~0)} {360#true} #52#return; {365#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:27,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {360#true} call ULTIMATE.init(); {371#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:15:27,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {371#(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(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {365#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:27,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {365#(<= 50000001 ~SIZE~0)} assume true; {365#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:27,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {365#(<= 50000001 ~SIZE~0)} {360#true} #52#return; {365#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:27,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {365#(<= 50000001 ~SIZE~0)} call #t~ret5 := main(); {365#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:27,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {365#(<= 50000001 ~SIZE~0)} havoc ~i~0;havoc ~j~0;~i~0 := 0;~j~0 := 0; {366#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:27,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {366#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {366#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:27,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {366#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {367#(<= (+ main_~i~0 49999993) ~SIZE~0)} is VALID [2022-04-27 11:15:27,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {367#(<= (+ main_~i~0 49999993) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {367#(<= (+ main_~i~0 49999993) ~SIZE~0)} is VALID [2022-04-27 11:15:27,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {367#(<= (+ main_~i~0 49999993) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {368#(<= (+ main_~i~0 49999985) ~SIZE~0)} is VALID [2022-04-27 11:15:27,747 INFO L290 TraceCheckUtils]: 10: Hoare triple {368#(<= (+ main_~i~0 49999985) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {368#(<= (+ main_~i~0 49999985) ~SIZE~0)} is VALID [2022-04-27 11:15:27,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {368#(<= (+ main_~i~0 49999985) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {369#(<= (+ main_~i~0 49999977) ~SIZE~0)} is VALID [2022-04-27 11:15:27,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {369#(<= (+ main_~i~0 49999977) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {369#(<= (+ main_~i~0 49999977) ~SIZE~0)} is VALID [2022-04-27 11:15:27,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {369#(<= (+ main_~i~0 49999977) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {370#(<= (+ 49999969 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:27,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {370#(<= (+ 49999969 main_~i~0) ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {361#false} is VALID [2022-04-27 11:15:27,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {361#false} ~j~0 := (if ~i~0 < 0 && 0 != ~i~0 % 4 then 1 + ~i~0 / 4 else ~i~0 / 4); {361#false} is VALID [2022-04-27 11:15:27,749 INFO L272 TraceCheckUtils]: 16: Hoare triple {361#false} call __VERIFIER_assert((if 4 * ~j~0 == ~i~0 then 1 else 0)); {361#false} is VALID [2022-04-27 11:15:27,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {361#false} ~cond := #in~cond; {361#false} is VALID [2022-04-27 11:15:27,749 INFO L290 TraceCheckUtils]: 18: Hoare triple {361#false} assume 0 == ~cond; {361#false} is VALID [2022-04-27 11:15:27,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {361#false} assume !false; {361#false} is VALID [2022-04-27 11:15:27,749 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:15:27,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:15:27,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106608128] [2022-04-27 11:15:27,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106608128] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:15:27,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429190174] [2022-04-27 11:15:27,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:15:27,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:27,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:15:27,760 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:15:27,761 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:15:27,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:15:27,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:15:27,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 11:15:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:27,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:15:28,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {360#true} call ULTIMATE.init(); {360#true} is VALID [2022-04-27 11:15:28,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {360#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(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {365#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:28,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {365#(<= 50000001 ~SIZE~0)} assume true; {365#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:28,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {365#(<= 50000001 ~SIZE~0)} {360#true} #52#return; {365#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:28,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {365#(<= 50000001 ~SIZE~0)} call #t~ret5 := main(); {365#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:28,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {365#(<= 50000001 ~SIZE~0)} havoc ~i~0;havoc ~j~0;~i~0 := 0;~j~0 := 0; {390#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:28,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {390#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {390#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:28,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {397#(and (<= main_~i~0 8) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:28,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {397#(and (<= main_~i~0 8) (<= 50000001 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {397#(and (<= main_~i~0 8) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:28,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {397#(and (<= main_~i~0 8) (<= 50000001 ~SIZE~0))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {404#(and (<= main_~i~0 16) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:28,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {404#(and (<= main_~i~0 16) (<= 50000001 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {404#(and (<= main_~i~0 16) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:28,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {404#(and (<= main_~i~0 16) (<= 50000001 ~SIZE~0))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {411#(and (<= main_~i~0 24) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:28,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {411#(and (<= main_~i~0 24) (<= 50000001 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {411#(and (<= main_~i~0 24) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:28,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {411#(and (<= main_~i~0 24) (<= 50000001 ~SIZE~0))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {418#(and (<= main_~i~0 32) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:28,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {418#(and (<= main_~i~0 32) (<= 50000001 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {361#false} is VALID [2022-04-27 11:15:28,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {361#false} ~j~0 := (if ~i~0 < 0 && 0 != ~i~0 % 4 then 1 + ~i~0 / 4 else ~i~0 / 4); {361#false} is VALID [2022-04-27 11:15:28,020 INFO L272 TraceCheckUtils]: 16: Hoare triple {361#false} call __VERIFIER_assert((if 4 * ~j~0 == ~i~0 then 1 else 0)); {361#false} is VALID [2022-04-27 11:15:28,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {361#false} ~cond := #in~cond; {361#false} is VALID [2022-04-27 11:15:28,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {361#false} assume 0 == ~cond; {361#false} is VALID [2022-04-27 11:15:28,021 INFO L290 TraceCheckUtils]: 19: Hoare triple {361#false} assume !false; {361#false} is VALID [2022-04-27 11:15:28,021 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:15:28,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:15:28,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {361#false} assume !false; {361#false} is VALID [2022-04-27 11:15:28,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {361#false} assume 0 == ~cond; {361#false} is VALID [2022-04-27 11:15:28,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {361#false} ~cond := #in~cond; {361#false} is VALID [2022-04-27 11:15:28,210 INFO L272 TraceCheckUtils]: 16: Hoare triple {361#false} call __VERIFIER_assert((if 4 * ~j~0 == ~i~0 then 1 else 0)); {361#false} is VALID [2022-04-27 11:15:28,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {361#false} ~j~0 := (if ~i~0 < 0 && 0 != ~i~0 % 4 then 1 + ~i~0 / 4 else ~i~0 / 4); {361#false} is VALID [2022-04-27 11:15:28,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {452#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {361#false} is VALID [2022-04-27 11:15:28,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {456#(< (+ main_~i~0 8) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {452#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-27 11:15:28,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {456#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {456#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-27 11:15:28,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {463#(< (+ main_~i~0 16) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {456#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-27 11:15:28,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {463#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {463#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-27 11:15:28,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {470#(< (+ main_~i~0 24) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {463#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-27 11:15:28,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {470#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {470#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-27 11:15:28,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {477#(< (+ 32 main_~i~0) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {470#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-27 11:15:28,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {477#(< (+ 32 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {477#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:28,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {484#(< 32 ~SIZE~0)} havoc ~i~0;havoc ~j~0;~i~0 := 0;~j~0 := 0; {477#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:28,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {484#(< 32 ~SIZE~0)} call #t~ret5 := main(); {484#(< 32 ~SIZE~0)} is VALID [2022-04-27 11:15:28,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {484#(< 32 ~SIZE~0)} {360#true} #52#return; {484#(< 32 ~SIZE~0)} is VALID [2022-04-27 11:15:28,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {484#(< 32 ~SIZE~0)} assume true; {484#(< 32 ~SIZE~0)} is VALID [2022-04-27 11:15:28,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {360#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(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {484#(< 32 ~SIZE~0)} is VALID [2022-04-27 11:15:28,222 INFO L272 TraceCheckUtils]: 0: Hoare triple {360#true} call ULTIMATE.init(); {360#true} is VALID [2022-04-27 11:15:28,222 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:15:28,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429190174] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:15:28,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:15:28,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-04-27 11:15:28,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765466269] [2022-04-27 11:15:28,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:15:28,223 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 18 states have internal predecessors, (39), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-04-27 11:15:28,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:28,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.95) internal successors, (39), 18 states have internal predecessors, (39), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:15:28,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:28,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 11:15:28,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:28,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 11:15:28,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=231, Unknown=0, NotChecked=0, Total=380 [2022-04-27 11:15:28,267 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 18 states have internal predecessors, (39), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:15:28,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:28,624 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-27 11:15:28,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 11:15:28,624 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 18 states have internal predecessors, (39), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-04-27 11:15:28,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:15:28,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 18 states have internal predecessors, (39), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:15:28,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 54 transitions. [2022-04-27 11:15:28,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 18 states have internal predecessors, (39), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:15:28,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 54 transitions. [2022-04-27 11:15:28,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 54 transitions. [2022-04-27 11:15:28,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:28,677 INFO L225 Difference]: With dead ends: 39 [2022-04-27 11:15:28,677 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 11:15:28,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=329, Invalid=601, Unknown=0, NotChecked=0, Total=930 [2022-04-27 11:15:28,679 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 54 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:15:28,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 17 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:15:28,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 11:15:28,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-27 11:15:28,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:15:28,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:28,698 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:28,698 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:28,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:28,699 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-27 11:15:28,699 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 11:15:28,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:28,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:28,700 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-27 11:15:28,700 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-27 11:15:28,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:28,703 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-27 11:15:28,703 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 11:15:28,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:28,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:28,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:15:28,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:15:28,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:28,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-04-27 11:15:28,704 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 20 [2022-04-27 11:15:28,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:15:28,705 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-04-27 11:15:28,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 18 states have internal predecessors, (39), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:15:28,705 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 11:15:28,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 11:15:28,705 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:28,705 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:15:28,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 11:15:28,915 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,SelfDestructingSolverStorable2 [2022-04-27 11:15:28,915 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:28,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:28,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1134779159, now seen corresponding path program 3 times [2022-04-27 11:15:28,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:28,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694408284] [2022-04-27 11:15:28,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:28,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:29,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:15:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:29,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {715#(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(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {703#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:29,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {703#(<= 50000001 ~SIZE~0)} assume true; {703#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:29,079 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {703#(<= 50000001 ~SIZE~0)} {698#true} #52#return; {703#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:29,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {698#true} call ULTIMATE.init(); {715#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:15:29,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {715#(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(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {703#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:29,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {703#(<= 50000001 ~SIZE~0)} assume true; {703#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:29,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {703#(<= 50000001 ~SIZE~0)} {698#true} #52#return; {703#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:29,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {703#(<= 50000001 ~SIZE~0)} call #t~ret5 := main(); {703#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:29,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {703#(<= 50000001 ~SIZE~0)} havoc ~i~0;havoc ~j~0;~i~0 := 0;~j~0 := 0; {704#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:29,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {704#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {704#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:29,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {704#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {705#(<= (+ main_~i~0 49999993) ~SIZE~0)} is VALID [2022-04-27 11:15:29,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {705#(<= (+ main_~i~0 49999993) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {705#(<= (+ main_~i~0 49999993) ~SIZE~0)} is VALID [2022-04-27 11:15:29,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {705#(<= (+ main_~i~0 49999993) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {706#(<= (+ main_~i~0 49999985) ~SIZE~0)} is VALID [2022-04-27 11:15:29,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {706#(<= (+ main_~i~0 49999985) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {706#(<= (+ main_~i~0 49999985) ~SIZE~0)} is VALID [2022-04-27 11:15:29,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {706#(<= (+ main_~i~0 49999985) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {707#(<= (+ main_~i~0 49999977) ~SIZE~0)} is VALID [2022-04-27 11:15:29,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {707#(<= (+ main_~i~0 49999977) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {707#(<= (+ main_~i~0 49999977) ~SIZE~0)} is VALID [2022-04-27 11:15:29,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {707#(<= (+ main_~i~0 49999977) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {708#(<= (+ 49999969 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:29,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {708#(<= (+ 49999969 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {708#(<= (+ 49999969 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:29,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {708#(<= (+ 49999969 main_~i~0) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {709#(<= (+ main_~i~0 49999961) ~SIZE~0)} is VALID [2022-04-27 11:15:29,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {709#(<= (+ main_~i~0 49999961) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {709#(<= (+ main_~i~0 49999961) ~SIZE~0)} is VALID [2022-04-27 11:15:29,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {709#(<= (+ main_~i~0 49999961) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {710#(<= (+ 49999953 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:29,086 INFO L290 TraceCheckUtils]: 18: Hoare triple {710#(<= (+ 49999953 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {710#(<= (+ 49999953 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:29,086 INFO L290 TraceCheckUtils]: 19: Hoare triple {710#(<= (+ 49999953 main_~i~0) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {711#(<= (+ 49999945 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:29,087 INFO L290 TraceCheckUtils]: 20: Hoare triple {711#(<= (+ 49999945 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {711#(<= (+ 49999945 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:29,087 INFO L290 TraceCheckUtils]: 21: Hoare triple {711#(<= (+ 49999945 main_~i~0) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {712#(<= (+ main_~i~0 49999937) ~SIZE~0)} is VALID [2022-04-27 11:15:29,087 INFO L290 TraceCheckUtils]: 22: Hoare triple {712#(<= (+ main_~i~0 49999937) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {712#(<= (+ main_~i~0 49999937) ~SIZE~0)} is VALID [2022-04-27 11:15:29,088 INFO L290 TraceCheckUtils]: 23: Hoare triple {712#(<= (+ main_~i~0 49999937) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {713#(<= (+ 49999929 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:29,088 INFO L290 TraceCheckUtils]: 24: Hoare triple {713#(<= (+ 49999929 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {713#(<= (+ 49999929 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:29,089 INFO L290 TraceCheckUtils]: 25: Hoare triple {713#(<= (+ 49999929 main_~i~0) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {714#(<= (+ 49999921 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:29,089 INFO L290 TraceCheckUtils]: 26: Hoare triple {714#(<= (+ 49999921 main_~i~0) ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {699#false} is VALID [2022-04-27 11:15:29,089 INFO L290 TraceCheckUtils]: 27: Hoare triple {699#false} ~j~0 := (if ~i~0 < 0 && 0 != ~i~0 % 4 then 1 + ~i~0 / 4 else ~i~0 / 4); {699#false} is VALID [2022-04-27 11:15:29,089 INFO L272 TraceCheckUtils]: 28: Hoare triple {699#false} call __VERIFIER_assert((if 4 * ~j~0 == ~i~0 then 1 else 0)); {699#false} is VALID [2022-04-27 11:15:29,089 INFO L290 TraceCheckUtils]: 29: Hoare triple {699#false} ~cond := #in~cond; {699#false} is VALID [2022-04-27 11:15:29,089 INFO L290 TraceCheckUtils]: 30: Hoare triple {699#false} assume 0 == ~cond; {699#false} is VALID [2022-04-27 11:15:29,089 INFO L290 TraceCheckUtils]: 31: Hoare triple {699#false} assume !false; {699#false} is VALID [2022-04-27 11:15:29,090 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:15:29,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:15:29,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694408284] [2022-04-27 11:15:29,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694408284] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:15:29,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881364119] [2022-04-27 11:15:29,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:15:29,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:29,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:15:29,091 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:15:29,092 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:15:29,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-04-27 11:15:29,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:15:29,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 11:15:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:29,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:15:29,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {698#true} call ULTIMATE.init(); {698#true} is VALID [2022-04-27 11:15:29,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {698#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(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {703#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:29,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {703#(<= 50000001 ~SIZE~0)} assume true; {703#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:29,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {703#(<= 50000001 ~SIZE~0)} {698#true} #52#return; {703#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:29,546 INFO L272 TraceCheckUtils]: 4: Hoare triple {703#(<= 50000001 ~SIZE~0)} call #t~ret5 := main(); {703#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:29,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {703#(<= 50000001 ~SIZE~0)} havoc ~i~0;havoc ~j~0;~i~0 := 0;~j~0 := 0; {734#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:29,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {734#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {734#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:29,548 INFO L290 TraceCheckUtils]: 7: Hoare triple {734#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {741#(and (<= main_~i~0 8) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:29,548 INFO L290 TraceCheckUtils]: 8: Hoare triple {741#(and (<= main_~i~0 8) (<= 50000001 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {741#(and (<= main_~i~0 8) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:29,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {741#(and (<= main_~i~0 8) (<= 50000001 ~SIZE~0))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {748#(and (<= main_~i~0 16) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:29,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {748#(and (<= main_~i~0 16) (<= 50000001 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {748#(and (<= main_~i~0 16) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:29,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {748#(and (<= main_~i~0 16) (<= 50000001 ~SIZE~0))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {755#(and (<= main_~i~0 24) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:29,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {755#(and (<= main_~i~0 24) (<= 50000001 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {755#(and (<= main_~i~0 24) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:29,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {755#(and (<= main_~i~0 24) (<= 50000001 ~SIZE~0))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {762#(and (<= main_~i~0 32) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:29,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {762#(and (<= main_~i~0 32) (<= 50000001 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {762#(and (<= main_~i~0 32) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:29,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {762#(and (<= main_~i~0 32) (<= 50000001 ~SIZE~0))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {769#(and (<= main_~i~0 40) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:29,553 INFO L290 TraceCheckUtils]: 16: Hoare triple {769#(and (<= main_~i~0 40) (<= 50000001 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {769#(and (<= main_~i~0 40) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:29,554 INFO L290 TraceCheckUtils]: 17: Hoare triple {769#(and (<= main_~i~0 40) (<= 50000001 ~SIZE~0))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {776#(and (<= main_~i~0 48) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:29,554 INFO L290 TraceCheckUtils]: 18: Hoare triple {776#(and (<= main_~i~0 48) (<= 50000001 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {776#(and (<= main_~i~0 48) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:29,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {776#(and (<= main_~i~0 48) (<= 50000001 ~SIZE~0))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {783#(and (<= main_~i~0 56) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:29,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {783#(and (<= main_~i~0 56) (<= 50000001 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {783#(and (<= main_~i~0 56) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:29,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {783#(and (<= main_~i~0 56) (<= 50000001 ~SIZE~0))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {790#(and (<= main_~i~0 64) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:29,556 INFO L290 TraceCheckUtils]: 22: Hoare triple {790#(and (<= main_~i~0 64) (<= 50000001 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {790#(and (<= main_~i~0 64) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:29,556 INFO L290 TraceCheckUtils]: 23: Hoare triple {790#(and (<= main_~i~0 64) (<= 50000001 ~SIZE~0))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {797#(and (<= main_~i~0 72) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:29,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {797#(and (<= main_~i~0 72) (<= 50000001 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {797#(and (<= main_~i~0 72) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:29,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {797#(and (<= main_~i~0 72) (<= 50000001 ~SIZE~0))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {804#(and (<= main_~i~0 80) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:29,558 INFO L290 TraceCheckUtils]: 26: Hoare triple {804#(and (<= main_~i~0 80) (<= 50000001 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {699#false} is VALID [2022-04-27 11:15:29,558 INFO L290 TraceCheckUtils]: 27: Hoare triple {699#false} ~j~0 := (if ~i~0 < 0 && 0 != ~i~0 % 4 then 1 + ~i~0 / 4 else ~i~0 / 4); {699#false} is VALID [2022-04-27 11:15:29,558 INFO L272 TraceCheckUtils]: 28: Hoare triple {699#false} call __VERIFIER_assert((if 4 * ~j~0 == ~i~0 then 1 else 0)); {699#false} is VALID [2022-04-27 11:15:29,558 INFO L290 TraceCheckUtils]: 29: Hoare triple {699#false} ~cond := #in~cond; {699#false} is VALID [2022-04-27 11:15:29,558 INFO L290 TraceCheckUtils]: 30: Hoare triple {699#false} assume 0 == ~cond; {699#false} is VALID [2022-04-27 11:15:29,558 INFO L290 TraceCheckUtils]: 31: Hoare triple {699#false} assume !false; {699#false} is VALID [2022-04-27 11:15:29,558 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:15:29,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:15:29,910 INFO L290 TraceCheckUtils]: 31: Hoare triple {699#false} assume !false; {699#false} is VALID [2022-04-27 11:15:29,911 INFO L290 TraceCheckUtils]: 30: Hoare triple {699#false} assume 0 == ~cond; {699#false} is VALID [2022-04-27 11:15:29,911 INFO L290 TraceCheckUtils]: 29: Hoare triple {699#false} ~cond := #in~cond; {699#false} is VALID [2022-04-27 11:15:29,911 INFO L272 TraceCheckUtils]: 28: Hoare triple {699#false} call __VERIFIER_assert((if 4 * ~j~0 == ~i~0 then 1 else 0)); {699#false} is VALID [2022-04-27 11:15:29,911 INFO L290 TraceCheckUtils]: 27: Hoare triple {699#false} ~j~0 := (if ~i~0 < 0 && 0 != ~i~0 % 4 then 1 + ~i~0 / 4 else ~i~0 / 4); {699#false} is VALID [2022-04-27 11:15:29,913 INFO L290 TraceCheckUtils]: 26: Hoare triple {838#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {699#false} is VALID [2022-04-27 11:15:29,913 INFO L290 TraceCheckUtils]: 25: Hoare triple {842#(< (+ main_~i~0 8) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {838#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-27 11:15:29,914 INFO L290 TraceCheckUtils]: 24: Hoare triple {842#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {842#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-27 11:15:29,914 INFO L290 TraceCheckUtils]: 23: Hoare triple {849#(< (+ main_~i~0 16) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {842#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-27 11:15:29,914 INFO L290 TraceCheckUtils]: 22: Hoare triple {849#(< (+ main_~i~0 16) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {849#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-27 11:15:29,915 INFO L290 TraceCheckUtils]: 21: Hoare triple {856#(< (+ main_~i~0 24) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {849#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-27 11:15:29,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {856#(< (+ main_~i~0 24) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {856#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-27 11:15:29,919 INFO L290 TraceCheckUtils]: 19: Hoare triple {863#(< (+ 32 main_~i~0) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {856#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-27 11:15:29,919 INFO L290 TraceCheckUtils]: 18: Hoare triple {863#(< (+ 32 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {863#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:29,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {870#(< (+ 40 main_~i~0) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {863#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:29,920 INFO L290 TraceCheckUtils]: 16: Hoare triple {870#(< (+ 40 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {870#(< (+ 40 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:29,920 INFO L290 TraceCheckUtils]: 15: Hoare triple {877#(< (+ main_~i~0 48) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {870#(< (+ 40 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:29,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {877#(< (+ main_~i~0 48) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {877#(< (+ main_~i~0 48) ~SIZE~0)} is VALID [2022-04-27 11:15:29,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {884#(< (+ 56 main_~i~0) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {877#(< (+ main_~i~0 48) ~SIZE~0)} is VALID [2022-04-27 11:15:29,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {884#(< (+ 56 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {884#(< (+ 56 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:29,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {891#(< (+ 64 main_~i~0) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {884#(< (+ 56 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:29,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {891#(< (+ 64 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {891#(< (+ 64 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:29,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {898#(< (+ 72 main_~i~0) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {891#(< (+ 64 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:29,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {898#(< (+ 72 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {898#(< (+ 72 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:29,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {905#(< (+ main_~i~0 80) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {898#(< (+ 72 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:29,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {905#(< (+ main_~i~0 80) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {905#(< (+ main_~i~0 80) ~SIZE~0)} is VALID [2022-04-27 11:15:29,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {912#(< 80 ~SIZE~0)} havoc ~i~0;havoc ~j~0;~i~0 := 0;~j~0 := 0; {905#(< (+ main_~i~0 80) ~SIZE~0)} is VALID [2022-04-27 11:15:29,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {912#(< 80 ~SIZE~0)} call #t~ret5 := main(); {912#(< 80 ~SIZE~0)} is VALID [2022-04-27 11:15:29,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#(< 80 ~SIZE~0)} {698#true} #52#return; {912#(< 80 ~SIZE~0)} is VALID [2022-04-27 11:15:29,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#(< 80 ~SIZE~0)} assume true; {912#(< 80 ~SIZE~0)} is VALID [2022-04-27 11:15:29,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {698#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(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {912#(< 80 ~SIZE~0)} is VALID [2022-04-27 11:15:29,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {698#true} call ULTIMATE.init(); {698#true} is VALID [2022-04-27 11:15:29,926 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:15:29,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881364119] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:15:29,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:15:29,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 38 [2022-04-27 11:15:29,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617403808] [2022-04-27 11:15:29,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:15:29,927 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 36 states have internal predecessors, (75), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-04-27 11:15:29,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:29,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 36 states have internal predecessors, (75), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:15:29,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:29,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-27 11:15:29,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:29,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-27 11:15:29,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=581, Invalid=825, Unknown=0, NotChecked=0, Total=1406 [2022-04-27 11:15:29,980 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 36 states have internal predecessors, (75), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:15:30,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:30,808 INFO L93 Difference]: Finished difference Result 63 states and 96 transitions. [2022-04-27 11:15:30,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-27 11:15:30,809 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 36 states have internal predecessors, (75), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-04-27 11:15:30,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:15:30,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 36 states have internal predecessors, (75), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:15:30,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 96 transitions. [2022-04-27 11:15:30,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 36 states have internal predecessors, (75), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:15:30,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 96 transitions. [2022-04-27 11:15:30,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 96 transitions. [2022-04-27 11:15:30,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:30,891 INFO L225 Difference]: With dead ends: 63 [2022-04-27 11:15:30,891 INFO L226 Difference]: Without dead ends: 57 [2022-04-27 11:15:30,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1007 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1268, Invalid=2392, Unknown=0, NotChecked=0, Total=3660 [2022-04-27 11:15:30,893 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 96 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:15:30,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 19 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:15:30,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-27 11:15:30,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-27 11:15:30,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:15:30,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 3 states have call successors, (3), 3 states 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:15:30,924 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 3 states have call successors, (3), 3 states 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:15:30,924 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 3 states have call successors, (3), 3 states 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:15:30,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:30,926 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2022-04-27 11:15:30,926 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2022-04-27 11:15:30,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:30,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:30,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 3 states have call successors, (3), 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 57 states. [2022-04-27 11:15:30,927 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 3 states have call successors, (3), 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 57 states. [2022-04-27 11:15:30,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:30,928 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2022-04-27 11:15:30,928 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2022-04-27 11:15:30,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:30,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:30,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:15:30,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:15:30,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 3 states have call successors, (3), 3 states 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:15:30,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2022-04-27 11:15:30,931 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 79 transitions. Word has length 32 [2022-04-27 11:15:30,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:15:30,931 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 79 transitions. [2022-04-27 11:15:30,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 36 states have internal predecessors, (75), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:15:30,931 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2022-04-27 11:15:30,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-27 11:15:30,932 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:30,932 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:15:30,948 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:15:31,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:31,147 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:31,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:31,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1201334075, now seen corresponding path program 4 times [2022-04-27 11:15:31,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:31,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610569716] [2022-04-27 11:15:31,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:31,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:31,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:15:31,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:31,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {1299#(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(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {1275#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:31,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {1275#(<= 50000001 ~SIZE~0)} assume true; {1275#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:31,508 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1275#(<= 50000001 ~SIZE~0)} {1270#true} #52#return; {1275#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:31,509 INFO L272 TraceCheckUtils]: 0: Hoare triple {1270#true} call ULTIMATE.init(); {1299#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:15:31,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {1299#(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(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {1275#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:31,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {1275#(<= 50000001 ~SIZE~0)} assume true; {1275#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:31,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1275#(<= 50000001 ~SIZE~0)} {1270#true} #52#return; {1275#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:31,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {1275#(<= 50000001 ~SIZE~0)} call #t~ret5 := main(); {1275#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 11:15:31,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {1275#(<= 50000001 ~SIZE~0)} havoc ~i~0;havoc ~j~0;~i~0 := 0;~j~0 := 0; {1276#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:31,511 INFO L290 TraceCheckUtils]: 6: Hoare triple {1276#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1276#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 11:15:31,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {1276#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1277#(<= (+ main_~i~0 49999993) ~SIZE~0)} is VALID [2022-04-27 11:15:31,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {1277#(<= (+ main_~i~0 49999993) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1277#(<= (+ main_~i~0 49999993) ~SIZE~0)} is VALID [2022-04-27 11:15:31,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {1277#(<= (+ main_~i~0 49999993) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1278#(<= (+ main_~i~0 49999985) ~SIZE~0)} is VALID [2022-04-27 11:15:31,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {1278#(<= (+ main_~i~0 49999985) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1278#(<= (+ main_~i~0 49999985) ~SIZE~0)} is VALID [2022-04-27 11:15:31,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {1278#(<= (+ main_~i~0 49999985) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1279#(<= (+ main_~i~0 49999977) ~SIZE~0)} is VALID [2022-04-27 11:15:31,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {1279#(<= (+ main_~i~0 49999977) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1279#(<= (+ main_~i~0 49999977) ~SIZE~0)} is VALID [2022-04-27 11:15:31,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {1279#(<= (+ main_~i~0 49999977) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1280#(<= (+ 49999969 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:31,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {1280#(<= (+ 49999969 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1280#(<= (+ 49999969 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:31,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {1280#(<= (+ 49999969 main_~i~0) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1281#(<= (+ main_~i~0 49999961) ~SIZE~0)} is VALID [2022-04-27 11:15:31,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {1281#(<= (+ main_~i~0 49999961) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1281#(<= (+ main_~i~0 49999961) ~SIZE~0)} is VALID [2022-04-27 11:15:31,515 INFO L290 TraceCheckUtils]: 17: Hoare triple {1281#(<= (+ main_~i~0 49999961) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1282#(<= (+ 49999953 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:31,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {1282#(<= (+ 49999953 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1282#(<= (+ 49999953 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:31,520 INFO L290 TraceCheckUtils]: 19: Hoare triple {1282#(<= (+ 49999953 main_~i~0) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1283#(<= (+ 49999945 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:31,520 INFO L290 TraceCheckUtils]: 20: Hoare triple {1283#(<= (+ 49999945 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1283#(<= (+ 49999945 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:31,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {1283#(<= (+ 49999945 main_~i~0) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1284#(<= (+ main_~i~0 49999937) ~SIZE~0)} is VALID [2022-04-27 11:15:31,521 INFO L290 TraceCheckUtils]: 22: Hoare triple {1284#(<= (+ main_~i~0 49999937) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1284#(<= (+ main_~i~0 49999937) ~SIZE~0)} is VALID [2022-04-27 11:15:31,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {1284#(<= (+ main_~i~0 49999937) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1285#(<= (+ 49999929 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:31,522 INFO L290 TraceCheckUtils]: 24: Hoare triple {1285#(<= (+ 49999929 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1285#(<= (+ 49999929 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:31,522 INFO L290 TraceCheckUtils]: 25: Hoare triple {1285#(<= (+ 49999929 main_~i~0) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1286#(<= (+ 49999921 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:31,522 INFO L290 TraceCheckUtils]: 26: Hoare triple {1286#(<= (+ 49999921 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1286#(<= (+ 49999921 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:31,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {1286#(<= (+ 49999921 main_~i~0) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1287#(<= (+ 49999913 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:31,523 INFO L290 TraceCheckUtils]: 28: Hoare triple {1287#(<= (+ 49999913 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1287#(<= (+ 49999913 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:31,523 INFO L290 TraceCheckUtils]: 29: Hoare triple {1287#(<= (+ 49999913 main_~i~0) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1288#(<= (+ main_~i~0 49999905) ~SIZE~0)} is VALID [2022-04-27 11:15:31,524 INFO L290 TraceCheckUtils]: 30: Hoare triple {1288#(<= (+ main_~i~0 49999905) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1288#(<= (+ main_~i~0 49999905) ~SIZE~0)} is VALID [2022-04-27 11:15:31,524 INFO L290 TraceCheckUtils]: 31: Hoare triple {1288#(<= (+ main_~i~0 49999905) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1289#(<= (+ main_~i~0 49999897) ~SIZE~0)} is VALID [2022-04-27 11:15:31,524 INFO L290 TraceCheckUtils]: 32: Hoare triple {1289#(<= (+ main_~i~0 49999897) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1289#(<= (+ main_~i~0 49999897) ~SIZE~0)} is VALID [2022-04-27 11:15:31,525 INFO L290 TraceCheckUtils]: 33: Hoare triple {1289#(<= (+ main_~i~0 49999897) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1290#(<= (+ main_~i~0 49999889) ~SIZE~0)} is VALID [2022-04-27 11:15:31,525 INFO L290 TraceCheckUtils]: 34: Hoare triple {1290#(<= (+ main_~i~0 49999889) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1290#(<= (+ main_~i~0 49999889) ~SIZE~0)} is VALID [2022-04-27 11:15:31,525 INFO L290 TraceCheckUtils]: 35: Hoare triple {1290#(<= (+ main_~i~0 49999889) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1291#(<= (+ main_~i~0 49999881) ~SIZE~0)} is VALID [2022-04-27 11:15:31,526 INFO L290 TraceCheckUtils]: 36: Hoare triple {1291#(<= (+ main_~i~0 49999881) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1291#(<= (+ main_~i~0 49999881) ~SIZE~0)} is VALID [2022-04-27 11:15:31,526 INFO L290 TraceCheckUtils]: 37: Hoare triple {1291#(<= (+ main_~i~0 49999881) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1292#(<= (+ 49999873 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:31,527 INFO L290 TraceCheckUtils]: 38: Hoare triple {1292#(<= (+ 49999873 main_~i~0) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1292#(<= (+ 49999873 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:31,527 INFO L290 TraceCheckUtils]: 39: Hoare triple {1292#(<= (+ 49999873 main_~i~0) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1293#(<= (+ main_~i~0 49999865) ~SIZE~0)} is VALID [2022-04-27 11:15:31,527 INFO L290 TraceCheckUtils]: 40: Hoare triple {1293#(<= (+ main_~i~0 49999865) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1293#(<= (+ main_~i~0 49999865) ~SIZE~0)} is VALID [2022-04-27 11:15:31,528 INFO L290 TraceCheckUtils]: 41: Hoare triple {1293#(<= (+ main_~i~0 49999865) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1294#(<= (+ main_~i~0 49999857) ~SIZE~0)} is VALID [2022-04-27 11:15:31,528 INFO L290 TraceCheckUtils]: 42: Hoare triple {1294#(<= (+ main_~i~0 49999857) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1294#(<= (+ main_~i~0 49999857) ~SIZE~0)} is VALID [2022-04-27 11:15:31,528 INFO L290 TraceCheckUtils]: 43: Hoare triple {1294#(<= (+ main_~i~0 49999857) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1295#(<= (+ main_~i~0 49999849) ~SIZE~0)} is VALID [2022-04-27 11:15:31,529 INFO L290 TraceCheckUtils]: 44: Hoare triple {1295#(<= (+ main_~i~0 49999849) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1295#(<= (+ main_~i~0 49999849) ~SIZE~0)} is VALID [2022-04-27 11:15:31,529 INFO L290 TraceCheckUtils]: 45: Hoare triple {1295#(<= (+ main_~i~0 49999849) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1296#(<= (+ main_~i~0 49999841) ~SIZE~0)} is VALID [2022-04-27 11:15:31,529 INFO L290 TraceCheckUtils]: 46: Hoare triple {1296#(<= (+ main_~i~0 49999841) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1296#(<= (+ main_~i~0 49999841) ~SIZE~0)} is VALID [2022-04-27 11:15:31,530 INFO L290 TraceCheckUtils]: 47: Hoare triple {1296#(<= (+ main_~i~0 49999841) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1297#(<= (+ main_~i~0 49999833) ~SIZE~0)} is VALID [2022-04-27 11:15:31,530 INFO L290 TraceCheckUtils]: 48: Hoare triple {1297#(<= (+ main_~i~0 49999833) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1297#(<= (+ main_~i~0 49999833) ~SIZE~0)} is VALID [2022-04-27 11:15:31,530 INFO L290 TraceCheckUtils]: 49: Hoare triple {1297#(<= (+ main_~i~0 49999833) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1298#(<= (+ 49999825 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 11:15:31,531 INFO L290 TraceCheckUtils]: 50: Hoare triple {1298#(<= (+ 49999825 main_~i~0) ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {1271#false} is VALID [2022-04-27 11:15:31,531 INFO L290 TraceCheckUtils]: 51: Hoare triple {1271#false} ~j~0 := (if ~i~0 < 0 && 0 != ~i~0 % 4 then 1 + ~i~0 / 4 else ~i~0 / 4); {1271#false} is VALID [2022-04-27 11:15:31,531 INFO L272 TraceCheckUtils]: 52: Hoare triple {1271#false} call __VERIFIER_assert((if 4 * ~j~0 == ~i~0 then 1 else 0)); {1271#false} is VALID [2022-04-27 11:15:31,531 INFO L290 TraceCheckUtils]: 53: Hoare triple {1271#false} ~cond := #in~cond; {1271#false} is VALID [2022-04-27 11:15:31,531 INFO L290 TraceCheckUtils]: 54: Hoare triple {1271#false} assume 0 == ~cond; {1271#false} is VALID [2022-04-27 11:15:31,531 INFO L290 TraceCheckUtils]: 55: Hoare triple {1271#false} assume !false; {1271#false} is VALID [2022-04-27 11:15:31,532 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:15:31,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:15:31,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610569716] [2022-04-27 11:15:31,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610569716] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:15:31,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724333937] [2022-04-27 11:15:31,532 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:15:31,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:31,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:15:31,533 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:15:31,534 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:15:31,579 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:15:31,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:15:31,580 WARN L261 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-27 11:15:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:31,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:15:32,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {1270#true} call ULTIMATE.init(); {1270#true} is VALID [2022-04-27 11:15:32,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {1270#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(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {1270#true} is VALID [2022-04-27 11:15:32,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {1270#true} assume true; {1270#true} is VALID [2022-04-27 11:15:32,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1270#true} {1270#true} #52#return; {1270#true} is VALID [2022-04-27 11:15:32,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {1270#true} call #t~ret5 := main(); {1270#true} is VALID [2022-04-27 11:15:32,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {1270#true} havoc ~i~0;havoc ~j~0;~i~0 := 0;~j~0 := 0; {1318#(= main_~i~0 0)} is VALID [2022-04-27 11:15:32,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {1318#(= main_~i~0 0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1318#(= main_~i~0 0)} is VALID [2022-04-27 11:15:32,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {1318#(= main_~i~0 0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1325#(= (+ main_~i~0 (- 8)) 0)} is VALID [2022-04-27 11:15:32,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {1325#(= (+ main_~i~0 (- 8)) 0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1325#(= (+ main_~i~0 (- 8)) 0)} is VALID [2022-04-27 11:15:32,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {1325#(= (+ main_~i~0 (- 8)) 0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1332#(= (+ (- 16) main_~i~0) 0)} is VALID [2022-04-27 11:15:32,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {1332#(= (+ (- 16) main_~i~0) 0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1332#(= (+ (- 16) main_~i~0) 0)} is VALID [2022-04-27 11:15:32,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {1332#(= (+ (- 16) main_~i~0) 0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1339#(= (+ main_~i~0 (- 24)) 0)} is VALID [2022-04-27 11:15:32,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {1339#(= (+ main_~i~0 (- 24)) 0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1339#(= (+ main_~i~0 (- 24)) 0)} is VALID [2022-04-27 11:15:32,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {1339#(= (+ main_~i~0 (- 24)) 0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1346#(= (+ main_~i~0 (- 32)) 0)} is VALID [2022-04-27 11:15:32,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {1346#(= (+ main_~i~0 (- 32)) 0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1346#(= (+ main_~i~0 (- 32)) 0)} is VALID [2022-04-27 11:15:32,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {1346#(= (+ main_~i~0 (- 32)) 0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1353#(= (+ (- 40) main_~i~0) 0)} is VALID [2022-04-27 11:15:32,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {1353#(= (+ (- 40) main_~i~0) 0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1353#(= (+ (- 40) main_~i~0) 0)} is VALID [2022-04-27 11:15:32,247 INFO L290 TraceCheckUtils]: 17: Hoare triple {1353#(= (+ (- 40) main_~i~0) 0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1360#(= main_~i~0 48)} is VALID [2022-04-27 11:15:32,247 INFO L290 TraceCheckUtils]: 18: Hoare triple {1360#(= main_~i~0 48)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1360#(= main_~i~0 48)} is VALID [2022-04-27 11:15:32,247 INFO L290 TraceCheckUtils]: 19: Hoare triple {1360#(= main_~i~0 48)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1367#(= (+ main_~i~0 (- 8)) 48)} is VALID [2022-04-27 11:15:32,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {1367#(= (+ main_~i~0 (- 8)) 48)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1367#(= (+ main_~i~0 (- 8)) 48)} is VALID [2022-04-27 11:15:32,248 INFO L290 TraceCheckUtils]: 21: Hoare triple {1367#(= (+ main_~i~0 (- 8)) 48)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1374#(= (+ (- 16) main_~i~0) 48)} is VALID [2022-04-27 11:15:32,249 INFO L290 TraceCheckUtils]: 22: Hoare triple {1374#(= (+ (- 16) main_~i~0) 48)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1374#(= (+ (- 16) main_~i~0) 48)} is VALID [2022-04-27 11:15:32,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {1374#(= (+ (- 16) main_~i~0) 48)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1381#(= (+ main_~i~0 (- 24)) 48)} is VALID [2022-04-27 11:15:32,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {1381#(= (+ main_~i~0 (- 24)) 48)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1381#(= (+ main_~i~0 (- 24)) 48)} is VALID [2022-04-27 11:15:32,250 INFO L290 TraceCheckUtils]: 25: Hoare triple {1381#(= (+ main_~i~0 (- 24)) 48)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1388#(= main_~i~0 80)} is VALID [2022-04-27 11:15:32,250 INFO L290 TraceCheckUtils]: 26: Hoare triple {1388#(= main_~i~0 80)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1388#(= main_~i~0 80)} is VALID [2022-04-27 11:15:32,251 INFO L290 TraceCheckUtils]: 27: Hoare triple {1388#(= main_~i~0 80)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1395#(= (+ main_~i~0 (- 8)) 80)} is VALID [2022-04-27 11:15:32,251 INFO L290 TraceCheckUtils]: 28: Hoare triple {1395#(= (+ main_~i~0 (- 8)) 80)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1395#(= (+ main_~i~0 (- 8)) 80)} is VALID [2022-04-27 11:15:32,251 INFO L290 TraceCheckUtils]: 29: Hoare triple {1395#(= (+ main_~i~0 (- 8)) 80)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1402#(= (+ (- 16) main_~i~0) 80)} is VALID [2022-04-27 11:15:32,252 INFO L290 TraceCheckUtils]: 30: Hoare triple {1402#(= (+ (- 16) main_~i~0) 80)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1402#(= (+ (- 16) main_~i~0) 80)} is VALID [2022-04-27 11:15:32,252 INFO L290 TraceCheckUtils]: 31: Hoare triple {1402#(= (+ (- 16) main_~i~0) 80)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1409#(= 104 main_~i~0)} is VALID [2022-04-27 11:15:32,253 INFO L290 TraceCheckUtils]: 32: Hoare triple {1409#(= 104 main_~i~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1409#(= 104 main_~i~0)} is VALID [2022-04-27 11:15:32,253 INFO L290 TraceCheckUtils]: 33: Hoare triple {1409#(= 104 main_~i~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1416#(= 104 (+ main_~i~0 (- 8)))} is VALID [2022-04-27 11:15:32,253 INFO L290 TraceCheckUtils]: 34: Hoare triple {1416#(= 104 (+ main_~i~0 (- 8)))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1416#(= 104 (+ main_~i~0 (- 8)))} is VALID [2022-04-27 11:15:32,254 INFO L290 TraceCheckUtils]: 35: Hoare triple {1416#(= 104 (+ main_~i~0 (- 8)))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1423#(= main_~i~0 120)} is VALID [2022-04-27 11:15:32,254 INFO L290 TraceCheckUtils]: 36: Hoare triple {1423#(= main_~i~0 120)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1423#(= main_~i~0 120)} is VALID [2022-04-27 11:15:32,254 INFO L290 TraceCheckUtils]: 37: Hoare triple {1423#(= main_~i~0 120)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1430#(= main_~i~0 128)} is VALID [2022-04-27 11:15:32,255 INFO L290 TraceCheckUtils]: 38: Hoare triple {1430#(= main_~i~0 128)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1430#(= main_~i~0 128)} is VALID [2022-04-27 11:15:32,255 INFO L290 TraceCheckUtils]: 39: Hoare triple {1430#(= main_~i~0 128)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1437#(= (+ main_~i~0 (- 8)) 128)} is VALID [2022-04-27 11:15:32,255 INFO L290 TraceCheckUtils]: 40: Hoare triple {1437#(= (+ main_~i~0 (- 8)) 128)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1437#(= (+ main_~i~0 (- 8)) 128)} is VALID [2022-04-27 11:15:32,256 INFO L290 TraceCheckUtils]: 41: Hoare triple {1437#(= (+ main_~i~0 (- 8)) 128)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1444#(= main_~i~0 144)} is VALID [2022-04-27 11:15:32,256 INFO L290 TraceCheckUtils]: 42: Hoare triple {1444#(= main_~i~0 144)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1444#(= main_~i~0 144)} is VALID [2022-04-27 11:15:32,256 INFO L290 TraceCheckUtils]: 43: Hoare triple {1444#(= main_~i~0 144)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1451#(= 144 (+ main_~i~0 (- 8)))} is VALID [2022-04-27 11:15:32,257 INFO L290 TraceCheckUtils]: 44: Hoare triple {1451#(= 144 (+ main_~i~0 (- 8)))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1451#(= 144 (+ main_~i~0 (- 8)))} is VALID [2022-04-27 11:15:32,257 INFO L290 TraceCheckUtils]: 45: Hoare triple {1451#(= 144 (+ main_~i~0 (- 8)))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1458#(= (+ (- 16) main_~i~0) 144)} is VALID [2022-04-27 11:15:32,257 INFO L290 TraceCheckUtils]: 46: Hoare triple {1458#(= (+ (- 16) main_~i~0) 144)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1458#(= (+ (- 16) main_~i~0) 144)} is VALID [2022-04-27 11:15:32,258 INFO L290 TraceCheckUtils]: 47: Hoare triple {1458#(= (+ (- 16) main_~i~0) 144)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1465#(= main_~i~0 168)} is VALID [2022-04-27 11:15:32,258 INFO L290 TraceCheckUtils]: 48: Hoare triple {1465#(= main_~i~0 168)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1465#(= main_~i~0 168)} is VALID [2022-04-27 11:15:32,258 INFO L290 TraceCheckUtils]: 49: Hoare triple {1465#(= main_~i~0 168)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1472#(= (+ main_~i~0 (- 8)) 168)} is VALID [2022-04-27 11:15:32,259 INFO L290 TraceCheckUtils]: 50: Hoare triple {1472#(= (+ main_~i~0 (- 8)) 168)} assume !(~i~0 < ~SIZE~0); {1472#(= (+ main_~i~0 (- 8)) 168)} is VALID [2022-04-27 11:15:32,259 INFO L290 TraceCheckUtils]: 51: Hoare triple {1472#(= (+ main_~i~0 (- 8)) 168)} ~j~0 := (if ~i~0 < 0 && 0 != ~i~0 % 4 then 1 + ~i~0 / 4 else ~i~0 / 4); {1479#(and (= (+ main_~i~0 (- 8)) 168) (= main_~j~0 (div main_~i~0 4)))} is VALID [2022-04-27 11:15:32,260 INFO L272 TraceCheckUtils]: 52: Hoare triple {1479#(and (= (+ main_~i~0 (- 8)) 168) (= main_~j~0 (div main_~i~0 4)))} call __VERIFIER_assert((if 4 * ~j~0 == ~i~0 then 1 else 0)); {1483#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:15:32,260 INFO L290 TraceCheckUtils]: 53: Hoare triple {1483#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1487#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:15:32,260 INFO L290 TraceCheckUtils]: 54: Hoare triple {1487#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1271#false} is VALID [2022-04-27 11:15:32,260 INFO L290 TraceCheckUtils]: 55: Hoare triple {1271#false} assume !false; {1271#false} is VALID [2022-04-27 11:15:32,261 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:15:32,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:15:33,250 INFO L290 TraceCheckUtils]: 55: Hoare triple {1271#false} assume !false; {1271#false} is VALID [2022-04-27 11:15:33,250 INFO L290 TraceCheckUtils]: 54: Hoare triple {1487#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1271#false} is VALID [2022-04-27 11:15:33,251 INFO L290 TraceCheckUtils]: 53: Hoare triple {1483#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1487#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:15:33,251 INFO L272 TraceCheckUtils]: 52: Hoare triple {1503#(= main_~i~0 (* main_~j~0 4))} call __VERIFIER_assert((if 4 * ~j~0 == ~i~0 then 1 else 0)); {1483#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:15:33,253 INFO L290 TraceCheckUtils]: 51: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} ~j~0 := (if ~i~0 < 0 && 0 != ~i~0 % 4 then 1 + ~i~0 / 4 else ~i~0 / 4); {1503#(= main_~i~0 (* main_~j~0 4))} is VALID [2022-04-27 11:15:33,254 INFO L290 TraceCheckUtils]: 50: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume !(~i~0 < ~SIZE~0); {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,254 INFO L290 TraceCheckUtils]: 49: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,254 INFO L290 TraceCheckUtils]: 48: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,255 INFO L290 TraceCheckUtils]: 47: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,255 INFO L290 TraceCheckUtils]: 46: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,256 INFO L290 TraceCheckUtils]: 45: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,256 INFO L290 TraceCheckUtils]: 44: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,257 INFO L290 TraceCheckUtils]: 43: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,257 INFO L290 TraceCheckUtils]: 42: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,257 INFO L290 TraceCheckUtils]: 41: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,258 INFO L290 TraceCheckUtils]: 40: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,258 INFO L290 TraceCheckUtils]: 39: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,258 INFO L290 TraceCheckUtils]: 38: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,259 INFO L290 TraceCheckUtils]: 37: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,271 INFO L290 TraceCheckUtils]: 36: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,272 INFO L290 TraceCheckUtils]: 35: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,272 INFO L290 TraceCheckUtils]: 34: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,273 INFO L290 TraceCheckUtils]: 33: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,273 INFO L290 TraceCheckUtils]: 32: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,274 INFO L290 TraceCheckUtils]: 31: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,274 INFO L290 TraceCheckUtils]: 30: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,275 INFO L290 TraceCheckUtils]: 29: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,275 INFO L290 TraceCheckUtils]: 28: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,275 INFO L290 TraceCheckUtils]: 27: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,276 INFO L290 TraceCheckUtils]: 26: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,276 INFO L290 TraceCheckUtils]: 25: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,277 INFO L290 TraceCheckUtils]: 23: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,277 INFO L290 TraceCheckUtils]: 22: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,278 INFO L290 TraceCheckUtils]: 21: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,279 INFO L290 TraceCheckUtils]: 20: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,279 INFO L290 TraceCheckUtils]: 19: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,280 INFO L290 TraceCheckUtils]: 18: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,284 INFO L290 TraceCheckUtils]: 17: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,287 INFO L290 TraceCheckUtils]: 15: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {1270#true} havoc ~i~0;havoc ~j~0;~i~0 := 0;~j~0 := 0; {1507#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 11:15:33,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {1270#true} call #t~ret5 := main(); {1270#true} is VALID [2022-04-27 11:15:33,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1270#true} {1270#true} #52#return; {1270#true} is VALID [2022-04-27 11:15:33,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {1270#true} assume true; {1270#true} is VALID [2022-04-27 11:15:33,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {1270#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(9, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {1270#true} is VALID [2022-04-27 11:15:33,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {1270#true} call ULTIMATE.init(); {1270#true} is VALID [2022-04-27 11:15:33,291 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-04-27 11:15:33,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724333937] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 11:15:33,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:15:33,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [26, 28] total 55 [2022-04-27 11:15:33,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860339023] [2022-04-27 11:15:33,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:15:33,292 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 56 [2022-04-27 11:15:33,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:33,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:15:33,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:33,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 11:15:33,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:33,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 11:15:33,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=2580, Unknown=0, NotChecked=0, Total=2970 [2022-04-27 11:15:33,304 INFO L87 Difference]: Start difference. First operand 57 states and 79 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:15:33,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:33,387 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2022-04-27 11:15:33,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 11:15:33,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 56 [2022-04-27 11:15:33,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:15:33,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:15:33,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-04-27 11:15:33,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:15:33,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-04-27 11:15:33,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 18 transitions. [2022-04-27 11:15:33,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:33,401 INFO L225 Difference]: With dead ends: 57 [2022-04-27 11:15:33,401 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 11:15:33,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 62 SyntacticMatches, 23 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=394, Invalid=2686, Unknown=0, NotChecked=0, Total=3080 [2022-04-27 11:15:33,403 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:15:33,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 24 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:15:33,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 11:15:33,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 11:15:33,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:15:33,404 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:15:33,404 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:15:33,404 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:15:33,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:33,404 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:15:33,404 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:15:33,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:33,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:33,405 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:15:33,405 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:15:33,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:33,405 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:15:33,405 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:15:33,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:33,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:33,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:15:33,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:15:33,405 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:15:33,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 11:15:33,405 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2022-04-27 11:15:33,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:15:33,405 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 11:15:33,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:15:33,406 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:15:33,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:33,407 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 11:15:33,423 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:15:33,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:33,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 11:15:33,702 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 7) no Hoare annotation was computed. [2022-04-27 11:15:33,703 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 7) no Hoare annotation was computed. [2022-04-27 11:15:33,703 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 7) no Hoare annotation was computed. [2022-04-27 11:15:33,704 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 9 11) no Hoare annotation was computed. [2022-04-27 11:15:33,704 INFO L899 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2022-04-27 11:15:33,706 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 11) no Hoare annotation was computed. [2022-04-27 11:15:33,707 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 9 11) no Hoare annotation was computed. [2022-04-27 11:15:33,707 INFO L895 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (or (not (<= 50000001 ~SIZE~0)) (= main_~i~0 (* main_~j~0 4))) [2022-04-27 11:15:33,707 INFO L899 garLoopResultBuilder]: For program point L32-1(line 32) no Hoare annotation was computed. [2022-04-27 11:15:33,708 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 20 34) the Hoare annotation is: true [2022-04-27 11:15:33,708 INFO L899 garLoopResultBuilder]: For program point L25(lines 25 28) no Hoare annotation was computed. [2022-04-27 11:15:33,708 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 20 34) no Hoare annotation was computed. [2022-04-27 11:15:33,708 INFO L895 garLoopResultBuilder]: At program point L25-2(lines 23 30) the Hoare annotation is: (or (not (<= 50000001 ~SIZE~0)) (= main_~i~0 (* (div main_~i~0 4) 4))) [2022-04-27 11:15:33,708 INFO L899 garLoopResultBuilder]: For program point L23-2(lines 23 30) no Hoare annotation was computed. [2022-04-27 11:15:33,708 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 20 34) no Hoare annotation was computed. [2022-04-27 11:15:33,708 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:15:33,708 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:15:33,708 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:15:33,708 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:15:33,708 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (<= 50000001 ~SIZE~0) [2022-04-27 11:15:33,708 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 11:15:33,708 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:15:33,708 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 12 17) the Hoare annotation is: true [2022-04-27 11:15:33,708 INFO L899 garLoopResultBuilder]: For program point L14(line 14) no Hoare annotation was computed. [2022-04-27 11:15:33,708 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 15) no Hoare annotation was computed. [2022-04-27 11:15:33,708 INFO L899 garLoopResultBuilder]: For program point L13-2(lines 12 17) no Hoare annotation was computed. [2022-04-27 11:15:33,708 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 12 17) no Hoare annotation was computed. [2022-04-27 11:15:33,709 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-04-27 11:15:33,711 INFO L356 BasicCegarLoop]: Path program histogram: [4, 1] [2022-04-27 11:15:33,712 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 11:15:33,728 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 11:15:33,728 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:15:33,728 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 11:15:33,729 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 11:15:33,729 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 11:15:33,729 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:15:33,729 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:15:33,729 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 11:15:33,729 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 11:15:33,729 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2022-04-27 11:15:33,729 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2022-04-27 11:15:33,729 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 11:15:33,729 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 11:15:33,729 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 11:15:33,730 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 11:15:33,730 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:15:33,730 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-27 11:15:33,730 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2022-04-27 11:15:33,730 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 11:15:33,730 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 11:15:33,730 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-27 11:15:33,730 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-27 11:15:33,730 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-27 11:15:33,730 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-04-27 11:15:33,730 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:15:33,730 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-04-27 11:15:33,730 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 11:15:33,730 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 11:15:33,730 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 11:15:33,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:15:33 BoogieIcfgContainer [2022-04-27 11:15:33,735 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 11:15:33,736 INFO L158 Benchmark]: Toolchain (without parser) took 7942.40ms. Allocated memory was 169.9MB in the beginning and 269.5MB in the end (delta: 99.6MB). Free memory was 111.7MB in the beginning and 240.3MB in the end (delta: -128.7MB). Peak memory consumption was 129.2MB. Max. memory is 8.0GB. [2022-04-27 11:15:33,736 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 169.9MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 11:15:33,736 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.30ms. Allocated memory was 169.9MB in the beginning and 224.4MB in the end (delta: 54.5MB). Free memory was 111.6MB in the beginning and 197.7MB in the end (delta: -86.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 11:15:33,737 INFO L158 Benchmark]: Boogie Preprocessor took 28.99ms. Allocated memory is still 224.4MB. Free memory was 197.1MB in the beginning and 196.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 11:15:33,737 INFO L158 Benchmark]: RCFGBuilder took 170.44ms. Allocated memory is still 224.4MB. Free memory was 195.6MB in the beginning and 184.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 11:15:33,737 INFO L158 Benchmark]: TraceAbstraction took 7541.62ms. Allocated memory was 224.4MB in the beginning and 269.5MB in the end (delta: 45.1MB). Free memory was 183.5MB in the beginning and 240.9MB in the end (delta: -57.4MB). Peak memory consumption was 146.6MB. Max. memory is 8.0GB. [2022-04-27 11:15:33,738 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.27ms. Allocated memory is still 169.9MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 197.30ms. Allocated memory was 169.9MB in the beginning and 224.4MB in the end (delta: 54.5MB). Free memory was 111.6MB in the beginning and 197.7MB in the end (delta: -86.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.99ms. Allocated memory is still 224.4MB. Free memory was 197.1MB in the beginning and 196.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 170.44ms. Allocated memory is still 224.4MB. Free memory was 195.6MB in the beginning and 184.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 7541.62ms. Allocated memory was 224.4MB in the beginning and 269.5MB in the end (delta: 45.1MB). Free memory was 183.5MB in the beginning and 240.9MB in the end (delta: -57.4MB). Peak memory consumption was 146.6MB. 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: 14]: 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, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.5s, OverallIterations: 5, TraceHistogramMax: 22, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 216 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 215 mSDsluCounter, 101 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 351 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 275 IncrementalHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 351 mSolverCounterUnsat, 56 mSDtfsCounter, 275 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 345 GetRequests, 161 SyntacticMatches, 23 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2531 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=4, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 11 PreInvPairs, 34 NumberOfFragments, 38 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 380 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 256 NumberOfCodeBlocks, 233 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 365 ConstructedInterpolants, 0 QuantifiedInterpolants, 1606 SizeOfPredicates, 7 NumberOfNonLiveVariables, 375 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 13 InterpolantComputations, 2 PerfectInterpolantSequences, 484/1803 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: 23]: Loop Invariant Derived loop invariant: !(50000001 <= SIZE) || i == i / 4 * 4 RESULT: Ultimate proved your program to be correct! [2022-04-27 11:15:33,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...