/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-98707888a4ba860d5b57d27ee0e051c5b948cbbf-9870788 [2021-06-01 16:29:12,522 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-01 16:29:12,523 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-01 16:29:12,541 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-01 16:29:12,541 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-01 16:29:12,542 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-01 16:29:12,543 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-01 16:29:12,544 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-01 16:29:12,545 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-01 16:29:12,546 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-01 16:29:12,546 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-01 16:29:12,547 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-01 16:29:12,547 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-01 16:29:12,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-01 16:29:12,549 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-01 16:29:12,549 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-01 16:29:12,550 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-01 16:29:12,550 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-01 16:29:12,551 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-01 16:29:12,552 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-01 16:29:12,553 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-01 16:29:12,554 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-01 16:29:12,555 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-01 16:29:12,555 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-01 16:29:12,557 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-01 16:29:12,557 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-01 16:29:12,557 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-01 16:29:12,557 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-01 16:29:12,558 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-01 16:29:12,558 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-01 16:29:12,558 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-01 16:29:12,559 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-01 16:29:12,559 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-01 16:29:12,560 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-01 16:29:12,560 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-01 16:29:12,560 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-01 16:29:12,561 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-01 16:29:12,561 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-01 16:29:12,561 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-01 16:29:12,562 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-01 16:29:12,562 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-01 16:29:12,563 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-06-01 16:29:12,577 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-01 16:29:12,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-01 16:29:12,577 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-01 16:29:12,577 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-01 16:29:12,578 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-01 16:29:12,578 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-01 16:29:12,578 INFO L138 SettingsManager]: * Use SBE=true [2021-06-01 16:29:12,578 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-01 16:29:12,579 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-01 16:29:12,579 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-01 16:29:12,579 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-01 16:29:12,579 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-01 16:29:12,579 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-01 16:29:12,579 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-01 16:29:12,579 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-01 16:29:12,579 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-01 16:29:12,579 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-01 16:29:12,579 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-01 16:29:12,579 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-01 16:29:12,580 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-01 16:29:12,580 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-01 16:29:12,580 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-01 16:29:12,580 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-01 16:29:12,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-01 16:29:12,580 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-01 16:29:12,580 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-01 16:29:12,580 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-01 16:29:12,580 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-01 16:29:12,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-01 16:29:12,580 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-01 16:29:12,580 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-01 16:29:12,581 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 [2021-06-01 16:29:12,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-01 16:29:12,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-01 16:29:12,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-01 16:29:12,805 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-01 16:29:12,806 INFO L275 PluginConnector]: CDTParser initialized [2021-06-01 16:29:12,807 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc.i [2021-06-01 16:29:12,859 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7764e25a9/ace63b2440694700af228aafcabbfe87/FLAGda9b7adfe [2021-06-01 16:29:13,287 INFO L306 CDTParser]: Found 1 translation units. [2021-06-01 16:29:13,288 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.oepc.i [2021-06-01 16:29:13,301 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7764e25a9/ace63b2440694700af228aafcabbfe87/FLAGda9b7adfe [2021-06-01 16:29:13,650 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7764e25a9/ace63b2440694700af228aafcabbfe87 [2021-06-01 16:29:13,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-01 16:29:13,653 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-01 16:29:13,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-01 16:29:13,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-01 16:29:13,672 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-01 16:29:13,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.06 04:29:13" (1/1) ... [2021-06-01 16:29:13,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37502a69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:29:13, skipping insertion in model container [2021-06-01 16:29:13,673 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.06 04:29:13" (1/1) ... [2021-06-01 16:29:13,680 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-01 16:29:13,707 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-01 16:29:13,804 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.oepc.i[952,965] [2021-06-01 16:29:13,954 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-01 16:29:13,960 INFO L203 MainTranslator]: Completed pre-run [2021-06-01 16:29:13,971 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.oepc.i[952,965] [2021-06-01 16:29:14,028 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-01 16:29:14,081 INFO L208 MainTranslator]: Completed translation [2021-06-01 16:29:14,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:29:14 WrapperNode [2021-06-01 16:29:14,081 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-01 16:29:14,082 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-01 16:29:14,082 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-01 16:29:14,082 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-01 16:29:14,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:29:14" (1/1) ... [2021-06-01 16:29:14,102 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:29:14" (1/1) ... [2021-06-01 16:29:14,120 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-01 16:29:14,120 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-01 16:29:14,120 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-01 16:29:14,120 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-01 16:29:14,126 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:29:14" (1/1) ... [2021-06-01 16:29:14,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:29:14" (1/1) ... [2021-06-01 16:29:14,129 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:29:14" (1/1) ... [2021-06-01 16:29:14,129 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:29:14" (1/1) ... [2021-06-01 16:29:14,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:29:14" (1/1) ... [2021-06-01 16:29:14,137 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:29:14" (1/1) ... [2021-06-01 16:29:14,139 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:29:14" (1/1) ... [2021-06-01 16:29:14,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-01 16:29:14,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-01 16:29:14,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-01 16:29:14,143 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-01 16:29:14,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:29:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-01 16:29:14,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-01 16:29:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-01 16:29:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-01 16:29:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-01 16:29:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-01 16:29:14,197 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-01 16:29:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-01 16:29:14,197 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-01 16:29:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-01 16:29:14,197 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-01 16:29:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-01 16:29:14,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-01 16:29:14,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-01 16:29:14,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-01 16:29:14,199 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-01 16:29:15,553 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-01 16:29:15,553 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-01 16:29:15,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.06 04:29:15 BoogieIcfgContainer [2021-06-01 16:29:15,555 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-01 16:29:15,557 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-01 16:29:15,558 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-01 16:29:15,559 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-01 16:29:15,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.06 04:29:13" (1/3) ... [2021-06-01 16:29:15,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@580f433b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.06 04:29:15, skipping insertion in model container [2021-06-01 16:29:15,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:29:14" (2/3) ... [2021-06-01 16:29:15,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@580f433b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.06 04:29:15, skipping insertion in model container [2021-06-01 16:29:15,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.06 04:29:15" (3/3) ... [2021-06-01 16:29:15,562 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc.i [2021-06-01 16:29:15,568 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-01 16:29:15,569 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-01 16:29:15,569 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-01 16:29:15,569 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-01 16:29:15,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,596 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,596 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,597 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,597 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,597 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,597 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,597 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,597 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,601 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,601 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,602 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,602 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,604 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,604 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,604 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,605 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,609 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,610 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,611 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,612 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,613 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,613 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,614 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,618 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,618 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,618 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,618 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,619 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,619 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-01 16:29:15,621 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-01 16:29:15,635 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-01 16:29:15,650 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-01 16:29:15,651 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-01 16:29:15,651 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-01 16:29:15,651 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-01 16:29:15,651 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-01 16:29:15,651 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-01 16:29:15,651 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-01 16:29:15,651 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P0======== [2021-06-01 16:29:15,660 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 114 places, 106 transitions, 227 flow [2021-06-01 16:29:16,453 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 16158 states, 16154 states have (on average 3.63495109570385) internal successors, (58719), 16157 states have internal predecessors, (58719), 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) [2021-06-01 16:29:16,486 INFO L276 IsEmpty]: Start isEmpty. Operand has 16158 states, 16154 states have (on average 3.63495109570385) internal successors, (58719), 16157 states have internal predecessors, (58719), 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) [2021-06-01 16:29:16,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-01 16:29:16,607 INFO L301 ceAbstractionStarter]: Result for error location P0 was SAFE (1/3) [2021-06-01 16:29:16,609 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-01 16:29:16,615 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-01 16:29:16,615 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-01 16:29:16,615 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-01 16:29:16,615 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-01 16:29:16,615 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-01 16:29:16,615 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-01 16:29:16,615 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-01 16:29:16,615 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-01 16:29:16,620 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 114 places, 106 transitions, 227 flow [2021-06-01 16:29:17,212 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 16158 states, 16154 states have (on average 3.63495109570385) internal successors, (58719), 16157 states have internal predecessors, (58719), 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) [2021-06-01 16:29:17,232 INFO L276 IsEmpty]: Start isEmpty. Operand has 16158 states, 16154 states have (on average 3.63495109570385) internal successors, (58719), 16157 states have internal predecessors, (58719), 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) [2021-06-01 16:29:17,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-06-01 16:29:17,249 INFO L546 BasicCegarLoop]: Found error trace [2021-06-01 16:29:17,250 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-01 16:29:17,250 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-01 16:29:17,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-01 16:29:17,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1685543287, now seen corresponding path program 1 times [2021-06-01 16:29:17,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-01 16:29:17,260 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503901637] [2021-06-01 16:29:17,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-01 16:29:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-01 16:29:17,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-01 16:29:17,629 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-01 16:29:17,629 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503901637] [2021-06-01 16:29:17,630 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503901637] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-01 16:29:17,630 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-01 16:29:17,630 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-01 16:29:17,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912874049] [2021-06-01 16:29:17,633 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-01 16:29:17,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-01 16:29:17,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-01 16:29:17,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-01 16:29:17,665 INFO L87 Difference]: Start difference. First operand has 16158 states, 16154 states have (on average 3.63495109570385) internal successors, (58719), 16157 states have internal predecessors, (58719), 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 has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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) [2021-06-01 16:29:17,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-01 16:29:17,965 INFO L93 Difference]: Finished difference Result 22622 states and 80335 transitions. [2021-06-01 16:29:17,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-01 16:29:17,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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) Word has length 67 [2021-06-01 16:29:17,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-01 16:29:18,019 INFO L225 Difference]: With dead ends: 22622 [2021-06-01 16:29:18,020 INFO L226 Difference]: Without dead ends: 8862 [2021-06-01 16:29:18,020 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 76.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-01 16:29:18,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8862 states. [2021-06-01 16:29:18,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8862 to 8862. [2021-06-01 16:29:18,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8862 states, 8860 states have (on average 3.4906320541760723) internal successors, (30927), 8861 states have internal predecessors, (30927), 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) [2021-06-01 16:29:18,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8862 states to 8862 states and 30927 transitions. [2021-06-01 16:29:18,455 INFO L78 Accepts]: Start accepts. Automaton has 8862 states and 30927 transitions. Word has length 67 [2021-06-01 16:29:18,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-01 16:29:18,456 INFO L482 AbstractCegarLoop]: Abstraction has 8862 states and 30927 transitions. [2021-06-01 16:29:18,456 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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) [2021-06-01 16:29:18,456 INFO L276 IsEmpty]: Start isEmpty. Operand 8862 states and 30927 transitions. [2021-06-01 16:29:18,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-06-01 16:29:18,469 INFO L546 BasicCegarLoop]: Found error trace [2021-06-01 16:29:18,469 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-01 16:29:18,470 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-01 16:29:18,470 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-01 16:29:18,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-01 16:29:18,470 INFO L82 PathProgramCache]: Analyzing trace with hash 715036136, now seen corresponding path program 1 times [2021-06-01 16:29:18,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-01 16:29:18,471 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462602856] [2021-06-01 16:29:18,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-01 16:29:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-01 16:29:18,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-01 16:29:18,612 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-01 16:29:18,612 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462602856] [2021-06-01 16:29:18,612 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462602856] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-01 16:29:18,612 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-01 16:29:18,612 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-01 16:29:18,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491295979] [2021-06-01 16:29:18,614 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-01 16:29:18,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-01 16:29:18,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-01 16:29:18,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-01 16:29:18,615 INFO L87 Difference]: Start difference. First operand 8862 states and 30927 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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) [2021-06-01 16:29:18,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-01 16:29:18,753 INFO L93 Difference]: Finished difference Result 10142 states and 35067 transitions. [2021-06-01 16:29:18,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-01 16:29:18,754 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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) Word has length 69 [2021-06-01 16:29:18,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-01 16:29:18,798 INFO L225 Difference]: With dead ends: 10142 [2021-06-01 16:29:18,799 INFO L226 Difference]: Without dead ends: 8094 [2021-06-01 16:29:18,800 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 73.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-01 16:29:18,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8094 states. [2021-06-01 16:29:19,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8094 to 8094. [2021-06-01 16:29:19,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8094 states, 8092 states have (on average 3.467498764211567) internal successors, (28059), 8093 states have internal predecessors, (28059), 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) [2021-06-01 16:29:19,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8094 states to 8094 states and 28059 transitions. [2021-06-01 16:29:19,059 INFO L78 Accepts]: Start accepts. Automaton has 8094 states and 28059 transitions. Word has length 69 [2021-06-01 16:29:19,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-01 16:29:19,059 INFO L482 AbstractCegarLoop]: Abstraction has 8094 states and 28059 transitions. [2021-06-01 16:29:19,060 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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) [2021-06-01 16:29:19,060 INFO L276 IsEmpty]: Start isEmpty. Operand 8094 states and 28059 transitions. [2021-06-01 16:29:19,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-01 16:29:19,071 INFO L546 BasicCegarLoop]: Found error trace [2021-06-01 16:29:19,071 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-01 16:29:19,071 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-01 16:29:19,072 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-01 16:29:19,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-01 16:29:19,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1248901623, now seen corresponding path program 1 times [2021-06-01 16:29:19,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-01 16:29:19,072 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875135126] [2021-06-01 16:29:19,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-01 16:29:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-01 16:29:19,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-01 16:29:19,228 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-01 16:29:19,228 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875135126] [2021-06-01 16:29:19,228 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875135126] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-01 16:29:19,228 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-01 16:29:19,228 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-01 16:29:19,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757703050] [2021-06-01 16:29:19,228 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-01 16:29:19,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-01 16:29:19,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-01 16:29:19,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-01 16:29:19,229 INFO L87 Difference]: Start difference. First operand 8094 states and 28059 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 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) [2021-06-01 16:29:19,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-01 16:29:19,413 INFO L93 Difference]: Finished difference Result 9558 states and 32879 transitions. [2021-06-01 16:29:19,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-01 16:29:19,414 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 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) Word has length 71 [2021-06-01 16:29:19,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-01 16:29:19,438 INFO L225 Difference]: With dead ends: 9558 [2021-06-01 16:29:19,438 INFO L226 Difference]: Without dead ends: 8022 [2021-06-01 16:29:19,438 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 96.6ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-06-01 16:29:19,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8022 states. [2021-06-01 16:29:19,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8022 to 8022. [2021-06-01 16:29:19,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8022 states, 8020 states have (on average 3.462718204488778) internal successors, (27771), 8021 states have internal predecessors, (27771), 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) [2021-06-01 16:29:19,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8022 states to 8022 states and 27771 transitions. [2021-06-01 16:29:19,690 INFO L78 Accepts]: Start accepts. Automaton has 8022 states and 27771 transitions. Word has length 71 [2021-06-01 16:29:19,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-01 16:29:19,691 INFO L482 AbstractCegarLoop]: Abstraction has 8022 states and 27771 transitions. [2021-06-01 16:29:19,691 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 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) [2021-06-01 16:29:19,691 INFO L276 IsEmpty]: Start isEmpty. Operand 8022 states and 27771 transitions. [2021-06-01 16:29:19,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-01 16:29:19,703 INFO L546 BasicCegarLoop]: Found error trace [2021-06-01 16:29:19,703 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-01 16:29:19,703 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-01 16:29:19,704 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-01 16:29:19,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-01 16:29:19,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1929603224, now seen corresponding path program 1 times [2021-06-01 16:29:19,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-01 16:29:19,704 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884442601] [2021-06-01 16:29:19,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-01 16:29:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-01 16:29:19,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-01 16:29:19,779 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-01 16:29:19,779 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884442601] [2021-06-01 16:29:19,779 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884442601] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-01 16:29:19,779 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-01 16:29:19,779 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-01 16:29:19,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935785928] [2021-06-01 16:29:19,780 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-01 16:29:19,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-01 16:29:19,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-01 16:29:19,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-01 16:29:19,780 INFO L87 Difference]: Start difference. First operand 8022 states and 27771 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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) [2021-06-01 16:29:19,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-01 16:29:19,990 INFO L93 Difference]: Finished difference Result 11298 states and 39002 transitions. [2021-06-01 16:29:19,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-01 16:29:19,991 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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) Word has length 72 [2021-06-01 16:29:19,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-01 16:29:20,012 INFO L225 Difference]: With dead ends: 11298 [2021-06-01 16:29:20,012 INFO L226 Difference]: Without dead ends: 5922 [2021-06-01 16:29:20,013 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 154.5ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-06-01 16:29:20,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5922 states. [2021-06-01 16:29:20,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5922 to 5922. [2021-06-01 16:29:20,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5922 states, 5920 states have (on average 3.364358108108108) internal successors, (19917), 5921 states have internal predecessors, (19917), 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) [2021-06-01 16:29:20,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5922 states to 5922 states and 19917 transitions. [2021-06-01 16:29:20,135 INFO L78 Accepts]: Start accepts. Automaton has 5922 states and 19917 transitions. Word has length 72 [2021-06-01 16:29:20,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-01 16:29:20,135 INFO L482 AbstractCegarLoop]: Abstraction has 5922 states and 19917 transitions. [2021-06-01 16:29:20,135 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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) [2021-06-01 16:29:20,135 INFO L276 IsEmpty]: Start isEmpty. Operand 5922 states and 19917 transitions. [2021-06-01 16:29:20,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-01 16:29:20,143 INFO L546 BasicCegarLoop]: Found error trace [2021-06-01 16:29:20,143 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-01 16:29:20,143 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-01 16:29:20,143 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-01 16:29:20,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-01 16:29:20,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1067583572, now seen corresponding path program 1 times [2021-06-01 16:29:20,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-01 16:29:20,144 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262974472] [2021-06-01 16:29:20,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-01 16:29:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-01 16:29:20,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-01 16:29:20,296 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-01 16:29:20,296 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262974472] [2021-06-01 16:29:20,297 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262974472] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-01 16:29:20,297 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-01 16:29:20,297 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-01 16:29:20,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848079270] [2021-06-01 16:29:20,297 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-01 16:29:20,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-01 16:29:20,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-01 16:29:20,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-01 16:29:20,298 INFO L87 Difference]: Start difference. First operand 5922 states and 19917 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 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) [2021-06-01 16:29:20,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-01 16:29:20,602 INFO L93 Difference]: Finished difference Result 6211 states and 20734 transitions. [2021-06-01 16:29:20,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-01 16:29:20,603 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 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) Word has length 73 [2021-06-01 16:29:20,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-01 16:29:20,719 INFO L225 Difference]: With dead ends: 6211 [2021-06-01 16:29:20,719 INFO L226 Difference]: Without dead ends: 5379 [2021-06-01 16:29:20,719 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 169.5ms TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2021-06-01 16:29:20,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5379 states. [2021-06-01 16:29:20,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5379 to 5331. [2021-06-01 16:29:20,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5331 states, 5330 states have (on average 3.350844277673546) internal successors, (17860), 5330 states have internal predecessors, (17860), 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) [2021-06-01 16:29:20,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5331 states to 5331 states and 17860 transitions. [2021-06-01 16:29:20,830 INFO L78 Accepts]: Start accepts. Automaton has 5331 states and 17860 transitions. Word has length 73 [2021-06-01 16:29:20,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-01 16:29:20,831 INFO L482 AbstractCegarLoop]: Abstraction has 5331 states and 17860 transitions. [2021-06-01 16:29:20,831 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 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) [2021-06-01 16:29:20,831 INFO L276 IsEmpty]: Start isEmpty. Operand 5331 states and 17860 transitions. [2021-06-01 16:29:20,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-01 16:29:20,838 INFO L546 BasicCegarLoop]: Found error trace [2021-06-01 16:29:20,839 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-01 16:29:20,839 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-01 16:29:20,839 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-01 16:29:20,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-01 16:29:20,839 INFO L82 PathProgramCache]: Analyzing trace with hash 326345816, now seen corresponding path program 1 times [2021-06-01 16:29:20,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-01 16:29:20,840 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591818362] [2021-06-01 16:29:20,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-01 16:29:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-01 16:29:20,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-01 16:29:20,998 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-01 16:29:20,998 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591818362] [2021-06-01 16:29:20,998 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591818362] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-01 16:29:20,999 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-01 16:29:20,999 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-01 16:29:20,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419984513] [2021-06-01 16:29:20,999 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-01 16:29:20,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-01 16:29:21,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-01 16:29:21,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-06-01 16:29:21,000 INFO L87 Difference]: Start difference. First operand 5331 states and 17860 transitions. Second operand has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 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) [2021-06-01 16:29:21,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-01 16:29:21,260 INFO L93 Difference]: Finished difference Result 6341 states and 21148 transitions. [2021-06-01 16:29:21,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-01 16:29:21,261 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 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) Word has length 73 [2021-06-01 16:29:21,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-01 16:29:21,275 INFO L225 Difference]: With dead ends: 6341 [2021-06-01 16:29:21,275 INFO L226 Difference]: Without dead ends: 5573 [2021-06-01 16:29:21,276 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 192.5ms TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2021-06-01 16:29:21,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5573 states. [2021-06-01 16:29:21,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5573 to 5283. [2021-06-01 16:29:21,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5283 states, 5282 states have (on average 3.347216963271488) internal successors, (17680), 5282 states have internal predecessors, (17680), 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) [2021-06-01 16:29:21,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5283 states to 5283 states and 17680 transitions. [2021-06-01 16:29:21,469 INFO L78 Accepts]: Start accepts. Automaton has 5283 states and 17680 transitions. Word has length 73 [2021-06-01 16:29:21,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-01 16:29:21,469 INFO L482 AbstractCegarLoop]: Abstraction has 5283 states and 17680 transitions. [2021-06-01 16:29:21,469 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 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) [2021-06-01 16:29:21,470 INFO L276 IsEmpty]: Start isEmpty. Operand 5283 states and 17680 transitions. [2021-06-01 16:29:21,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-01 16:29:21,478 INFO L546 BasicCegarLoop]: Found error trace [2021-06-01 16:29:21,478 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-01 16:29:21,478 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-01 16:29:21,478 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-01 16:29:21,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-01 16:29:21,479 INFO L82 PathProgramCache]: Analyzing trace with hash 468080022, now seen corresponding path program 1 times [2021-06-01 16:29:21,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-01 16:29:21,479 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954211579] [2021-06-01 16:29:21,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-01 16:29:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-01 16:29:21,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-01 16:29:21,633 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-01 16:29:21,634 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954211579] [2021-06-01 16:29:21,634 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954211579] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-01 16:29:21,634 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-01 16:29:21,634 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-01 16:29:21,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238742280] [2021-06-01 16:29:21,634 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-01 16:29:21,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-01 16:29:21,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-01 16:29:21,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-06-01 16:29:21,635 INFO L87 Difference]: Start difference. First operand 5283 states and 17680 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 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) [2021-06-01 16:29:22,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-01 16:29:22,086 INFO L93 Difference]: Finished difference Result 6229 states and 20754 transitions. [2021-06-01 16:29:22,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-01 16:29:22,086 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 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) Word has length 74 [2021-06-01 16:29:22,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-01 16:29:22,099 INFO L225 Difference]: With dead ends: 6229 [2021-06-01 16:29:22,099 INFO L226 Difference]: Without dead ends: 5301 [2021-06-01 16:29:22,099 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 296.8ms TimeCoverageRelationStatistics Valid=153, Invalid=309, Unknown=0, NotChecked=0, Total=462 [2021-06-01 16:29:22,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5301 states. [2021-06-01 16:29:22,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5301 to 4923. [2021-06-01 16:29:22,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4923 states, 4922 states have (on average 3.329134498171475) internal successors, (16386), 4922 states have internal predecessors, (16386), 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) [2021-06-01 16:29:22,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4923 states to 4923 states and 16386 transitions. [2021-06-01 16:29:22,188 INFO L78 Accepts]: Start accepts. Automaton has 4923 states and 16386 transitions. Word has length 74 [2021-06-01 16:29:22,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-01 16:29:22,188 INFO L482 AbstractCegarLoop]: Abstraction has 4923 states and 16386 transitions. [2021-06-01 16:29:22,188 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 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) [2021-06-01 16:29:22,188 INFO L276 IsEmpty]: Start isEmpty. Operand 4923 states and 16386 transitions. [2021-06-01 16:29:22,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-06-01 16:29:22,195 INFO L546 BasicCegarLoop]: Found error trace [2021-06-01 16:29:22,196 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-01 16:29:22,196 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-01 16:29:22,196 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-01 16:29:22,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-01 16:29:22,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1312349294, now seen corresponding path program 1 times [2021-06-01 16:29:22,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-01 16:29:22,196 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109425860] [2021-06-01 16:29:22,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-01 16:29:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-01 16:29:22,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-01 16:29:22,394 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-01 16:29:22,394 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109425860] [2021-06-01 16:29:22,394 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109425860] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-01 16:29:22,394 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-01 16:29:22,394 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-01 16:29:22,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775143084] [2021-06-01 16:29:22,395 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-01 16:29:22,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-01 16:29:22,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-01 16:29:22,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-01 16:29:22,395 INFO L87 Difference]: Start difference. First operand 4923 states and 16386 transitions. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 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) [2021-06-01 16:29:22,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-01 16:29:22,674 INFO L93 Difference]: Finished difference Result 6563 states and 21919 transitions. [2021-06-01 16:29:22,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-01 16:29:22,675 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 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) Word has length 75 [2021-06-01 16:29:22,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-01 16:29:22,686 INFO L225 Difference]: With dead ends: 6563 [2021-06-01 16:29:22,686 INFO L226 Difference]: Without dead ends: 5691 [2021-06-01 16:29:22,687 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 223.2ms TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2021-06-01 16:29:22,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5691 states. [2021-06-01 16:29:22,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5691 to 5523. [2021-06-01 16:29:22,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5523 states, 5522 states have (on average 3.3424483882651215) internal successors, (18457), 5522 states have internal predecessors, (18457), 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) [2021-06-01 16:29:22,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5523 states to 5523 states and 18457 transitions. [2021-06-01 16:29:22,786 INFO L78 Accepts]: Start accepts. Automaton has 5523 states and 18457 transitions. Word has length 75 [2021-06-01 16:29:22,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-01 16:29:22,787 INFO L482 AbstractCegarLoop]: Abstraction has 5523 states and 18457 transitions. [2021-06-01 16:29:22,787 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 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) [2021-06-01 16:29:22,787 INFO L276 IsEmpty]: Start isEmpty. Operand 5523 states and 18457 transitions. [2021-06-01 16:29:22,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-06-01 16:29:22,795 INFO L546 BasicCegarLoop]: Found error trace [2021-06-01 16:29:22,795 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-01 16:29:22,795 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-01 16:29:22,795 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-01 16:29:22,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-01 16:29:22,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1588688614, now seen corresponding path program 1 times [2021-06-01 16:29:22,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-01 16:29:22,796 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753018810] [2021-06-01 16:29:22,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-01 16:29:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-01 16:29:22,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-01 16:29:22,999 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-01 16:29:22,999 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753018810] [2021-06-01 16:29:22,999 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753018810] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-01 16:29:23,000 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-01 16:29:23,000 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-01 16:29:23,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357006832] [2021-06-01 16:29:23,000 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-01 16:29:23,000 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-01 16:29:23,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-01 16:29:23,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-06-01 16:29:23,001 INFO L87 Difference]: Start difference. First operand 5523 states and 18457 transitions. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 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) [2021-06-01 16:29:23,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-01 16:29:23,424 INFO L93 Difference]: Finished difference Result 6533 states and 21831 transitions. [2021-06-01 16:29:23,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-01 16:29:23,425 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 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) Word has length 75 [2021-06-01 16:29:23,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-01 16:29:23,438 INFO L225 Difference]: With dead ends: 6533 [2021-06-01 16:29:23,438 INFO L226 Difference]: Without dead ends: 5957 [2021-06-01 16:29:23,439 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 336.8ms TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2021-06-01 16:29:23,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5957 states. [2021-06-01 16:29:23,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5957 to 5813. [2021-06-01 16:29:23,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5813 states, 5812 states have (on average 3.3494494150034413) internal successors, (19467), 5812 states have internal predecessors, (19467), 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) [2021-06-01 16:29:23,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5813 states to 5813 states and 19467 transitions. [2021-06-01 16:29:23,572 INFO L78 Accepts]: Start accepts. Automaton has 5813 states and 19467 transitions. Word has length 75 [2021-06-01 16:29:23,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-01 16:29:23,573 INFO L482 AbstractCegarLoop]: Abstraction has 5813 states and 19467 transitions. [2021-06-01 16:29:23,573 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 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) [2021-06-01 16:29:23,573 INFO L276 IsEmpty]: Start isEmpty. Operand 5813 states and 19467 transitions. [2021-06-01 16:29:23,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-06-01 16:29:23,582 INFO L546 BasicCegarLoop]: Found error trace [2021-06-01 16:29:23,582 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-01 16:29:23,582 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-01 16:29:23,582 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-01 16:29:23,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-01 16:29:23,583 INFO L82 PathProgramCache]: Analyzing trace with hash -834503450, now seen corresponding path program 2 times [2021-06-01 16:29:23,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-01 16:29:23,583 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367004673] [2021-06-01 16:29:23,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-01 16:29:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-01 16:29:23,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-01 16:29:23,809 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-01 16:29:23,810 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367004673] [2021-06-01 16:29:23,810 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367004673] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-01 16:29:23,810 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-01 16:29:23,810 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-01 16:29:23,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534473710] [2021-06-01 16:29:23,810 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-01 16:29:23,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-01 16:29:23,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-01 16:29:23,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-06-01 16:29:23,811 INFO L87 Difference]: Start difference. First operand 5813 states and 19467 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 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) [2021-06-01 16:29:24,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-01 16:29:24,083 INFO L93 Difference]: Finished difference Result 6341 states and 21119 transitions. [2021-06-01 16:29:24,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-01 16:29:24,089 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 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) Word has length 75 [2021-06-01 16:29:24,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-01 16:29:24,099 INFO L225 Difference]: With dead ends: 6341 [2021-06-01 16:29:24,099 INFO L226 Difference]: Without dead ends: 5765 [2021-06-01 16:29:24,100 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 305.2ms TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2021-06-01 16:29:24,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5765 states. [2021-06-01 16:29:24,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5765 to 5493. [2021-06-01 16:29:24,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5493 states, 5492 states have (on average 3.3406773488710853) internal successors, (18347), 5492 states have internal predecessors, (18347), 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) [2021-06-01 16:29:24,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5493 states to 5493 states and 18347 transitions. [2021-06-01 16:29:24,204 INFO L78 Accepts]: Start accepts. Automaton has 5493 states and 18347 transitions. Word has length 75 [2021-06-01 16:29:24,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-01 16:29:24,205 INFO L482 AbstractCegarLoop]: Abstraction has 5493 states and 18347 transitions. [2021-06-01 16:29:24,205 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 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) [2021-06-01 16:29:24,205 INFO L276 IsEmpty]: Start isEmpty. Operand 5493 states and 18347 transitions. [2021-06-01 16:29:24,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-06-01 16:29:24,215 INFO L546 BasicCegarLoop]: Found error trace [2021-06-01 16:29:24,215 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-01 16:29:24,216 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-01 16:29:24,216 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-01 16:29:24,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-01 16:29:24,216 INFO L82 PathProgramCache]: Analyzing trace with hash 838493874, now seen corresponding path program 1 times [2021-06-01 16:29:24,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-01 16:29:24,216 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626702193] [2021-06-01 16:29:24,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-01 16:29:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-01 16:29:24,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-01 16:29:24,290 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-01 16:29:24,290 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626702193] [2021-06-01 16:29:24,290 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626702193] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-01 16:29:24,290 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-01 16:29:24,290 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-01 16:29:24,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979385829] [2021-06-01 16:29:24,290 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-01 16:29:24,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-01 16:29:24,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-01 16:29:24,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-01 16:29:24,291 INFO L87 Difference]: Start difference. First operand 5493 states and 18347 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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) [2021-06-01 16:29:24,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-01 16:29:24,374 INFO L93 Difference]: Finished difference Result 6633 states and 21837 transitions. [2021-06-01 16:29:24,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-01 16:29:24,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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) Word has length 76 [2021-06-01 16:29:24,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-01 16:29:24,382 INFO L225 Difference]: With dead ends: 6633 [2021-06-01 16:29:24,382 INFO L226 Difference]: Without dead ends: 4881 [2021-06-01 16:29:24,383 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 54.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-01 16:29:24,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4881 states. [2021-06-01 16:29:24,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4881 to 4881. [2021-06-01 16:29:24,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4881 states, 4880 states have (on average 3.276434426229508) internal successors, (15989), 4880 states have internal predecessors, (15989), 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) [2021-06-01 16:29:24,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4881 states to 4881 states and 15989 transitions. [2021-06-01 16:29:24,470 INFO L78 Accepts]: Start accepts. Automaton has 4881 states and 15989 transitions. Word has length 76 [2021-06-01 16:29:24,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-01 16:29:24,470 INFO L482 AbstractCegarLoop]: Abstraction has 4881 states and 15989 transitions. [2021-06-01 16:29:24,470 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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) [2021-06-01 16:29:24,470 INFO L276 IsEmpty]: Start isEmpty. Operand 4881 states and 15989 transitions. [2021-06-01 16:29:24,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-01 16:29:24,476 INFO L546 BasicCegarLoop]: Found error trace [2021-06-01 16:29:24,476 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-01 16:29:24,476 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-01 16:29:24,477 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-01 16:29:24,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-01 16:29:24,477 INFO L82 PathProgramCache]: Analyzing trace with hash -902903539, now seen corresponding path program 1 times [2021-06-01 16:29:24,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-01 16:29:24,477 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517973929] [2021-06-01 16:29:24,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-01 16:29:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-01 16:29:24,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-01 16:29:24,561 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-01 16:29:24,561 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517973929] [2021-06-01 16:29:24,561 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517973929] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-01 16:29:24,561 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-01 16:29:24,561 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-01 16:29:24,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883067422] [2021-06-01 16:29:24,561 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-01 16:29:24,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-01 16:29:24,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-01 16:29:24,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-01 16:29:24,562 INFO L87 Difference]: Start difference. First operand 4881 states and 15989 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 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) [2021-06-01 16:29:24,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-01 16:29:24,689 INFO L93 Difference]: Finished difference Result 4815 states and 15351 transitions. [2021-06-01 16:29:24,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-01 16:29:24,689 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 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) Word has length 77 [2021-06-01 16:29:24,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-01 16:29:24,695 INFO L225 Difference]: With dead ends: 4815 [2021-06-01 16:29:24,695 INFO L226 Difference]: Without dead ends: 3423 [2021-06-01 16:29:24,695 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 77.8ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-01 16:29:24,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3423 states. [2021-06-01 16:29:24,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3423 to 3357. [2021-06-01 16:29:24,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3357 states, 3356 states have (on average 3.1197854588796186) internal successors, (10470), 3356 states have internal predecessors, (10470), 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) [2021-06-01 16:29:24,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 10470 transitions. [2021-06-01 16:29:24,755 INFO L78 Accepts]: Start accepts. Automaton has 3357 states and 10470 transitions. Word has length 77 [2021-06-01 16:29:24,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-01 16:29:24,755 INFO L482 AbstractCegarLoop]: Abstraction has 3357 states and 10470 transitions. [2021-06-01 16:29:24,755 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 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) [2021-06-01 16:29:24,756 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 10470 transitions. [2021-06-01 16:29:24,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-06-01 16:29:24,760 INFO L546 BasicCegarLoop]: Found error trace [2021-06-01 16:29:24,760 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-01 16:29:24,760 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-01 16:29:24,760 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-01 16:29:24,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-01 16:29:24,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1895442222, now seen corresponding path program 1 times [2021-06-01 16:29:24,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-01 16:29:24,761 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085799629] [2021-06-01 16:29:24,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-01 16:29:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-01 16:29:24,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-01 16:29:24,836 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-01 16:29:24,836 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085799629] [2021-06-01 16:29:24,837 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085799629] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-01 16:29:24,837 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-01 16:29:24,837 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-01 16:29:24,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755178426] [2021-06-01 16:29:24,837 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-01 16:29:24,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-01 16:29:24,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-01 16:29:24,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-01 16:29:24,838 INFO L87 Difference]: Start difference. First operand 3357 states and 10470 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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) [2021-06-01 16:29:24,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-01 16:29:24,951 INFO L93 Difference]: Finished difference Result 2763 states and 8427 transitions. [2021-06-01 16:29:24,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-01 16:29:24,951 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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) Word has length 79 [2021-06-01 16:29:24,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-01 16:29:24,954 INFO L225 Difference]: With dead ends: 2763 [2021-06-01 16:29:24,954 INFO L226 Difference]: Without dead ends: 2115 [2021-06-01 16:29:24,955 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 88.7ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-06-01 16:29:24,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2115 states. [2021-06-01 16:29:24,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2115 to 1971. [2021-06-01 16:29:24,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1971 states, 1970 states have (on average 2.981725888324873) internal successors, (5874), 1970 states have internal predecessors, (5874), 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) [2021-06-01 16:29:24,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 5874 transitions. [2021-06-01 16:29:24,982 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 5874 transitions. Word has length 79 [2021-06-01 16:29:24,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-01 16:29:24,982 INFO L482 AbstractCegarLoop]: Abstraction has 1971 states and 5874 transitions. [2021-06-01 16:29:24,983 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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) [2021-06-01 16:29:24,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 5874 transitions. [2021-06-01 16:29:24,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-01 16:29:24,985 INFO L546 BasicCegarLoop]: Found error trace [2021-06-01 16:29:24,985 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-01 16:29:24,985 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-01 16:29:24,985 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-01 16:29:24,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-01 16:29:24,986 INFO L82 PathProgramCache]: Analyzing trace with hash -575909962, now seen corresponding path program 1 times [2021-06-01 16:29:24,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-01 16:29:24,986 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156047284] [2021-06-01 16:29:24,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-01 16:29:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-01 16:29:25,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-01 16:29:25,228 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-01 16:29:25,228 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156047284] [2021-06-01 16:29:25,228 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156047284] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-01 16:29:25,228 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-01 16:29:25,228 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-01 16:29:25,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407005193] [2021-06-01 16:29:25,228 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-01 16:29:25,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-01 16:29:25,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-01 16:29:25,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2021-06-01 16:29:25,229 INFO L87 Difference]: Start difference. First operand 1971 states and 5874 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 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) [2021-06-01 16:29:25,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-01 16:29:25,514 INFO L93 Difference]: Finished difference Result 2691 states and 8079 transitions. [2021-06-01 16:29:25,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-01 16:29:25,515 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 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) Word has length 82 [2021-06-01 16:29:25,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-01 16:29:25,517 INFO L225 Difference]: With dead ends: 2691 [2021-06-01 16:29:25,518 INFO L226 Difference]: Without dead ends: 1617 [2021-06-01 16:29:25,518 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 299.9ms TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2021-06-01 16:29:25,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2021-06-01 16:29:25,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1467. [2021-06-01 16:29:25,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1467 states, 1466 states have (on average 2.9481582537517053) internal successors, (4322), 1466 states have internal predecessors, (4322), 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) [2021-06-01 16:29:25,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 4322 transitions. [2021-06-01 16:29:25,540 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 4322 transitions. Word has length 82 [2021-06-01 16:29:25,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-01 16:29:25,541 INFO L482 AbstractCegarLoop]: Abstraction has 1467 states and 4322 transitions. [2021-06-01 16:29:25,541 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 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) [2021-06-01 16:29:25,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 4322 transitions. [2021-06-01 16:29:25,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-01 16:29:25,542 INFO L546 BasicCegarLoop]: Found error trace [2021-06-01 16:29:25,543 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-01 16:29:25,543 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-01 16:29:25,543 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-01 16:29:25,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-01 16:29:25,543 INFO L82 PathProgramCache]: Analyzing trace with hash 2009377846, now seen corresponding path program 2 times [2021-06-01 16:29:25,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-01 16:29:25,543 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367072145] [2021-06-01 16:29:25,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-01 16:29:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-01 16:29:25,572 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-01 16:29:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-01 16:29:25,608 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-01 16:29:25,646 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-01 16:29:25,647 INFO L655 BasicCegarLoop]: Counterexample might be feasible [2021-06-01 16:29:25,647 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-01 16:29:25,647 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/3) [2021-06-01 16:29:25,648 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-01 16:29:25,650 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-01 16:29:25,650 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-01 16:29:25,650 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-01 16:29:25,650 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-01 16:29:25,650 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-01 16:29:25,650 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-01 16:29:25,650 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-01 16:29:25,650 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P0Thread1of1ForFork0======== [2021-06-01 16:29:25,653 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 114 places, 106 transitions, 227 flow [2021-06-01 16:29:26,272 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 16158 states, 16154 states have (on average 3.63495109570385) internal successors, (58719), 16157 states have internal predecessors, (58719), 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) [2021-06-01 16:29:26,294 INFO L276 IsEmpty]: Start isEmpty. Operand has 16158 states, 16154 states have (on average 3.63495109570385) internal successors, (58719), 16157 states have internal predecessors, (58719), 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) [2021-06-01 16:29:26,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-06-01 16:29:26,295 INFO L546 BasicCegarLoop]: Found error trace [2021-06-01 16:29:26,295 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-01 16:29:26,295 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-01 16:29:26,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-01 16:29:26,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1091169302, now seen corresponding path program 1 times [2021-06-01 16:29:26,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-01 16:29:26,295 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230208878] [2021-06-01 16:29:26,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-01 16:29:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-01 16:29:26,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-01 16:29:26,310 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-01 16:29:26,310 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230208878] [2021-06-01 16:29:26,310 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230208878] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-01 16:29:26,310 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-01 16:29:26,310 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-01 16:29:26,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135181687] [2021-06-01 16:29:26,311 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-01 16:29:26,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-01 16:29:26,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-01 16:29:26,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-01 16:29:26,333 INFO L87 Difference]: Start difference. First operand has 16158 states, 16154 states have (on average 3.63495109570385) internal successors, (58719), 16157 states have internal predecessors, (58719), 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 has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 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) [2021-06-01 16:29:26,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-01 16:29:26,421 INFO L93 Difference]: Finished difference Result 13855 states and 49120 transitions. [2021-06-01 16:29:26,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-01 16:29:26,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 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) Word has length 41 [2021-06-01 16:29:26,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-01 16:29:26,422 INFO L225 Difference]: With dead ends: 13855 [2021-06-01 16:29:26,422 INFO L226 Difference]: Without dead ends: 0 [2021-06-01 16:29:26,422 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-01 16:29:26,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-01 16:29:26,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-01 16:29:26,422 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) [2021-06-01 16:29:26,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-01 16:29:26,423 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2021-06-01 16:29:26,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-01 16:29:26,423 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-01 16:29:26,423 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 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) [2021-06-01 16:29:26,423 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-01 16:29:26,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-01 16:29:26,423 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-01 16:29:26,423 INFO L301 ceAbstractionStarter]: Result for error location P0Thread1of1ForFork0 was SAFE (3/3) [2021-06-01 16:29:26,424 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-01 16:29:26,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.06 04:29:26 BasicIcfg [2021-06-01 16:29:26,524 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-01 16:29:26,525 INFO L168 Benchmark]: Toolchain (without parser) took 12871.99 ms. Allocated memory was 381.7 MB in the beginning and 3.6 GB in the end (delta: 3.2 GB). Free memory was 344.6 MB in the beginning and 2.2 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.4 GB. Max. memory is 16.0 GB. [2021-06-01 16:29:26,525 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 381.7 MB. Free memory was 363.0 MB in the beginning and 362.9 MB in the end (delta: 75.2 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-01 16:29:26,525 INFO L168 Benchmark]: CACSL2BoogieTranslator took 427.47 ms. Allocated memory is still 381.7 MB. Free memory was 344.4 MB in the beginning and 342.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. [2021-06-01 16:29:26,526 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.07 ms. Allocated memory is still 381.7 MB. Free memory was 342.7 MB in the beginning and 339.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-01 16:29:26,526 INFO L168 Benchmark]: Boogie Preprocessor took 22.00 ms. Allocated memory is still 381.7 MB. Free memory was 339.5 MB in the beginning and 337.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-01 16:29:26,526 INFO L168 Benchmark]: RCFGBuilder took 1412.72 ms. Allocated memory is still 381.7 MB. Free memory was 337.4 MB in the beginning and 279.0 MB in the end (delta: 58.5 MB). Peak memory consumption was 156.0 MB. Max. memory is 16.0 GB. [2021-06-01 16:29:26,526 INFO L168 Benchmark]: TraceAbstraction took 10966.89 ms. Allocated memory was 381.7 MB in the beginning and 3.6 GB in the end (delta: 3.2 GB). Free memory was 277.9 MB in the beginning and 2.2 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.3 GB. Max. memory is 16.0 GB. [2021-06-01 16:29:26,526 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 381.7 MB. Free memory was 363.0 MB in the beginning and 362.9 MB in the end (delta: 75.2 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 427.47 ms. Allocated memory is still 381.7 MB. Free memory was 344.4 MB in the beginning and 342.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 38.07 ms. Allocated memory is still 381.7 MB. Free memory was 342.7 MB in the beginning and 339.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 22.00 ms. Allocated memory is still 381.7 MB. Free memory was 339.5 MB in the beginning and 337.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1412.72 ms. Allocated memory is still 381.7 MB. Free memory was 337.4 MB in the beginning and 279.0 MB in the end (delta: 58.5 MB). Peak memory consumption was 156.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 10966.89 ms. Allocated memory was 381.7 MB in the beginning and 3.6 GB in the end (delta: 3.2 GB). Free memory was 277.9 MB in the beginning and 2.2 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.3 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L719] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L720] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L721] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L722] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L723] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L724] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L725] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L726] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L727] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L728] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L729] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L730] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L731] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L732] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L733] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L734] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L735] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 pthread_t t2025; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2026; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t2027; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P0 with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 958.2ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 153.8ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 801.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=16158occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9032.1ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 146.2ms, AutomataDifference: 3829.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 596.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1925 SDtfs, 3680 SDslu, 8051 SDs, 0 SdLazy, 1295 SolverSat, 301 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1059.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 2446.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=16158occurred in iteration=0, InterpolantAutomatonStates: 178, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1983.7ms AutomataMinimizationTime, 14 MinimizatonAttempts, 1660 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 41.5ms SsaConstructionTime, 469.0ms SatisfiabilityAnalysisTime, 1737.5ms InterpolantComputationTime, 1120 NumberOfCodeBlocks, 1120 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1024 ConstructedInterpolants, 0 QuantifiedInterpolants, 7050 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P0Thread1of1ForFork0 with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 773.6ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 22.6ms, AutomataDifference: 111.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 622.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 94 SDtfs, 49 SDslu, 80 SDs, 0 SdLazy, 11 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=16158occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 0.3ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9ms SsaConstructionTime, 2.0ms SatisfiabilityAnalysisTime, 9.3ms InterpolantComputationTime, 41 NumberOfCodeBlocks, 41 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 40 ConstructedInterpolants, 0 QuantifiedInterpolants, 66 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate proved your program to be incorrect! Received shutdown request...