/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-zilu/benchmark09_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:43:55,056 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:43:55,057 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:43:55,110 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:43:55,110 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:43:55,111 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:43:55,118 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:43:55,120 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:43:55,121 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:43:55,128 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:43:55,128 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:43:55,129 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:43:55,129 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:43:55,131 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:43:55,132 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:43:55,133 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:43:55,133 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:43:55,133 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:43:55,137 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:43:55,139 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:43:55,140 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:43:55,142 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:43:55,143 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:43:55,143 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:43:55,144 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:43:55,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:43:55,148 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:43:55,148 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:43:55,151 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:43:55,151 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:43:55,152 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:43:55,152 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:43:55,152 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:43:55,153 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:43:55,153 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:43:55,154 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:43:55,154 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:43:55,154 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:43:55,154 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:43:55,154 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:43:55,155 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:43:55,155 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:43:55,156 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 11:43:55,170 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:43:55,170 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:43:55,170 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:43:55,170 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:43:55,170 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:43:55,171 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:43:55,176 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:43:55,176 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:43:55,176 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:43:55,177 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:43:55,177 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:43:55,177 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:43:55,177 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:43:55,178 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:43:55,178 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:43:55,178 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:43:55,178 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:43:55,179 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:43:55,179 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:43:55,179 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:43:55,179 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:43:55,179 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:43:55,179 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:43:55,180 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:43:55,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:43:55,180 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:43:55,180 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:43:55,180 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:43:55,180 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:43:55,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:43:55,180 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:43:55,180 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:43:55,180 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:43:55,180 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 11:43:55,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:43:55,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:43:55,381 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:43:55,382 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:43:55,383 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:43:55,384 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark09_conjunctive.i [2022-04-27 11:43:55,422 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23c163054/277baa48a98e44d191fa2ca334f7f81c/FLAG8a7ae5906 [2022-04-27 11:43:55,762 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:43:55,763 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark09_conjunctive.i [2022-04-27 11:43:55,766 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23c163054/277baa48a98e44d191fa2ca334f7f81c/FLAG8a7ae5906 [2022-04-27 11:43:56,199 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23c163054/277baa48a98e44d191fa2ca334f7f81c [2022-04-27 11:43:56,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:43:56,202 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:43:56,204 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:43:56,204 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:43:56,206 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:43:56,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:43:56" (1/1) ... [2022-04-27 11:43:56,207 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a9b2d78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:43:56, skipping insertion in model container [2022-04-27 11:43:56,207 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:43:56" (1/1) ... [2022-04-27 11:43:56,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:43:56,219 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:43:56,341 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-zilu/benchmark09_conjunctive.i[873,886] [2022-04-27 11:43:56,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:43:56,361 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:43:56,373 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-zilu/benchmark09_conjunctive.i[873,886] [2022-04-27 11:43:56,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:43:56,387 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:43:56,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:43:56 WrapperNode [2022-04-27 11:43:56,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:43:56,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:43:56,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:43:56,388 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:43:56,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:43:56" (1/1) ... [2022-04-27 11:43:56,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:43:56" (1/1) ... [2022-04-27 11:43:56,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:43:56" (1/1) ... [2022-04-27 11:43:56,400 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:43:56" (1/1) ... [2022-04-27 11:43:56,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:43:56" (1/1) ... [2022-04-27 11:43:56,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:43:56" (1/1) ... [2022-04-27 11:43:56,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:43:56" (1/1) ... [2022-04-27 11:43:56,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:43:56,420 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:43:56,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:43:56,421 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:43:56,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:43:56" (1/1) ... [2022-04-27 11:43:56,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:43:56,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:43:56,485 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 11:43:56,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 11:43:56,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:43:56,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:43:56,522 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:43:56,522 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:43:56,524 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:43:56,524 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:43:56,524 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 11:43:56,524 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 11:43:56,524 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:43:56,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:43:56,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 11:43:56,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-27 11:43:56,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:43:56,524 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:43:56,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:43:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:43:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:43:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:43:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:43:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:43:56,576 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:43:56,577 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:43:56,711 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:43:56,715 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:43:56,716 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 11:43:56,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:43:56 BoogieIcfgContainer [2022-04-27 11:43:56,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:43:56,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:43:56,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:43:56,721 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:43:56,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:43:56" (1/3) ... [2022-04-27 11:43:56,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf49b03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:43:56, skipping insertion in model container [2022-04-27 11:43:56,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:43:56" (2/3) ... [2022-04-27 11:43:56,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf49b03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:43:56, skipping insertion in model container [2022-04-27 11:43:56,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:43:56" (3/3) ... [2022-04-27 11:43:56,723 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark09_conjunctive.i [2022-04-27 11:43:56,732 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:43:56,732 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:43:56,763 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:43:56,767 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@782ffec, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2b9c3b25 [2022-04-27 11:43:56,767 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:43:56,774 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:43:56,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 11:43:56,779 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:43:56,779 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:43:56,780 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:43:56,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:43:56,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1360020621, now seen corresponding path program 1 times [2022-04-27 11:43:56,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:43:56,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563808490] [2022-04-27 11:43:56,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:43:56,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:43:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:43:57,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:43:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:43:57,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(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(26, 2); {24#true} is VALID [2022-04-27 11:43:57,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-27 11:43:57,028 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #50#return; {24#true} is VALID [2022-04-27 11:43:57,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:43:57,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(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(26, 2); {24#true} is VALID [2022-04-27 11:43:57,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-27 11:43:57,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #50#return; {24#true} is VALID [2022-04-27 11:43:57,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret5 := main(); {24#true} is VALID [2022-04-27 11:43:57,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2; {24#true} is VALID [2022-04-27 11:43:57,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !!(~x~0 == ~y~0 && ~y~0 >= 0); {29#(and (or (<= main_~y~0 0) (<= main_~y~0 main_~x~0)) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 11:43:57,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#(and (or (<= main_~y~0 0) (<= main_~y~0 main_~x~0)) (< 0 (+ main_~y~0 1)))} assume !(0 != ~x~0); {30#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 11:43:57,032 INFO L272 TraceCheckUtils]: 8: Hoare triple {30#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {31#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:43:57,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {32#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:43:57,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {25#false} is VALID [2022-04-27 11:43:57,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-27 11:43:57,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:43:57,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:43:57,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563808490] [2022-04-27 11:43:57,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563808490] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:43:57,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:43:57,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 11:43:57,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507082405] [2022-04-27 11:43:57,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:43:57,040 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 11:43:57,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:43:57,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:43:57,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:43:57,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 11:43:57,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:43:57,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 11:43:57,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 11:43:57,078 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:43:57,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:43:57,392 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-27 11:43:57,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 11:43:57,392 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 11:43:57,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:43:57,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:43:57,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2022-04-27 11:43:57,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:43:57,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2022-04-27 11:43:57,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 51 transitions. [2022-04-27 11:43:57,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:43:57,450 INFO L225 Difference]: With dead ends: 42 [2022-04-27 11:43:57,450 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 11:43:57,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-27 11:43:57,458 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:43:57,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 47 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:43:57,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 11:43:57,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 11:43:57,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:43:57,482 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 11:43:57,482 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 11:43:57,482 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 11:43:57,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:43:57,489 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 11:43:57,489 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 11:43:57,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:43:57,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:43:57,490 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 11:43:57,490 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 11:43:57,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:43:57,498 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 11:43:57,498 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 11:43:57,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:43:57,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:43:57,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:43:57,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:43:57,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:43:57,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-27 11:43:57,502 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-27 11:43:57,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:43:57,502 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-27 11:43:57,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:43:57,505 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 11:43:57,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 11:43:57,508 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:43:57,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:43:57,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:43:57,509 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:43:57,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:43:57,509 INFO L85 PathProgramCache]: Analyzing trace with hash 824422544, now seen corresponding path program 1 times [2022-04-27 11:43:57,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:43:57,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168623159] [2022-04-27 11:43:57,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:43:57,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:43:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:43:57,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:43:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:43:57,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {160#(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(26, 2); {153#true} is VALID [2022-04-27 11:43:57,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {153#true} assume true; {153#true} is VALID [2022-04-27 11:43:57,584 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {153#true} {153#true} #50#return; {153#true} is VALID [2022-04-27 11:43:57,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {153#true} call ULTIMATE.init(); {160#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:43:57,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {160#(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(26, 2); {153#true} is VALID [2022-04-27 11:43:57,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {153#true} assume true; {153#true} is VALID [2022-04-27 11:43:57,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {153#true} {153#true} #50#return; {153#true} is VALID [2022-04-27 11:43:57,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {153#true} call #t~ret5 := main(); {153#true} is VALID [2022-04-27 11:43:57,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {153#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2; {153#true} is VALID [2022-04-27 11:43:57,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {153#true} assume !!(~x~0 == ~y~0 && ~y~0 >= 0); {158#(and (or (<= main_~x~0 main_~y~0) (<= main_~x~0 0)) (< 0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:43:57,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {158#(and (or (<= main_~x~0 main_~y~0) (<= main_~x~0 0)) (< 0 (+ main_~x~0 1)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {159#(and (<= 0 main_~y~0) (<= 0 main_~x~0))} is VALID [2022-04-27 11:43:57,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {159#(and (<= 0 main_~y~0) (<= 0 main_~x~0))} assume ~x~0 < 0 || ~y~0 < 0; {154#false} is VALID [2022-04-27 11:43:57,588 INFO L272 TraceCheckUtils]: 9: Hoare triple {154#false} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {154#false} is VALID [2022-04-27 11:43:57,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {154#false} ~cond := #in~cond; {154#false} is VALID [2022-04-27 11:43:57,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {154#false} assume 0 == ~cond; {154#false} is VALID [2022-04-27 11:43:57,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {154#false} assume !false; {154#false} is VALID [2022-04-27 11:43:57,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:43:57,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:43:57,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168623159] [2022-04-27 11:43:57,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168623159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:43:57,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:43:57,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 11:43:57,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014540454] [2022-04-27 11:43:57,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:43:57,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 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 13 [2022-04-27 11:43:57,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:43:57,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:43:57,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:43:57,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:43:57,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:43:57,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:43:57,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:43:57,601 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:43:57,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:43:57,704 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-27 11:43:57,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 11:43:57,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 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 13 [2022-04-27 11:43:57,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:43:57,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:43:57,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-04-27 11:43:57,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:43:57,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-04-27 11:43:57,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 19 transitions. [2022-04-27 11:43:57,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:43:57,724 INFO L225 Difference]: With dead ends: 20 [2022-04-27 11:43:57,724 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 11:43:57,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-27 11:43:57,729 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:43:57,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 23 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:43:57,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 11:43:57,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 11:43:57,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:43:57,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:43:57,741 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:43:57,741 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:43:57,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:43:57,742 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 11:43:57,742 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 11:43:57,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:43:57,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:43:57,743 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 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 11:43:57,744 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 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 11:43:57,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:43:57,745 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 11:43:57,745 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 11:43:57,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:43:57,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:43:57,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:43:57,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:43:57,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:43:57,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-27 11:43:57,747 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-27 11:43:57,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:43:57,748 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-27 11:43:57,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:43:57,749 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 11:43:57,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 11:43:57,749 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:43:57,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:43:57,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 11:43:57,750 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:43:57,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:43:57,751 INFO L85 PathProgramCache]: Analyzing trace with hash -181933682, now seen corresponding path program 1 times [2022-04-27 11:43:57,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:43:57,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133835834] [2022-04-27 11:43:57,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:43:57,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:43:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:43:57,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:43:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:43:57,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {259#(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(26, 2); {248#true} is VALID [2022-04-27 11:43:57,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {248#true} assume true; {248#true} is VALID [2022-04-27 11:43:57,887 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {248#true} {248#true} #50#return; {248#true} is VALID [2022-04-27 11:43:57,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {248#true} call ULTIMATE.init(); {259#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:43:57,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {259#(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(26, 2); {248#true} is VALID [2022-04-27 11:43:57,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {248#true} assume true; {248#true} is VALID [2022-04-27 11:43:57,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {248#true} {248#true} #50#return; {248#true} is VALID [2022-04-27 11:43:57,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {248#true} call #t~ret5 := main(); {248#true} is VALID [2022-04-27 11:43:57,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {248#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2; {248#true} is VALID [2022-04-27 11:43:57,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {248#true} assume !!(~x~0 == ~y~0 && ~y~0 >= 0); {253#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 11:43:57,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {253#(<= main_~y~0 main_~x~0)} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {254#(or (<= main_~y~0 0) (<= main_~y~0 main_~x~0))} is VALID [2022-04-27 11:43:57,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {254#(or (<= main_~y~0 0) (<= main_~y~0 main_~x~0))} assume !(~x~0 < 0 || ~y~0 < 0); {255#(and (or (<= main_~y~0 0) (<= main_~y~0 main_~x~0)) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 11:43:57,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {255#(and (or (<= main_~y~0 0) (<= main_~y~0 main_~x~0)) (< 0 (+ main_~y~0 1)))} assume !(0 != ~x~0); {256#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 11:43:57,892 INFO L272 TraceCheckUtils]: 10: Hoare triple {256#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {257#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:43:57,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {257#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {258#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:43:57,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {258#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {249#false} is VALID [2022-04-27 11:43:57,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {249#false} assume !false; {249#false} is VALID [2022-04-27 11:43:57,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:43:57,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:43:57,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133835834] [2022-04-27 11:43:57,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133835834] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:43:57,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202030379] [2022-04-27 11:43:57,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:43:57,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:43:57,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:43:57,899 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:43:57,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 11:43:57,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:43:57,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 11:43:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:43:57,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:43:58,147 INFO L272 TraceCheckUtils]: 0: Hoare triple {248#true} call ULTIMATE.init(); {248#true} is VALID [2022-04-27 11:43:58,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {248#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(26, 2); {248#true} is VALID [2022-04-27 11:43:58,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {248#true} assume true; {248#true} is VALID [2022-04-27 11:43:58,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {248#true} {248#true} #50#return; {248#true} is VALID [2022-04-27 11:43:58,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {248#true} call #t~ret5 := main(); {248#true} is VALID [2022-04-27 11:43:58,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {248#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2; {248#true} is VALID [2022-04-27 11:43:58,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {248#true} assume !!(~x~0 == ~y~0 && ~y~0 >= 0); {253#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 11:43:58,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {253#(<= main_~y~0 main_~x~0)} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {253#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 11:43:58,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {253#(<= main_~y~0 main_~x~0)} assume !(~x~0 < 0 || ~y~0 < 0); {287#(and (not (< main_~y~0 0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-27 11:43:58,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {287#(and (not (< main_~y~0 0)) (<= main_~y~0 main_~x~0))} assume !(0 != ~x~0); {256#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 11:43:58,150 INFO L272 TraceCheckUtils]: 10: Hoare triple {256#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {294#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:43:58,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {294#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {298#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:43:58,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {298#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {249#false} is VALID [2022-04-27 11:43:58,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {249#false} assume !false; {249#false} is VALID [2022-04-27 11:43:58,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:43:58,151 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 11:43:58,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202030379] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:43:58,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 11:43:58,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2022-04-27 11:43:58,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247692988] [2022-04-27 11:43:58,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:43:58,152 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 11:43:58,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:43:58,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:43:58,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:43:58,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 11:43:58,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:43:58,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 11:43:58,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 11:43:58,165 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:43:58,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:43:58,231 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 11:43:58,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 11:43:58,231 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 11:43:58,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:43:58,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:43:58,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 14 transitions. [2022-04-27 11:43:58,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:43:58,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 14 transitions. [2022-04-27 11:43:58,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 14 transitions. [2022-04-27 11:43:58,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:43:58,241 INFO L225 Difference]: With dead ends: 15 [2022-04-27 11:43:58,242 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 11:43:58,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-27 11:43:58,242 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:43:58,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 32 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:43:58,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 11:43:58,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 11:43:58,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:43:58,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:43:58,244 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:43:58,244 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:43:58,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:43:58,244 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:43:58,244 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:43:58,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:43:58,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:43:58,244 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 11:43:58,244 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 11:43:58,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:43:58,244 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:43:58,244 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:43:58,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:43:58,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:43:58,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:43:58,245 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:43:58,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:43:58,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 11:43:58,245 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-27 11:43:58,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:43:58,245 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 11:43:58,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:43:58,245 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:43:58,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:43:58,247 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 11:43:58,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 11:43:58,460 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 11:43:58,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 11:43:58,509 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 11) no Hoare annotation was computed. [2022-04-27 11:43:58,510 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 11) no Hoare annotation was computed. [2022-04-27 11:43:58,510 INFO L899 garLoopResultBuilder]: For program point L11-1(line 11) no Hoare annotation was computed. [2022-04-27 11:43:58,510 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 19 30) the Hoare annotation is: true [2022-04-27 11:43:58,510 INFO L899 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2022-04-27 11:43:58,510 INFO L899 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2022-04-27 11:43:58,510 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 19 30) no Hoare annotation was computed. [2022-04-27 11:43:58,510 INFO L899 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2022-04-27 11:43:58,510 INFO L895 garLoopResultBuilder]: At program point L23-2(lines 23 27) the Hoare annotation is: (and (<= main_~x~0 main_~y~0) (< 0 (+ main_~x~0 1)) (<= main_~y~0 main_~x~0)) [2022-04-27 11:43:58,510 INFO L895 garLoopResultBuilder]: At program point L23-3(lines 23 27) the Hoare annotation is: (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))) [2022-04-27 11:43:58,511 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 19 30) no Hoare annotation was computed. [2022-04-27 11:43:58,511 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:43:58,511 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 11:43:58,511 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:43:58,511 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:43:58,511 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 11:43:58,511 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 11:43:58,511 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:43:58,511 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-27 11:43:58,511 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-04-27 11:43:58,511 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2022-04-27 11:43:58,511 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 18) no Hoare annotation was computed. [2022-04-27 11:43:58,511 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 18) no Hoare annotation was computed. [2022-04-27 11:43:58,512 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-04-27 11:43:58,514 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 11:43:58,515 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 11:43:58,517 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 11:43:58,517 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 11:43:58,518 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:43:58,518 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-27 11:43:58,518 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 11:43:58,518 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2022-04-27 11:43:58,518 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:43:58,518 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:43:58,518 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-27 11:43:58,518 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-27 11:43:58,519 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 11:43:58,519 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 11:43:58,519 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 11:43:58,519 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:43:58,519 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 11:43:58,521 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 11:43:58,522 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 11:43:58,522 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 11:43:58,522 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 11:43:58,522 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 11:43:58,522 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 11:43:58,522 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 11:43:58,522 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 11:43:58,522 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:43:58,522 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 11:43:58,522 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 11:43:58,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:43:58 BoogieIcfgContainer [2022-04-27 11:43:58,528 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 11:43:58,528 INFO L158 Benchmark]: Toolchain (without parser) took 2326.40ms. Allocated memory was 194.0MB in the beginning and 253.8MB in the end (delta: 59.8MB). Free memory was 141.7MB in the beginning and 88.9MB in the end (delta: 52.8MB). Peak memory consumption was 111.5MB. Max. memory is 8.0GB. [2022-04-27 11:43:58,529 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 194.0MB. Free memory is still 157.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 11:43:58,529 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.96ms. Allocated memory was 194.0MB in the beginning and 253.8MB in the end (delta: 59.8MB). Free memory was 141.4MB in the beginning and 228.4MB in the end (delta: -86.9MB). Peak memory consumption was 6.8MB. Max. memory is 8.0GB. [2022-04-27 11:43:58,529 INFO L158 Benchmark]: Boogie Preprocessor took 31.60ms. Allocated memory is still 253.8MB. Free memory was 228.4MB in the beginning and 227.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 11:43:58,529 INFO L158 Benchmark]: RCFGBuilder took 296.64ms. Allocated memory is still 253.8MB. Free memory was 227.3MB in the beginning and 214.7MB in the end (delta: 12.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 11:43:58,529 INFO L158 Benchmark]: TraceAbstraction took 1809.42ms. Allocated memory is still 253.8MB. Free memory was 214.2MB in the beginning and 88.9MB in the end (delta: 125.3MB). Peak memory consumption was 124.8MB. Max. memory is 8.0GB. [2022-04-27 11:43:58,530 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.10ms. Allocated memory is still 194.0MB. Free memory is still 157.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 183.96ms. Allocated memory was 194.0MB in the beginning and 253.8MB in the end (delta: 59.8MB). Free memory was 141.4MB in the beginning and 228.4MB in the end (delta: -86.9MB). Peak memory consumption was 6.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.60ms. Allocated memory is still 253.8MB. Free memory was 228.4MB in the beginning and 227.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 296.64ms. Allocated memory is still 253.8MB. Free memory was 227.3MB in the beginning and 214.7MB in the end (delta: 12.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1809.42ms. Allocated memory is still 253.8MB. Free memory was 214.2MB in the beginning and 88.9MB in the end (delta: 125.3MB). Peak memory consumption was 124.8MB. 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: 16]: 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 5 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 102 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 63 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 117 IncrementalHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 39 mSDtfsCounter, 117 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 19, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 13 NumberOfFragments, 32 HoareAnnotationTreeSize, 10 FomulaSimplifications, 13 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 41 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 49 ConstructedInterpolants, 0 QuantifiedInterpolants, 168 SizeOfPredicates, 2 NumberOfNonLiveVariables, 64 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (x <= y && 0 < x + 1) && y <= x RESULT: Ultimate proved your program to be correct! [2022-04-27 11:43:58,557 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...