/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/loop-lit/bhmr2007.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:50:26,064 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:50:26,066 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:50:26,119 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:50:26,119 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:50:26,120 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:50:26,123 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:50:26,127 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:50:26,131 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:50:26,135 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:50:26,135 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:50:26,137 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:50:26,137 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:50:26,139 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:50:26,140 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:50:26,144 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:50:26,144 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:50:26,145 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:50:26,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:50:26,147 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:50:26,148 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:50:26,150 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:50:26,151 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:50:26,152 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:50:26,153 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:50:26,161 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:50:26,162 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:50:26,162 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:50:26,163 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:50:26,163 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:50:26,164 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:50:26,164 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:50:26,165 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:50:26,165 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:50:26,166 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:50:26,167 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:50:26,167 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:50:26,167 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:50:26,168 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:50:26,168 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:50:26,169 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:50:26,171 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:50:26,172 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 10:50:26,201 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:50:26,201 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:50:26,202 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:50:26,202 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:50:26,202 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:50:26,202 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:50:26,203 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:50:26,203 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:50:26,203 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:50:26,204 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:50:26,204 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:50:26,204 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:50:26,205 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:50:26,205 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:50:26,205 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:50:26,205 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:50:26,205 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:50:26,205 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:50:26,205 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:50:26,206 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:50:26,206 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:50:26,206 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:50:26,206 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:50:26,206 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:50:26,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:50:26,207 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:50:26,207 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:50:26,207 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:50:26,207 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:50:26,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:50:26,208 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:50:26,208 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:50:26,208 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:50:26,208 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 10:50:26,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:50:26,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:50:26,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:50:26,457 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:50:26,458 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:50:26,459 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/bhmr2007.i [2022-04-27 10:50:26,511 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2f416202/1a2dfd1cb9894c979c9e404253e1a6df/FLAG0b7e5cccb [2022-04-27 10:50:26,860 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:50:26,861 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bhmr2007.i [2022-04-27 10:50:26,866 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2f416202/1a2dfd1cb9894c979c9e404253e1a6df/FLAG0b7e5cccb [2022-04-27 10:50:27,294 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2f416202/1a2dfd1cb9894c979c9e404253e1a6df [2022-04-27 10:50:27,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:50:27,297 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:50:27,298 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:50:27,298 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:50:27,300 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:50:27,301 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:50:27" (1/1) ... [2022-04-27 10:50:27,302 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@113e2684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:50:27, skipping insertion in model container [2022-04-27 10:50:27,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:50:27" (1/1) ... [2022-04-27 10:50:27,308 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:50:27,319 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:50:27,464 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bhmr2007.i[895,908] [2022-04-27 10:50:27,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:50:27,493 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:50:27,502 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bhmr2007.i[895,908] [2022-04-27 10:50:27,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:50:27,517 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:50:27,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:50:27 WrapperNode [2022-04-27 10:50:27,518 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:50:27,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:50:27,518 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:50:27,518 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:50:27,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:50:27" (1/1) ... [2022-04-27 10:50:27,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:50:27" (1/1) ... [2022-04-27 10:50:27,532 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:50:27" (1/1) ... [2022-04-27 10:50:27,532 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:50:27" (1/1) ... [2022-04-27 10:50:27,536 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:50:27" (1/1) ... [2022-04-27 10:50:27,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:50:27" (1/1) ... [2022-04-27 10:50:27,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:50:27" (1/1) ... [2022-04-27 10:50:27,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:50:27,549 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:50:27,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:50:27,550 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:50:27,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:50:27" (1/1) ... [2022-04-27 10:50:27,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:50:27,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:50:27,578 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 10:50:27,588 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 10:50:27,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:50:27,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:50:27,611 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:50:27,611 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 10:50:27,611 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:50:27,611 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:50:27,611 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:50:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:50:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 10:50:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 10:50:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:50:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:50:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 10:50:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:50:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:50:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:50:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:50:27,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:50:27,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:50:27,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:50:27,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:50:27,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:50:27,669 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:50:27,671 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:50:27,790 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:50:27,796 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:50:27,796 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:50:27,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:50:27 BoogieIcfgContainer [2022-04-27 10:50:27,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:50:27,799 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:50:27,799 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:50:27,802 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:50:27,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:50:27" (1/3) ... [2022-04-27 10:50:27,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@611696d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:50:27, skipping insertion in model container [2022-04-27 10:50:27,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:50:27" (2/3) ... [2022-04-27 10:50:27,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@611696d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:50:27, skipping insertion in model container [2022-04-27 10:50:27,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:50:27" (3/3) ... [2022-04-27 10:50:27,805 INFO L111 eAbstractionObserver]: Analyzing ICFG bhmr2007.i [2022-04-27 10:50:27,817 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:50:27,817 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:50:27,856 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:50:27,861 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@2224d237, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@789ee6e4 [2022-04-27 10:50:27,861 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:50:27,868 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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 10:50:27,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 10:50:27,875 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:50:27,875 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:50:27,876 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:50:27,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:50:27,881 INFO L85 PathProgramCache]: Analyzing trace with hash -353995685, now seen corresponding path program 1 times [2022-04-27 10:50:27,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:50:27,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112446366] [2022-04-27 10:50:27,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:50:27,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:50:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:50:28,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:50:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:50:28,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {25#true} is VALID [2022-04-27 10:50:28,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-27 10:50:28,063 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID [2022-04-27 10:50:28,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:50:28,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {25#true} is VALID [2022-04-27 10:50:28,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-27 10:50:28,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID [2022-04-27 10:50:28,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret3 := main(); {25#true} is VALID [2022-04-27 10:50:28,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {25#true} is VALID [2022-04-27 10:50:28,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {25#true} is VALID [2022-04-27 10:50:28,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-27 10:50:28,070 INFO L272 TraceCheckUtils]: 8: Hoare triple {26#false} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {26#false} is VALID [2022-04-27 10:50:28,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-27 10:50:28,071 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-27 10:50:28,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-27 10:50:28,071 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 10:50:28,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:50:28,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112446366] [2022-04-27 10:50:28,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112446366] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:50:28,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:50:28,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:50:28,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48678898] [2022-04-27 10:50:28,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:50:28,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 10:50:28,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:50:28,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:50:28,115 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 10:50:28,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:50:28,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:50:28,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:50:28,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:50:28,147 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:50:28,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:50:28,242 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-27 10:50:28,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:50:28,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 10:50:28,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:50:28,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:50:28,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-27 10:50:28,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:50:28,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-27 10:50:28,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2022-04-27 10:50:28,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:50:28,331 INFO L225 Difference]: With dead ends: 34 [2022-04-27 10:50:28,331 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 10:50:28,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:50:28,340 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:50:28,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:50:28,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 10:50:28,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 10:50:28,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:50:28,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 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 10:50:28,373 INFO L74 IsIncluded]: Start isIncluded. First operand 15 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 10:50:28,373 INFO L87 Difference]: Start difference. First operand 15 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 10:50:28,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:50:28,378 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 10:50:28,378 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 10:50:28,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:50:28,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:50:28,379 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 15 states. [2022-04-27 10:50:28,380 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 15 states. [2022-04-27 10:50:28,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:50:28,383 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 10:50:28,383 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 10:50:28,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:50:28,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:50:28,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:50:28,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:50:28,385 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 10:50:28,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-27 10:50:28,388 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-27 10:50:28,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:50:28,389 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-27 10:50:28,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:50:28,392 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 10:50:28,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 10:50:28,397 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:50:28,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:50:28,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:50:28,398 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:50:28,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:50:28,401 INFO L85 PathProgramCache]: Analyzing trace with hash -364154416, now seen corresponding path program 1 times [2022-04-27 10:50:28,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:50:28,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249997518] [2022-04-27 10:50:28,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:50:28,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:50:28,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:50:28,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:50:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:50:28,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {138#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {128#true} is VALID [2022-04-27 10:50:28,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {128#true} assume true; {128#true} is VALID [2022-04-27 10:50:28,672 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {128#true} {128#true} #61#return; {128#true} is VALID [2022-04-27 10:50:28,673 INFO L272 TraceCheckUtils]: 0: Hoare triple {128#true} call ULTIMATE.init(); {138#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:50:28,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {138#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {128#true} is VALID [2022-04-27 10:50:28,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {128#true} assume true; {128#true} is VALID [2022-04-27 10:50:28,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128#true} {128#true} #61#return; {128#true} is VALID [2022-04-27 10:50:28,674 INFO L272 TraceCheckUtils]: 4: Hoare triple {128#true} call #t~ret3 := main(); {128#true} is VALID [2022-04-27 10:50:28,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {128#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {133#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 10:50:28,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {133#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {134#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0) (not (<= (+ (* main_~n~0 3) 1) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-27 10:50:28,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {134#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0) (not (<= (+ (* main_~n~0 3) 1) (+ main_~b~0 main_~a~0))))} assume !(~i~0 < ~n~0); {135#(and (= main_~a~0 0) (= main_~b~0 0) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)) (not (<= (+ (* main_~n~0 3) 1) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-27 10:50:28,679 INFO L272 TraceCheckUtils]: 8: Hoare triple {135#(and (= main_~a~0 0) (= main_~b~0 0) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)) (not (<= (+ (* main_~n~0 3) 1) (+ main_~b~0 main_~a~0))))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {136#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:50:28,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {136#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {137#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:50:28,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {137#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {129#false} is VALID [2022-04-27 10:50:28,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {129#false} assume !false; {129#false} is VALID [2022-04-27 10:50:28,681 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 10:50:28,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:50:28,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249997518] [2022-04-27 10:50:28,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249997518] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:50:28,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:50:28,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 10:50:28,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272150661] [2022-04-27 10:50:28,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:50:28,684 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 10:50:28,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:50:28,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:50:28,698 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 10:50:28,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:50:28,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:50:28,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:50:28,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:50:28,700 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:50:28,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:50:28,919 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-27 10:50:28,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:50:28,919 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 10:50:28,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:50:28,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:50:28,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2022-04-27 10:50:28,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:50:28,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2022-04-27 10:50:28,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 24 transitions. [2022-04-27 10:50:28,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:50:28,947 INFO L225 Difference]: With dead ends: 22 [2022-04-27 10:50:28,947 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 10:50:28,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-04-27 10:50:28,949 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:50:28,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 33 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:50:28,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 10:50:28,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-27 10:50:28,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:50:28,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states 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 10:50:28,955 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states 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 10:50:28,955 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states 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 10:50:28,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:50:28,956 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 10:50:28,957 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 10:50:28,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:50:28,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:50:28,957 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 10:50:28,958 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 10:50:28,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:50:28,959 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 10:50:28,959 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 10:50:28,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:50:28,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:50:28,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:50:28,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:50:28,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states 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 10:50:28,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-27 10:50:28,961 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2022-04-27 10:50:28,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:50:28,961 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-27 10:50:28,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:50:28,962 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-27 10:50:28,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 10:50:28,962 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:50:28,962 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:50:28,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:50:28,963 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:50:28,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:50:28,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1324408332, now seen corresponding path program 1 times [2022-04-27 10:50:28,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:50:28,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391004884] [2022-04-27 10:50:28,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:50:28,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:50:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:50:29,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:50:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:50:29,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {253#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {241#true} is VALID [2022-04-27 10:50:29,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {241#true} assume true; {241#true} is VALID [2022-04-27 10:50:29,151 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {241#true} {241#true} #61#return; {241#true} is VALID [2022-04-27 10:50:29,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {241#true} call ULTIMATE.init(); {253#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:50:29,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {253#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {241#true} is VALID [2022-04-27 10:50:29,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {241#true} assume true; {241#true} is VALID [2022-04-27 10:50:29,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {241#true} {241#true} #61#return; {241#true} is VALID [2022-04-27 10:50:29,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {241#true} call #t~ret3 := main(); {241#true} is VALID [2022-04-27 10:50:29,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {241#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {246#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 10:50:29,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {246#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {246#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 10:50:29,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {247#(and (= main_~a~0 0) (<= (+ main_~i~0 1) main_~n~0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 10:50:29,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {247#(and (= main_~a~0 0) (<= (+ main_~i~0 1) main_~n~0) (= main_~b~0 0) (= main_~i~0 0))} assume !(0 != #t~nondet2);havoc #t~nondet2;~a~0 := 2 + ~a~0;~b~0 := 1 + ~b~0; {248#(and (= main_~i~0 0) (or (<= 3 (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))) (not (<= (+ (* main_~n~0 3) 1) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-27 10:50:29,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {248#(and (= main_~i~0 0) (or (<= 3 (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))) (not (<= (+ (* main_~n~0 3) 1) (+ main_~b~0 main_~a~0))))} ~i~0 := 1 + ~i~0; {249#(and (or (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))) (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)))} is VALID [2022-04-27 10:50:29,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {249#(and (or (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))) (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)))} assume !(~i~0 < ~n~0); {250#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-27 10:50:29,158 INFO L272 TraceCheckUtils]: 11: Hoare triple {250#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {251#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:50:29,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {251#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {252#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:50:29,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {252#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {242#false} is VALID [2022-04-27 10:50:29,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {242#false} assume !false; {242#false} is VALID [2022-04-27 10:50:29,160 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 10:50:29,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:50:29,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391004884] [2022-04-27 10:50:29,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391004884] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:50:29,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504190254] [2022-04-27 10:50:29,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:50:29,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:50:29,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:50:29,163 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 10:50:29,190 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 10:50:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:50:29,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 10:50:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:50:29,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:50:29,633 INFO L272 TraceCheckUtils]: 0: Hoare triple {241#true} call ULTIMATE.init(); {241#true} is VALID [2022-04-27 10:50:29,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {241#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); {241#true} is VALID [2022-04-27 10:50:29,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {241#true} assume true; {241#true} is VALID [2022-04-27 10:50:29,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {241#true} {241#true} #61#return; {241#true} is VALID [2022-04-27 10:50:29,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {241#true} call #t~ret3 := main(); {241#true} is VALID [2022-04-27 10:50:29,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {241#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {246#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 10:50:29,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {246#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {246#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 10:50:29,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {247#(and (= main_~a~0 0) (<= (+ main_~i~0 1) main_~n~0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 10:50:29,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {247#(and (= main_~a~0 0) (<= (+ main_~i~0 1) main_~n~0) (= main_~b~0 0) (= main_~i~0 0))} assume !(0 != #t~nondet2);havoc #t~nondet2;~a~0 := 2 + ~a~0;~b~0 := 1 + ~b~0; {281#(and (= main_~b~0 1) (<= (+ main_~i~0 1) main_~n~0) (= (+ (- 2) main_~a~0) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:50:29,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {281#(and (= main_~b~0 1) (<= (+ main_~i~0 1) main_~n~0) (= (+ (- 2) main_~a~0) 0) (= main_~i~0 0))} ~i~0 := 1 + ~i~0; {285#(and (= main_~b~0 1) (<= 1 main_~n~0) (<= main_~i~0 1) (= (+ (- 2) main_~a~0) 0))} is VALID [2022-04-27 10:50:29,640 INFO L290 TraceCheckUtils]: 10: Hoare triple {285#(and (= main_~b~0 1) (<= 1 main_~n~0) (<= main_~i~0 1) (= (+ (- 2) main_~a~0) 0))} assume !(~i~0 < ~n~0); {289#(and (= main_~b~0 1) (<= 1 main_~n~0) (= (+ (- 2) main_~a~0) 0) (<= main_~n~0 1))} is VALID [2022-04-27 10:50:29,641 INFO L272 TraceCheckUtils]: 11: Hoare triple {289#(and (= main_~b~0 1) (<= 1 main_~n~0) (= (+ (- 2) main_~a~0) 0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {293#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:50:29,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {293#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {297#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:50:29,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {297#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {242#false} is VALID [2022-04-27 10:50:29,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {242#false} assume !false; {242#false} is VALID [2022-04-27 10:50:29,643 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 10:50:29,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:50:30,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {242#false} assume !false; {242#false} is VALID [2022-04-27 10:50:30,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {297#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {242#false} is VALID [2022-04-27 10:50:30,025 INFO L290 TraceCheckUtils]: 12: Hoare triple {293#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {297#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:50:30,026 INFO L272 TraceCheckUtils]: 11: Hoare triple {250#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {293#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:50:30,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {316#(or (< main_~i~0 main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} assume !(~i~0 < ~n~0); {250#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-27 10:50:30,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {320#(or (< (+ main_~i~0 1) main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} ~i~0 := 1 + ~i~0; {316#(or (< main_~i~0 main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-27 10:50:30,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {324#(or (< (+ main_~i~0 1) main_~n~0) (and (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0 3)) (< (+ main_~b~0 main_~a~0 2) (* main_~n~0 3))))} assume !(0 != #t~nondet2);havoc #t~nondet2;~a~0 := 2 + ~a~0;~b~0 := 1 + ~b~0; {320#(or (< (+ main_~i~0 1) main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-27 10:50:30,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {328#(and (<= (+ main_~i~0 1) (div (+ main_~b~0 main_~a~0 3) 3)) (<= (div (+ (* (- 1) main_~a~0) (* (- 1) main_~b~0) (- 3)) (- 3)) (+ main_~i~0 1)))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {324#(or (< (+ main_~i~0 1) main_~n~0) (and (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0 3)) (< (+ main_~b~0 main_~a~0 2) (* main_~n~0 3))))} is VALID [2022-04-27 10:50:30,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {328#(and (<= (+ main_~i~0 1) (div (+ main_~b~0 main_~a~0 3) 3)) (<= (div (+ (* (- 1) main_~a~0) (* (- 1) main_~b~0) (- 3)) (- 3)) (+ main_~i~0 1)))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {328#(and (<= (+ main_~i~0 1) (div (+ main_~b~0 main_~a~0 3) 3)) (<= (div (+ (* (- 1) main_~a~0) (* (- 1) main_~b~0) (- 3)) (- 3)) (+ main_~i~0 1)))} is VALID [2022-04-27 10:50:30,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {241#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {328#(and (<= (+ main_~i~0 1) (div (+ main_~b~0 main_~a~0 3) 3)) (<= (div (+ (* (- 1) main_~a~0) (* (- 1) main_~b~0) (- 3)) (- 3)) (+ main_~i~0 1)))} is VALID [2022-04-27 10:50:30,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {241#true} call #t~ret3 := main(); {241#true} is VALID [2022-04-27 10:50:30,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {241#true} {241#true} #61#return; {241#true} is VALID [2022-04-27 10:50:30,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {241#true} assume true; {241#true} is VALID [2022-04-27 10:50:30,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {241#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); {241#true} is VALID [2022-04-27 10:50:30,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {241#true} call ULTIMATE.init(); {241#true} is VALID [2022-04-27 10:50:30,032 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 10:50:30,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504190254] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:50:30,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:50:30,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-27 10:50:30,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679907405] [2022-04-27 10:50:30,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:50:30,036 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 10:50:30,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:50:30,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:50:30,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:50:30,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 10:50:30,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:50:30,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 10:50:30,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-04-27 10:50:30,065 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 19 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:50:30,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:50:30,919 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-04-27 10:50:30,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 10:50:30,920 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 10:50:30,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:50:30,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:50:30,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2022-04-27 10:50:30,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:50:30,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2022-04-27 10:50:30,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 37 transitions. [2022-04-27 10:50:30,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:50:30,971 INFO L225 Difference]: With dead ends: 31 [2022-04-27 10:50:30,971 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 10:50:30,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=189, Invalid=867, Unknown=0, NotChecked=0, Total=1056 [2022-04-27 10:50:30,973 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 36 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:50:30,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 57 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:50:30,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 10:50:30,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-04-27 10:50:30,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:50:30,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 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 10:50:30,983 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 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 10:50:30,983 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 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 10:50:30,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:50:30,985 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-27 10:50:30,985 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-27 10:50:30,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:50:30,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:50:30,986 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 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 25 states. [2022-04-27 10:50:30,986 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 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 25 states. [2022-04-27 10:50:30,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:50:30,987 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-27 10:50:30,987 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-27 10:50:30,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:50:30,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:50:30,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:50:30,988 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:50:30,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 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 10:50:30,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-04-27 10:50:30,989 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 15 [2022-04-27 10:50:30,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:50:30,989 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-04-27 10:50:30,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:50:30,990 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-27 10:50:30,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 10:50:30,990 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:50:30,990 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:50:31,017 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 10:50:31,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:50:31,214 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:50:31,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:50:31,215 INFO L85 PathProgramCache]: Analyzing trace with hash 921365778, now seen corresponding path program 1 times [2022-04-27 10:50:31,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:50:31,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625306033] [2022-04-27 10:50:31,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:50:31,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:50:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:50:31,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:50:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:50:31,486 INFO L290 TraceCheckUtils]: 0: Hoare triple {521#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {507#true} is VALID [2022-04-27 10:50:31,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-27 10:50:31,486 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {507#true} {507#true} #61#return; {507#true} is VALID [2022-04-27 10:50:31,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {507#true} call ULTIMATE.init(); {521#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:50:31,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {521#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {507#true} is VALID [2022-04-27 10:50:31,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-27 10:50:31,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {507#true} {507#true} #61#return; {507#true} is VALID [2022-04-27 10:50:31,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {507#true} call #t~ret3 := main(); {507#true} is VALID [2022-04-27 10:50:31,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {507#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {512#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 10:50:31,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {512#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {512#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 10:50:31,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {512#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 10:50:31,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} assume 0 != #t~nondet2;havoc #t~nondet2;~a~0 := 1 + ~a~0;~b~0 := 2 + ~b~0; {513#(and (<= (+ main_~b~0 main_~a~0) 3) (<= 3 (+ main_~b~0 main_~a~0)) (= main_~i~0 0))} is VALID [2022-04-27 10:50:31,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {513#(and (<= (+ main_~b~0 main_~a~0) 3) (<= 3 (+ main_~b~0 main_~a~0)) (= main_~i~0 0))} ~i~0 := 1 + ~i~0; {514#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} is VALID [2022-04-27 10:50:31,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {514#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {515#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0 3) (* main_~n~0 3)))} is VALID [2022-04-27 10:50:31,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {515#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0 3) (* main_~n~0 3)))} assume !(0 != #t~nondet2);havoc #t~nondet2;~a~0 := 2 + ~a~0;~b~0 := 1 + ~b~0; {516#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (or (<= (+ 3 (* main_~i~0 3)) (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-27 10:50:31,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {516#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (or (<= (+ 3 (* main_~i~0 3)) (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} ~i~0 := 1 + ~i~0; {517#(and (or (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))) (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)))} is VALID [2022-04-27 10:50:31,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {517#(and (or (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))) (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)))} assume !(~i~0 < ~n~0); {518#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-27 10:50:31,497 INFO L272 TraceCheckUtils]: 14: Hoare triple {518#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {519#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:50:31,498 INFO L290 TraceCheckUtils]: 15: Hoare triple {519#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {520#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:50:31,498 INFO L290 TraceCheckUtils]: 16: Hoare triple {520#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {508#false} is VALID [2022-04-27 10:50:31,498 INFO L290 TraceCheckUtils]: 17: Hoare triple {508#false} assume !false; {508#false} is VALID [2022-04-27 10:50:31,498 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:50:31,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:50:31,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625306033] [2022-04-27 10:50:31,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625306033] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:50:31,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421916887] [2022-04-27 10:50:31,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:50:31,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:50:31,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:50:31,504 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 10:50:31,514 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 10:50:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:50:31,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-27 10:50:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:50:31,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:50:31,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {507#true} call ULTIMATE.init(); {507#true} is VALID [2022-04-27 10:50:31,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {507#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); {507#true} is VALID [2022-04-27 10:50:31,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-27 10:50:31,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {507#true} {507#true} #61#return; {507#true} is VALID [2022-04-27 10:50:31,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {507#true} call #t~ret3 := main(); {507#true} is VALID [2022-04-27 10:50:31,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {507#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {512#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 10:50:31,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {512#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {512#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 10:50:31,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {512#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 10:50:31,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} assume 0 != #t~nondet2;havoc #t~nondet2;~a~0 := 1 + ~a~0;~b~0 := 2 + ~b~0; {549#(and (= (+ (- 1) main_~a~0) 0) (= (+ (- 2) main_~b~0) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:50:31,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {549#(and (= (+ (- 1) main_~a~0) 0) (= (+ (- 2) main_~b~0) 0) (= main_~i~0 0))} ~i~0 := 1 + ~i~0; {553#(and (= (+ (- 1) main_~a~0) 0) (= main_~i~0 1) (= (+ (- 2) main_~b~0) 0))} is VALID [2022-04-27 10:50:31,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {553#(and (= (+ (- 1) main_~a~0) 0) (= main_~i~0 1) (= (+ (- 2) main_~b~0) 0))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {557#(and (< main_~i~0 main_~n~0) (= (+ (- 1) main_~a~0) 0) (= main_~i~0 1) (= (+ (- 2) main_~b~0) 0))} is VALID [2022-04-27 10:50:31,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {557#(and (< main_~i~0 main_~n~0) (= (+ (- 1) main_~a~0) 0) (= main_~i~0 1) (= (+ (- 2) main_~b~0) 0))} assume !(0 != #t~nondet2);havoc #t~nondet2;~a~0 := 2 + ~a~0;~b~0 := 1 + ~b~0; {561#(and (= main_~b~0 3) (< main_~i~0 main_~n~0) (= main_~i~0 1) (= main_~a~0 3))} is VALID [2022-04-27 10:50:31,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {561#(and (= main_~b~0 3) (< main_~i~0 main_~n~0) (= main_~i~0 1) (= main_~a~0 3))} ~i~0 := 1 + ~i~0; {565#(and (= main_~b~0 3) (< 1 main_~n~0) (= main_~a~0 3) (<= main_~i~0 2))} is VALID [2022-04-27 10:50:31,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {565#(and (= main_~b~0 3) (< 1 main_~n~0) (= main_~a~0 3) (<= main_~i~0 2))} assume !(~i~0 < ~n~0); {569#(and (<= main_~n~0 2) (= main_~b~0 3) (< 1 main_~n~0) (= main_~a~0 3))} is VALID [2022-04-27 10:50:31,947 INFO L272 TraceCheckUtils]: 14: Hoare triple {569#(and (<= main_~n~0 2) (= main_~b~0 3) (< 1 main_~n~0) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {573#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:50:31,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {573#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {577#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:50:31,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {577#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {508#false} is VALID [2022-04-27 10:50:31,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {508#false} assume !false; {508#false} is VALID [2022-04-27 10:50:31,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:50:31,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:50:32,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {508#false} assume !false; {508#false} is VALID [2022-04-27 10:50:32,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {577#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {508#false} is VALID [2022-04-27 10:50:32,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {573#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {577#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:50:32,314 INFO L272 TraceCheckUtils]: 14: Hoare triple {518#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {573#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:50:32,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {596#(or (< main_~i~0 main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} assume !(~i~0 < ~n~0); {518#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-27 10:50:32,315 INFO L290 TraceCheckUtils]: 12: Hoare triple {600#(or (< (+ main_~i~0 1) main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} ~i~0 := 1 + ~i~0; {596#(or (< main_~i~0 main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-27 10:50:32,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {604#(or (< (+ main_~i~0 1) main_~n~0) (and (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0 3)) (< (+ main_~b~0 main_~a~0 2) (* main_~n~0 3))))} assume !(0 != #t~nondet2);havoc #t~nondet2;~a~0 := 2 + ~a~0;~b~0 := 1 + ~b~0; {600#(or (< (+ main_~i~0 1) main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-27 10:50:32,317 INFO L290 TraceCheckUtils]: 10: Hoare triple {514#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {604#(or (< (+ main_~i~0 1) main_~n~0) (and (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0 3)) (< (+ main_~b~0 main_~a~0 2) (* main_~n~0 3))))} is VALID [2022-04-27 10:50:32,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {611#(and (<= (+ main_~b~0 main_~a~0) (+ 3 (* main_~i~0 3))) (<= (+ 3 (* main_~i~0 3)) (+ main_~b~0 main_~a~0)))} ~i~0 := 1 + ~i~0; {514#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} is VALID [2022-04-27 10:50:32,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {514#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} assume 0 != #t~nondet2;havoc #t~nondet2;~a~0 := 1 + ~a~0;~b~0 := 2 + ~b~0; {611#(and (<= (+ main_~b~0 main_~a~0) (+ 3 (* main_~i~0 3))) (<= (+ 3 (* main_~i~0 3)) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-27 10:50:32,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {514#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {514#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} is VALID [2022-04-27 10:50:32,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {514#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {514#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} is VALID [2022-04-27 10:50:32,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {507#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {514#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} is VALID [2022-04-27 10:50:32,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {507#true} call #t~ret3 := main(); {507#true} is VALID [2022-04-27 10:50:32,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {507#true} {507#true} #61#return; {507#true} is VALID [2022-04-27 10:50:32,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-27 10:50:32,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {507#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); {507#true} is VALID [2022-04-27 10:50:32,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {507#true} call ULTIMATE.init(); {507#true} is VALID [2022-04-27 10:50:32,320 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:50:32,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421916887] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:50:32,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:50:32,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 24 [2022-04-27 10:50:32,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248618358] [2022-04-27 10:50:32,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:50:32,321 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 10:50:32,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:50:32,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:50:32,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:50:32,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-27 10:50:32,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:50:32,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-27 10:50:32,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2022-04-27 10:50:32,361 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:50:33,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:50:33,248 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-27 10:50:33,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-27 10:50:33,248 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 10:50:33,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:50:33,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:50:33,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. [2022-04-27 10:50:33,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:50:33,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. [2022-04-27 10:50:33,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 30 transitions. [2022-04-27 10:50:33,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:50:33,282 INFO L225 Difference]: With dead ends: 29 [2022-04-27 10:50:33,282 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:50:33,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=244, Invalid=1396, Unknown=0, NotChecked=0, Total=1640 [2022-04-27 10:50:33,284 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 16 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:50:33,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 80 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:50:33,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:50:33,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:50:33,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:50:33,285 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 10:50:33,285 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 10:50:33,285 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 10:50:33,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:50:33,285 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:50:33,285 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:50:33,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:50:33,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:50:33,286 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 10:50:33,286 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 10:50:33,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:50:33,286 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:50:33,286 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:50:33,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:50:33,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:50:33,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:50:33,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:50:33,286 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 10:50:33,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:50:33,287 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-04-27 10:50:33,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:50:33,287 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:50:33,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:50:33,287 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:50:33,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:50:33,289 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:50:33,315 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 10:50:33,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 10:50:33,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:50:33,606 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-27 10:50:33,606 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-27 10:50:33,607 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-27 10:50:33,607 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-27 10:50:33,607 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:50:33,607 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:50:33,607 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:50:33,607 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 40) the Hoare annotation is: true [2022-04-27 10:50:33,607 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 35) no Hoare annotation was computed. [2022-04-27 10:50:33,607 INFO L899 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2022-04-27 10:50:33,607 INFO L899 garLoopResultBuilder]: For program point L29-2(lines 29 35) no Hoare annotation was computed. [2022-04-27 10:50:33,607 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 28 37) the Hoare annotation is: (let ((.cse1 (+ main_~b~0 main_~a~0)) (.cse0 (* main_~i~0 3))) (and (<= .cse0 .cse1) (< .cse1 (+ (* main_~n~0 3) 1)) (<= .cse1 .cse0))) [2022-04-27 10:50:33,608 INFO L895 garLoopResultBuilder]: At program point L28-3(lines 28 37) the Hoare annotation is: (let ((.cse1 (* main_~n~0 3)) (.cse0 (+ main_~b~0 main_~a~0))) (and (< .cse0 (+ .cse1 1)) (<= .cse1 .cse0))) [2022-04-27 10:50:33,608 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 24 40) no Hoare annotation was computed. [2022-04-27 10:50:33,608 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 24 40) no Hoare annotation was computed. [2022-04-27 10:50:33,608 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2022-04-27 10:50:33,608 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:50:33,608 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 10:50:33,608 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:50:33,608 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:50:33,608 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:50:33,608 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:50:33,608 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:50:33,608 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-27 10:50:33,608 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-27 10:50:33,609 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-27 10:50:33,609 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-27 10:50:33,609 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-27 10:50:33,609 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-27 10:50:33,611 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-04-27 10:50:33,613 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:50:33,616 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:50:33,616 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:50:33,617 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:50:33,617 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 10:50:33,617 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-27 10:50:33,617 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:50:33,618 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-27 10:50:33,618 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:50:33,618 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:50:33,618 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:50:33,618 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:50:33,618 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-27 10:50:33,618 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-27 10:50:33,618 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:50:33,618 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:50:33,618 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:50:33,618 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:50:33,618 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 10:50:33,618 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:50:33,622 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 10:50:33,622 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:50:33,622 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:50:33,622 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 10:50:33,622 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:50:33,623 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 10:50:33,623 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 10:50:33,623 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 10:50:33,623 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:50:33,623 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 10:50:33,623 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2022-04-27 10:50:33,623 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 10:50:33,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:50:33 BoogieIcfgContainer [2022-04-27 10:50:33,630 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:50:33,631 INFO L158 Benchmark]: Toolchain (without parser) took 6334.65ms. Allocated memory was 200.3MB in the beginning and 245.4MB in the end (delta: 45.1MB). Free memory was 148.1MB in the beginning and 136.4MB in the end (delta: 11.6MB). Peak memory consumption was 57.4MB. Max. memory is 8.0GB. [2022-04-27 10:50:33,632 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 200.3MB. Free memory was 164.6MB in the beginning and 164.4MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:50:33,632 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.14ms. Allocated memory is still 200.3MB. Free memory was 147.9MB in the beginning and 175.4MB in the end (delta: -27.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 10:50:33,632 INFO L158 Benchmark]: Boogie Preprocessor took 30.51ms. Allocated memory is still 200.3MB. Free memory was 175.4MB in the beginning and 173.6MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 10:50:33,632 INFO L158 Benchmark]: RCFGBuilder took 248.50ms. Allocated memory is still 200.3MB. Free memory was 173.6MB in the beginning and 162.9MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 10:50:33,633 INFO L158 Benchmark]: TraceAbstraction took 5831.04ms. Allocated memory was 200.3MB in the beginning and 245.4MB in the end (delta: 45.1MB). Free memory was 162.1MB in the beginning and 136.4MB in the end (delta: 25.7MB). Peak memory consumption was 72.1MB. Max. memory is 8.0GB. [2022-04-27 10:50:33,633 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.35ms. Allocated memory is still 200.3MB. Free memory was 164.6MB in the beginning and 164.4MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 220.14ms. Allocated memory is still 200.3MB. Free memory was 147.9MB in the beginning and 175.4MB in the end (delta: -27.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.51ms. Allocated memory is still 200.3MB. Free memory was 175.4MB in the beginning and 173.6MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 248.50ms. Allocated memory is still 200.3MB. Free memory was 173.6MB in the beginning and 162.9MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5831.04ms. Allocated memory was 200.3MB in the beginning and 245.4MB in the end (delta: 45.1MB). Free memory was 162.1MB in the beginning and 136.4MB in the end (delta: 25.7MB). Peak memory consumption was 72.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: 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, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 87 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 86 mSDsluCounter, 196 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 144 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 413 IncrementalHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 52 mSDtfsCounter, 413 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 48, 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, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 12 PreInvPairs, 22 NumberOfFragments, 52 HoareAnnotationTreeSize, 12 FomulaSimplifications, 10 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 337 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 115 ConstructedInterpolants, 0 QuantifiedInterpolants, 920 SizeOfPredicates, 6 NumberOfNonLiveVariables, 146 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 1/18 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: 28]: Loop Invariant Derived loop invariant: (i * 3 <= b + a && b + a < n * 3 + 1) && b + a <= i * 3 RESULT: Ultimate proved your program to be correct! [2022-04-27 10:50:33,667 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...