/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/safe001_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2abb09bbbae98a04ae2fcc735832bfdba44f6fbc-2abb09b [2021-06-05 19:49:28,195 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 19:49:28,197 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 19:49:28,228 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 19:49:28,228 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 19:49:28,231 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 19:49:28,233 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 19:49:28,237 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 19:49:28,239 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 19:49:28,243 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 19:49:28,243 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 19:49:28,244 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 19:49:28,245 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 19:49:28,246 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 19:49:28,247 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 19:49:28,248 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 19:49:28,250 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 19:49:28,251 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 19:49:28,252 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 19:49:28,257 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 19:49:28,258 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 19:49:28,258 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 19:49:28,259 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 19:49:28,260 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 19:49:28,265 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 19:49:28,265 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 19:49:28,265 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 19:49:28,266 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 19:49:28,266 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 19:49:28,267 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 19:49:28,267 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 19:49:28,267 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 19:49:28,268 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 19:49:28,268 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 19:49:28,269 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 19:49:28,269 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 19:49:28,269 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 19:49:28,269 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 19:49:28,269 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 19:49:28,270 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 19:49:28,270 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 19:49:28,271 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-05 19:49:28,298 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 19:49:28,299 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 19:49:28,299 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 19:49:28,299 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 19:49:28,301 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 19:49:28,301 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 19:49:28,301 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 19:49:28,301 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 19:49:28,302 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 19:49:28,302 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 19:49:28,302 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 19:49:28,302 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 19:49:28,302 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 19:49:28,302 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 19:49:28,303 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 19:49:28,303 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 19:49:28,303 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 19:49:28,303 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 19:49:28,303 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 19:49:28,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 19:49:28,303 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 19:49:28,303 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 19:49:28,303 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 19:49:28,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 19:49:28,303 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 19:49:28,304 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 19:49:28,304 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 19:49:28,304 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 19:49:28,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 19:49:28,304 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 19:49:28,304 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 19:49:28,304 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-05 19:49:28,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 19:49:28,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 19:49:28,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 19:49:28,563 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 19:49:28,564 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 19:49:28,564 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_pso.oepc.i [2021-06-05 19:49:28,612 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad38216ec/af4ba8c82b36480fb0437a2ac4482454/FLAG912f357b4 [2021-06-05 19:49:29,061 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 19:49:29,062 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_pso.oepc.i [2021-06-05 19:49:29,076 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad38216ec/af4ba8c82b36480fb0437a2ac4482454/FLAG912f357b4 [2021-06-05 19:49:29,091 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad38216ec/af4ba8c82b36480fb0437a2ac4482454 [2021-06-05 19:49:29,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 19:49:29,095 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 19:49:29,097 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 19:49:29,097 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 19:49:29,100 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 19:49:29,100 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 07:49:29" (1/1) ... [2021-06-05 19:49:29,101 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72ae0cab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:49:29, skipping insertion in model container [2021-06-05 19:49:29,101 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 07:49:29" (1/1) ... [2021-06-05 19:49:29,106 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 19:49:29,144 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 19:49:29,299 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/safe001_pso.oepc.i[950,963] [2021-06-05 19:49:29,466 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 19:49:29,472 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 19:49:29,483 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/safe001_pso.oepc.i[950,963] [2021-06-05 19:49:29,520 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 19:49:29,556 INFO L208 MainTranslator]: Completed translation [2021-06-05 19:49:29,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:49:29 WrapperNode [2021-06-05 19:49:29,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 19:49:29,558 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 19:49:29,558 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 19:49:29,558 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 19:49:29,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:49:29" (1/1) ... [2021-06-05 19:49:29,574 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:49:29" (1/1) ... [2021-06-05 19:49:29,595 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 19:49:29,596 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 19:49:29,596 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 19:49:29,596 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 19:49:29,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:49:29" (1/1) ... [2021-06-05 19:49:29,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:49:29" (1/1) ... [2021-06-05 19:49:29,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:49:29" (1/1) ... [2021-06-05 19:49:29,605 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:49:29" (1/1) ... [2021-06-05 19:49:29,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:49:29" (1/1) ... [2021-06-05 19:49:29,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:49:29" (1/1) ... [2021-06-05 19:49:29,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:49:29" (1/1) ... [2021-06-05 19:49:29,620 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 19:49:29,621 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 19:49:29,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 19:49:29,621 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 19:49:29,622 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:49:29" (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-05 19:49:29,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 19:49:29,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-05 19:49:29,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 19:49:29,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 19:49:29,718 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-05 19:49:29,719 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-05 19:49:29,719 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-05 19:49:29,720 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-05 19:49:29,720 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-05 19:49:29,720 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-05 19:49:29,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 19:49:29,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-05 19:49:29,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 19:49:29,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 19:49:29,721 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 19:49:31,064 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 19:49:31,064 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-05 19:49:31,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 07:49:31 BoogieIcfgContainer [2021-06-05 19:49:31,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 19:49:31,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 19:49:31,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 19:49:31,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 19:49:31,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 07:49:29" (1/3) ... [2021-06-05 19:49:31,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8fc91e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 07:49:31, skipping insertion in model container [2021-06-05 19:49:31,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:49:29" (2/3) ... [2021-06-05 19:49:31,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8fc91e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 07:49:31, skipping insertion in model container [2021-06-05 19:49:31,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 07:49:31" (3/3) ... [2021-06-05 19:49:31,070 INFO L111 eAbstractionObserver]: Analyzing ICFG safe001_pso.oepc.i [2021-06-05 19:49:31,075 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 19:49:31,075 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 19:49:31,075 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-05 19:49:31,075 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 19:49:31,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,095 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,095 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,096 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,096 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,096 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,096 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,096 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,096 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,096 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,096 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,096 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,096 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,097 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,097 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,097 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,097 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,097 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,097 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,098 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,098 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,098 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,098 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,098 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,098 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,099 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,099 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,099 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,099 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,099 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,099 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,101 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,102 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,102 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,102 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,102 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,102 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,102 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,102 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,102 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,102 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,102 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,102 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,102 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,102 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,102 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,106 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,106 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,108 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,108 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,108 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,110 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,110 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:49:31,111 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 19:49:31,124 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 19:49:31,136 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 19:49:31,136 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 19:49:31,136 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 19:49:31,136 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 19:49:31,136 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 19:49:31,136 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 19:49:31,136 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 19:49:31,136 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1======== [2021-06-05 19:49:31,143 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 114 places, 106 transitions, 227 flow [2021-06-05 19:49:31,848 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 16151 states, 16147 states have (on average 3.6356598748993623) internal successors, (58705), 16150 states have internal predecessors, (58705), 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-05 19:49:31,877 INFO L276 IsEmpty]: Start isEmpty. Operand has 16151 states, 16147 states have (on average 3.6356598748993623) internal successors, (58705), 16150 states have internal predecessors, (58705), 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-05 19:49:31,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 19:49:31,978 INFO L301 ceAbstractionStarter]: Result for error location P1 was SAFE (1/3) [2021-06-05 19:49:31,979 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 19:49:31,981 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 19:49:31,981 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 19:49:31,981 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 19:49:31,981 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 19:49:31,981 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 19:49:31,981 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 19:49:31,981 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 19:49:31,981 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1Thread1of1ForFork1======== [2021-06-05 19:49:31,984 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 114 places, 106 transitions, 227 flow [2021-06-05 19:49:32,470 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 16151 states, 16147 states have (on average 3.6356598748993623) internal successors, (58705), 16150 states have internal predecessors, (58705), 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-05 19:49:32,494 INFO L276 IsEmpty]: Start isEmpty. Operand has 16151 states, 16147 states have (on average 3.6356598748993623) internal successors, (58705), 16150 states have internal predecessors, (58705), 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-05 19:49:32,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-05 19:49:32,496 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:49:32,496 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] [2021-06-05 19:49:32,497 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:49:32,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:49:32,500 INFO L82 PathProgramCache]: Analyzing trace with hash -591144752, now seen corresponding path program 1 times [2021-06-05 19:49:32,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:49:32,506 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473343223] [2021-06-05 19:49:32,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:49:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:49:32,766 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-05 19:49:32,766 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:49:32,767 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473343223] [2021-06-05 19:49:32,767 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473343223] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:49:32,767 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:49:32,767 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 19:49:32,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768498648] [2021-06-05 19:49:32,770 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 19:49:32,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:49:32,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 19:49:32,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 19:49:32,801 INFO L87 Difference]: Start difference. First operand has 16151 states, 16147 states have (on average 3.6356598748993623) internal successors, (58705), 16150 states have internal predecessors, (58705), 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 24.0) internal successors, (48), 3 states have internal predecessors, (48), 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-05 19:49:32,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:49:32,965 INFO L93 Difference]: Finished difference Result 13855 states and 49120 transitions. [2021-06-05 19:49:32,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 19:49:32,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 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 48 [2021-06-05 19:49:32,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:49:32,970 INFO L225 Difference]: With dead ends: 13855 [2021-06-05 19:49:32,971 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 19:49:32,972 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 19:49:32,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 19:49:32,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 19:49:32,985 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-05 19:49:32,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 19:49:32,986 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2021-06-05 19:49:32,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:49:32,986 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 19:49:32,987 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 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-05 19:49:32,987 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 19:49:32,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 19:49:32,987 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 19:49:32,987 INFO L301 ceAbstractionStarter]: Result for error location P1Thread1of1ForFork1 was SAFE (2/3) [2021-06-05 19:49:32,988 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-05 19:49:32,994 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 19:49:32,994 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 19:49:32,994 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 19:49:32,994 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 19:49:32,994 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 19:49:32,994 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 19:49:32,994 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 19:49:32,994 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-05 19:49:32,996 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 114 places, 106 transitions, 227 flow [2021-06-05 19:49:33,547 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 16151 states, 16147 states have (on average 3.6356598748993623) internal successors, (58705), 16150 states have internal predecessors, (58705), 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-05 19:49:33,577 INFO L276 IsEmpty]: Start isEmpty. Operand has 16151 states, 16147 states have (on average 3.6356598748993623) internal successors, (58705), 16150 states have internal predecessors, (58705), 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-05 19:49:33,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-06-05 19:49:33,593 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:49:33,593 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-05 19:49:33,593 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:49:33,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:49:33,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1192679358, now seen corresponding path program 1 times [2021-06-05 19:49:33,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:49:33,594 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231623703] [2021-06-05 19:49:33,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:49:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:49:33,734 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-05 19:49:33,734 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:49:33,736 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231623703] [2021-06-05 19:49:33,737 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231623703] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:49:33,737 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:49:33,737 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 19:49:33,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549283345] [2021-06-05 19:49:33,737 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 19:49:33,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:49:33,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 19:49:33,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 19:49:33,756 INFO L87 Difference]: Start difference. First operand has 16151 states, 16147 states have (on average 3.6356598748993623) internal successors, (58705), 16150 states have internal predecessors, (58705), 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-05 19:49:34,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:49:34,149 INFO L93 Difference]: Finished difference Result 22103 states and 78369 transitions. [2021-06-05 19:49:34,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 19:49:34,150 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-05 19:49:34,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:49:34,207 INFO L225 Difference]: With dead ends: 22103 [2021-06-05 19:49:34,207 INFO L226 Difference]: Without dead ends: 8663 [2021-06-05 19:49:34,208 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 69.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 19:49:34,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8663 states. [2021-06-05 19:49:34,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8663 to 8663. [2021-06-05 19:49:34,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8663 states, 8661 states have (on average 3.4833160143170536) internal successors, (30169), 8662 states have internal predecessors, (30169), 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-05 19:49:34,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8663 states to 8663 states and 30169 transitions. [2021-06-05 19:49:34,529 INFO L78 Accepts]: Start accepts. Automaton has 8663 states and 30169 transitions. Word has length 67 [2021-06-05 19:49:34,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:49:34,530 INFO L482 AbstractCegarLoop]: Abstraction has 8663 states and 30169 transitions. [2021-06-05 19:49:34,530 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-05 19:49:34,530 INFO L276 IsEmpty]: Start isEmpty. Operand 8663 states and 30169 transitions. [2021-06-05 19:49:34,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-06-05 19:49:34,543 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:49:34,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] [2021-06-05 19:49:34,543 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 19:49:34,543 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:49:34,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:49:34,544 INFO L82 PathProgramCache]: Analyzing trace with hash -2102231828, now seen corresponding path program 1 times [2021-06-05 19:49:34,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:49:34,544 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740323549] [2021-06-05 19:49:34,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:49:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:49:34,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-05 19:49:34,634 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:49:34,634 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740323549] [2021-06-05 19:49:34,634 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740323549] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:49:34,634 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:49:34,634 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 19:49:34,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970704060] [2021-06-05 19:49:34,635 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 19:49:34,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:49:34,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 19:49:34,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 19:49:34,636 INFO L87 Difference]: Start difference. First operand 8663 states and 30169 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-05 19:49:34,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:49:34,763 INFO L93 Difference]: Finished difference Result 9863 states and 34029 transitions. [2021-06-05 19:49:34,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 19:49:34,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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 70 [2021-06-05 19:49:34,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:49:34,800 INFO L225 Difference]: With dead ends: 9863 [2021-06-05 19:49:34,800 INFO L226 Difference]: Without dead ends: 7943 [2021-06-05 19:49:34,800 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 64.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 19:49:34,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7943 states. [2021-06-05 19:49:35,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7943 to 7943. [2021-06-05 19:49:35,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7943 states, 7941 states have (on average 3.462158418335222) internal successors, (27493), 7942 states have internal predecessors, (27493), 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-05 19:49:35,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7943 states to 7943 states and 27493 transitions. [2021-06-05 19:49:35,131 INFO L78 Accepts]: Start accepts. Automaton has 7943 states and 27493 transitions. Word has length 70 [2021-06-05 19:49:35,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:49:35,131 INFO L482 AbstractCegarLoop]: Abstraction has 7943 states and 27493 transitions. [2021-06-05 19:49:35,132 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-05 19:49:35,132 INFO L276 IsEmpty]: Start isEmpty. Operand 7943 states and 27493 transitions. [2021-06-05 19:49:35,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 19:49:35,145 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:49:35,146 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-05 19:49:35,146 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 19:49:35,146 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:49:35,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:49:35,146 INFO L82 PathProgramCache]: Analyzing trace with hash -209930293, now seen corresponding path program 1 times [2021-06-05 19:49:35,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:49:35,146 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238487026] [2021-06-05 19:49:35,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:49:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:49:35,294 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-05 19:49:35,294 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:49:35,295 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238487026] [2021-06-05 19:49:35,295 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238487026] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:49:35,295 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:49:35,295 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 19:49:35,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345613932] [2021-06-05 19:49:35,296 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 19:49:35,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:49:35,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 19:49:35,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 19:49:35,297 INFO L87 Difference]: Start difference. First operand 7943 states and 27493 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-05 19:49:35,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:49:35,425 INFO L93 Difference]: Finished difference Result 12833 states and 44300 transitions. [2021-06-05 19:49:35,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 19:49:35,425 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-05 19:49:35,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:49:35,449 INFO L225 Difference]: With dead ends: 12833 [2021-06-05 19:49:35,449 INFO L226 Difference]: Without dead ends: 7085 [2021-06-05 19:49:35,449 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 60.8ms TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-06-05 19:49:35,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7085 states. [2021-06-05 19:49:35,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7085 to 7085. [2021-06-05 19:49:35,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7085 states, 7083 states have (on average 3.4427502470704505) internal successors, (24385), 7084 states have internal predecessors, (24385), 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-05 19:49:35,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7085 states to 7085 states and 24385 transitions. [2021-06-05 19:49:35,694 INFO L78 Accepts]: Start accepts. Automaton has 7085 states and 24385 transitions. Word has length 72 [2021-06-05 19:49:35,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:49:35,695 INFO L482 AbstractCegarLoop]: Abstraction has 7085 states and 24385 transitions. [2021-06-05 19:49:35,695 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-05 19:49:35,695 INFO L276 IsEmpty]: Start isEmpty. Operand 7085 states and 24385 transitions. [2021-06-05 19:49:35,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 19:49:35,704 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:49:35,704 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-05 19:49:35,705 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 19:49:35,705 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:49:35,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:49:35,705 INFO L82 PathProgramCache]: Analyzing trace with hash 733921585, now seen corresponding path program 2 times [2021-06-05 19:49:35,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:49:35,705 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247667796] [2021-06-05 19:49:35,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:49:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:49:35,839 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-05 19:49:35,839 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:49:35,839 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247667796] [2021-06-05 19:49:35,840 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247667796] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:49:35,840 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:49:35,840 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 19:49:35,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208115135] [2021-06-05 19:49:35,840 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 19:49:35,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:49:35,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 19:49:35,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 19:49:35,841 INFO L87 Difference]: Start difference. First operand 7085 states and 24385 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 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-05 19:49:35,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:49:35,952 INFO L93 Difference]: Finished difference Result 7685 states and 26265 transitions. [2021-06-05 19:49:35,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 19:49:35,952 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 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-05 19:49:35,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:49:35,970 INFO L225 Difference]: With dead ends: 7685 [2021-06-05 19:49:35,970 INFO L226 Difference]: Without dead ends: 6725 [2021-06-05 19:49:35,971 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 71.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 19:49:35,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6725 states. [2021-06-05 19:49:36,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6725 to 6725. [2021-06-05 19:49:36,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6725 states, 6723 states have (on average 3.432544994793991) internal successors, (23077), 6724 states have internal predecessors, (23077), 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-05 19:49:36,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6725 states to 6725 states and 23077 transitions. [2021-06-05 19:49:36,145 INFO L78 Accepts]: Start accepts. Automaton has 6725 states and 23077 transitions. Word has length 72 [2021-06-05 19:49:36,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:49:36,145 INFO L482 AbstractCegarLoop]: Abstraction has 6725 states and 23077 transitions. [2021-06-05 19:49:36,145 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 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-05 19:49:36,145 INFO L276 IsEmpty]: Start isEmpty. Operand 6725 states and 23077 transitions. [2021-06-05 19:49:36,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 19:49:36,155 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:49:36,156 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-05 19:49:36,156 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 19:49:36,156 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:49:36,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:49:36,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1253443493, now seen corresponding path program 1 times [2021-06-05 19:49:36,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:49:36,157 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487724768] [2021-06-05 19:49:36,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:49:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:49:36,336 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-05 19:49:36,336 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:49:36,336 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487724768] [2021-06-05 19:49:36,336 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487724768] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:49:36,336 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:49:36,336 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 19:49:36,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962877152] [2021-06-05 19:49:36,337 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 19:49:36,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:49:36,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 19:49:36,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 19:49:36,337 INFO L87 Difference]: Start difference. First operand 6725 states and 23077 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-05 19:49:36,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:49:36,437 INFO L93 Difference]: Finished difference Result 9365 states and 32039 transitions. [2021-06-05 19:49:36,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 19:49:36,437 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-05 19:49:36,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:49:36,450 INFO L225 Difference]: With dead ends: 9365 [2021-06-05 19:49:36,450 INFO L226 Difference]: Without dead ends: 4443 [2021-06-05 19:49:36,451 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 58.9ms TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-06-05 19:49:36,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4443 states. [2021-06-05 19:49:36,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4443 to 4443. [2021-06-05 19:49:36,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4443 states, 4442 states have (on average 3.3484916704187304) internal successors, (14874), 4442 states have internal predecessors, (14874), 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-05 19:49:36,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4443 states to 4443 states and 14874 transitions. [2021-06-05 19:49:36,531 INFO L78 Accepts]: Start accepts. Automaton has 4443 states and 14874 transitions. Word has length 72 [2021-06-05 19:49:36,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:49:36,531 INFO L482 AbstractCegarLoop]: Abstraction has 4443 states and 14874 transitions. [2021-06-05 19:49:36,531 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-05 19:49:36,531 INFO L276 IsEmpty]: Start isEmpty. Operand 4443 states and 14874 transitions. [2021-06-05 19:49:36,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 19:49:36,537 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:49:36,537 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-05 19:49:36,538 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 19:49:36,538 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:49:36,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:49:36,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1150352110, now seen corresponding path program 1 times [2021-06-05 19:49:36,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:49:36,538 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653242680] [2021-06-05 19:49:36,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:49:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:49:36,608 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-05 19:49:36,608 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:49:36,608 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653242680] [2021-06-05 19:49:36,609 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653242680] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:49:36,609 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:49:36,609 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 19:49:36,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583820443] [2021-06-05 19:49:36,609 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 19:49:36,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:49:36,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 19:49:36,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 19:49:36,611 INFO L87 Difference]: Start difference. First operand 4443 states and 14874 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 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-05 19:49:36,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:49:36,732 INFO L93 Difference]: Finished difference Result 6333 states and 21201 transitions. [2021-06-05 19:49:36,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 19:49:36,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 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-05 19:49:36,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:49:36,740 INFO L225 Difference]: With dead ends: 6333 [2021-06-05 19:49:36,740 INFO L226 Difference]: Without dead ends: 3243 [2021-06-05 19:49:36,741 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 93.1ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-06-05 19:49:36,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3243 states. [2021-06-05 19:49:36,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3243 to 3243. [2021-06-05 19:49:36,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3243 states, 3242 states have (on average 3.283158544108575) internal successors, (10644), 3242 states have internal predecessors, (10644), 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-05 19:49:36,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3243 states to 3243 states and 10644 transitions. [2021-06-05 19:49:36,800 INFO L78 Accepts]: Start accepts. Automaton has 3243 states and 10644 transitions. Word has length 74 [2021-06-05 19:49:36,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:49:36,800 INFO L482 AbstractCegarLoop]: Abstraction has 3243 states and 10644 transitions. [2021-06-05 19:49:36,800 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 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-05 19:49:36,800 INFO L276 IsEmpty]: Start isEmpty. Operand 3243 states and 10644 transitions. [2021-06-05 19:49:36,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-06-05 19:49:36,805 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:49:36,805 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-05 19:49:36,805 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 19:49:36,805 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:49:36,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:49:36,806 INFO L82 PathProgramCache]: Analyzing trace with hash 813228213, now seen corresponding path program 1 times [2021-06-05 19:49:36,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:49:36,806 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685656054] [2021-06-05 19:49:36,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:49:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:49:37,015 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-05 19:49:37,015 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:49:37,015 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685656054] [2021-06-05 19:49:37,015 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685656054] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:49:37,015 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:49:37,015 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 19:49:37,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749220635] [2021-06-05 19:49:37,016 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 19:49:37,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:49:37,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 19:49:37,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 19:49:37,016 INFO L87 Difference]: Start difference. First operand 3243 states and 10644 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-05 19:49:37,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:49:37,190 INFO L93 Difference]: Finished difference Result 3856 states and 12587 transitions. [2021-06-05 19:49:37,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 19:49:37,190 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-05 19:49:37,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:49:37,197 INFO L225 Difference]: With dead ends: 3856 [2021-06-05 19:49:37,197 INFO L226 Difference]: Without dead ends: 3256 [2021-06-05 19:49:37,198 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 131.6ms TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2021-06-05 19:49:37,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3256 states. [2021-06-05 19:49:37,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3256 to 3256. [2021-06-05 19:49:37,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3256 states, 3255 states have (on average 3.2798771121351766) internal successors, (10676), 3255 states have internal predecessors, (10676), 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-05 19:49:37,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3256 states to 3256 states and 10676 transitions. [2021-06-05 19:49:37,253 INFO L78 Accepts]: Start accepts. Automaton has 3256 states and 10676 transitions. Word has length 75 [2021-06-05 19:49:37,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:49:37,253 INFO L482 AbstractCegarLoop]: Abstraction has 3256 states and 10676 transitions. [2021-06-05 19:49:37,253 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-05 19:49:37,253 INFO L276 IsEmpty]: Start isEmpty. Operand 3256 states and 10676 transitions. [2021-06-05 19:49:37,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-06-05 19:49:37,257 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:49:37,257 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-05 19:49:37,258 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 19:49:37,258 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:49:37,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:49:37,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1097551391, now seen corresponding path program 2 times [2021-06-05 19:49:37,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:49:37,262 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896327991] [2021-06-05 19:49:37,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:49:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:49:37,426 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-05 19:49:37,426 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:49:37,426 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896327991] [2021-06-05 19:49:37,427 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896327991] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:49:37,428 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:49:37,428 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 19:49:37,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171010250] [2021-06-05 19:49:37,429 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 19:49:37,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:49:37,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 19:49:37,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-06-05 19:49:37,430 INFO L87 Difference]: Start difference. First operand 3256 states and 10676 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-05 19:49:37,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:49:37,664 INFO L93 Difference]: Finished difference Result 3850 states and 12563 transitions. [2021-06-05 19:49:37,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 19:49:37,664 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-05 19:49:37,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:49:37,672 INFO L225 Difference]: With dead ends: 3850 [2021-06-05 19:49:37,673 INFO L226 Difference]: Without dead ends: 3250 [2021-06-05 19:49:37,673 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 138.6ms TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-06-05 19:49:37,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3250 states. [2021-06-05 19:49:37,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3250 to 3237. [2021-06-05 19:49:37,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3237 states, 3236 states have (on average 3.2818294190358466) internal successors, (10620), 3236 states have internal predecessors, (10620), 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-05 19:49:37,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3237 states to 3237 states and 10620 transitions. [2021-06-05 19:49:37,736 INFO L78 Accepts]: Start accepts. Automaton has 3237 states and 10620 transitions. Word has length 75 [2021-06-05 19:49:37,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:49:37,736 INFO L482 AbstractCegarLoop]: Abstraction has 3237 states and 10620 transitions. [2021-06-05 19:49:37,736 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-05 19:49:37,736 INFO L276 IsEmpty]: Start isEmpty. Operand 3237 states and 10620 transitions. [2021-06-05 19:49:37,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-06-05 19:49:37,740 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:49:37,740 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-05 19:49:37,741 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 19:49:37,741 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:49:37,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:49:37,741 INFO L82 PathProgramCache]: Analyzing trace with hash -674049107, now seen corresponding path program 1 times [2021-06-05 19:49:37,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:49:37,741 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181778195] [2021-06-05 19:49:37,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:49:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:49:37,870 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-05 19:49:37,870 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:49:37,870 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181778195] [2021-06-05 19:49:37,870 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181778195] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:49:37,870 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:49:37,871 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 19:49:37,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216343531] [2021-06-05 19:49:37,871 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 19:49:37,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:49:37,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 19:49:37,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 19:49:37,872 INFO L87 Difference]: Start difference. First operand 3237 states and 10620 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 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-05 19:49:38,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:49:38,125 INFO L93 Difference]: Finished difference Result 4212 states and 13848 transitions. [2021-06-05 19:49:38,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 19:49:38,126 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 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-05 19:49:38,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:49:38,133 INFO L225 Difference]: With dead ends: 4212 [2021-06-05 19:49:38,133 INFO L226 Difference]: Without dead ends: 3616 [2021-06-05 19:49:38,133 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 148.2ms TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-06-05 19:49:38,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3616 states. [2021-06-05 19:49:38,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3616 to 3447. [2021-06-05 19:49:38,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3447 states, 3446 states have (on average 3.292513058618688) internal successors, (11346), 3446 states have internal predecessors, (11346), 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-05 19:49:38,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3447 states to 3447 states and 11346 transitions. [2021-06-05 19:49:38,198 INFO L78 Accepts]: Start accepts. Automaton has 3447 states and 11346 transitions. Word has length 76 [2021-06-05 19:49:38,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:49:38,198 INFO L482 AbstractCegarLoop]: Abstraction has 3447 states and 11346 transitions. [2021-06-05 19:49:38,198 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 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-05 19:49:38,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3447 states and 11346 transitions. [2021-06-05 19:49:38,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-06-05 19:49:38,203 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:49:38,203 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-05 19:49:38,203 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 19:49:38,203 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:49:38,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:49:38,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1971943357, now seen corresponding path program 1 times [2021-06-05 19:49:38,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:49:38,204 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406068737] [2021-06-05 19:49:38,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:49:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:49:38,366 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-05 19:49:38,367 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:49:38,367 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406068737] [2021-06-05 19:49:38,368 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406068737] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:49:38,368 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:49:38,368 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-05 19:49:38,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698305262] [2021-06-05 19:49:38,368 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 19:49:38,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:49:38,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 19:49:38,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-06-05 19:49:38,369 INFO L87 Difference]: Start difference. First operand 3447 states and 11346 transitions. Second operand has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 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-05 19:49:38,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:49:38,647 INFO L93 Difference]: Finished difference Result 3903 states and 12764 transitions. [2021-06-05 19:49:38,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 19:49:38,648 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 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-05 19:49:38,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:49:38,655 INFO L225 Difference]: With dead ends: 3903 [2021-06-05 19:49:38,655 INFO L226 Difference]: Without dead ends: 3423 [2021-06-05 19:49:38,655 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 250.5ms TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2021-06-05 19:49:38,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3423 states. [2021-06-05 19:49:38,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3423 to 3423. [2021-06-05 19:49:38,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3423 states, 3422 states have (on average 3.2893045002922268) internal successors, (11256), 3422 states have internal predecessors, (11256), 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-05 19:49:38,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3423 states to 3423 states and 11256 transitions. [2021-06-05 19:49:38,711 INFO L78 Accepts]: Start accepts. Automaton has 3423 states and 11256 transitions. Word has length 76 [2021-06-05 19:49:38,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:49:38,711 INFO L482 AbstractCegarLoop]: Abstraction has 3423 states and 11256 transitions. [2021-06-05 19:49:38,711 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 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-05 19:49:38,712 INFO L276 IsEmpty]: Start isEmpty. Operand 3423 states and 11256 transitions. [2021-06-05 19:49:38,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-06-05 19:49:38,716 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:49:38,716 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-05 19:49:38,716 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 19:49:38,716 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:49:38,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:49:38,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1079028512, now seen corresponding path program 1 times [2021-06-05 19:49:38,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:49:38,717 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889500767] [2021-06-05 19:49:38,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:49:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:49:38,773 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-05 19:49:38,773 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:49:38,773 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889500767] [2021-06-05 19:49:38,773 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889500767] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:49:38,773 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:49:38,773 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 19:49:38,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464494618] [2021-06-05 19:49:38,774 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 19:49:38,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:49:38,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 19:49:38,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 19:49:38,774 INFO L87 Difference]: Start difference. First operand 3423 states and 11256 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-05 19:49:38,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:49:38,850 INFO L93 Difference]: Finished difference Result 4151 states and 13465 transitions. [2021-06-05 19:49:38,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 19:49:38,851 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-05 19:49:38,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:49:38,857 INFO L225 Difference]: With dead ends: 4151 [2021-06-05 19:49:38,857 INFO L226 Difference]: Without dead ends: 3087 [2021-06-05 19:49:38,857 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 55.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 19:49:38,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3087 states. [2021-06-05 19:49:38,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3087 to 3087. [2021-06-05 19:49:38,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3087 states, 3086 states have (on average 3.2469215813350614) internal successors, (10020), 3086 states have internal predecessors, (10020), 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-05 19:49:38,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3087 states to 3087 states and 10020 transitions. [2021-06-05 19:49:38,919 INFO L78 Accepts]: Start accepts. Automaton has 3087 states and 10020 transitions. Word has length 76 [2021-06-05 19:49:38,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:49:38,919 INFO L482 AbstractCegarLoop]: Abstraction has 3087 states and 10020 transitions. [2021-06-05 19:49:38,919 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-05 19:49:38,919 INFO L276 IsEmpty]: Start isEmpty. Operand 3087 states and 10020 transitions. [2021-06-05 19:49:38,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 19:49:38,924 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:49:38,924 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-05 19:49:38,924 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 19:49:38,924 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:49:38,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:49:38,925 INFO L82 PathProgramCache]: Analyzing trace with hash -132854058, now seen corresponding path program 1 times [2021-06-05 19:49:38,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:49:38,925 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321843107] [2021-06-05 19:49:38,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:49:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:49:38,995 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-05 19:49:38,995 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:49:38,995 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321843107] [2021-06-05 19:49:38,995 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321843107] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:49:38,995 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:49:38,996 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 19:49:38,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738474] [2021-06-05 19:49:38,996 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 19:49:38,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:49:38,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 19:49:38,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 19:49:38,997 INFO L87 Difference]: Start difference. First operand 3087 states and 10020 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-05 19:49:39,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:49:39,089 INFO L93 Difference]: Finished difference Result 3081 states and 9707 transitions. [2021-06-05 19:49:39,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 19:49:39,090 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-05 19:49:39,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:49:39,094 INFO L225 Difference]: With dead ends: 3081 [2021-06-05 19:49:39,095 INFO L226 Difference]: Without dead ends: 2205 [2021-06-05 19:49:39,095 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 75.2ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-05 19:49:39,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2205 states. [2021-06-05 19:49:39,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2205 to 2181. [2021-06-05 19:49:39,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2181 states, 2180 states have (on average 3.1) internal successors, (6758), 2180 states have internal predecessors, (6758), 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-05 19:49:39,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 6758 transitions. [2021-06-05 19:49:39,132 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 6758 transitions. Word has length 77 [2021-06-05 19:49:39,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:49:39,132 INFO L482 AbstractCegarLoop]: Abstraction has 2181 states and 6758 transitions. [2021-06-05 19:49:39,132 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-05 19:49:39,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 6758 transitions. [2021-06-05 19:49:39,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-06-05 19:49:39,135 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:49:39,136 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-05 19:49:39,136 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 19:49:39,136 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:49:39,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:49:39,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1315090985, now seen corresponding path program 1 times [2021-06-05 19:49:39,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:49:39,136 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587638806] [2021-06-05 19:49:39,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:49:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:49:39,211 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-05 19:49:39,211 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:49:39,211 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587638806] [2021-06-05 19:49:39,211 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587638806] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:49:39,211 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:49:39,211 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 19:49:39,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432230894] [2021-06-05 19:49:39,211 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 19:49:39,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:49:39,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 19:49:39,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 19:49:39,212 INFO L87 Difference]: Start difference. First operand 2181 states and 6758 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-05 19:49:39,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:49:39,313 INFO L93 Difference]: Finished difference Result 1731 states and 5195 transitions. [2021-06-05 19:49:39,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 19:49:39,314 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-05 19:49:39,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:49:39,315 INFO L225 Difference]: With dead ends: 1731 [2021-06-05 19:49:39,315 INFO L226 Difference]: Without dead ends: 1263 [2021-06-05 19:49:39,316 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 81.7ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-06-05 19:49:39,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2021-06-05 19:49:39,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1215. [2021-06-05 19:49:39,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 1214 states have (on average 2.9209225700164745) internal successors, (3546), 1214 states have internal predecessors, (3546), 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-05 19:49:39,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 3546 transitions. [2021-06-05 19:49:39,332 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 3546 transitions. Word has length 79 [2021-06-05 19:49:39,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:49:39,332 INFO L482 AbstractCegarLoop]: Abstraction has 1215 states and 3546 transitions. [2021-06-05 19:49:39,332 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-05 19:49:39,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 3546 transitions. [2021-06-05 19:49:39,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-05 19:49:39,334 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:49:39,334 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-05 19:49:39,334 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 19:49:39,334 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:49:39,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:49:39,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1050652048, now seen corresponding path program 1 times [2021-06-05 19:49:39,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:49:39,335 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999504913] [2021-06-05 19:49:39,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:49:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 19:49:39,368 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 19:49:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 19:49:39,422 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 19:49:39,459 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 19:49:39,460 INFO L655 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 19:49:39,460 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 19:49:39,460 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (3/3) [2021-06-05 19:49:39,461 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 19:49:39,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 07:49:39 BasicIcfg [2021-06-05 19:49:39,567 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 19:49:39,567 INFO L168 Benchmark]: Toolchain (without parser) took 10472.31 ms. Allocated memory was 354.4 MB in the beginning and 4.2 GB in the end (delta: 3.9 GB). Free memory was 316.5 MB in the beginning and 3.3 GB in the end (delta: -3.0 GB). Peak memory consumption was 884.2 MB. Max. memory is 16.0 GB. [2021-06-05 19:49:39,567 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 354.4 MB. Free memory was 334.7 MB in the beginning and 334.6 MB in the end (delta: 71.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 19:49:39,568 INFO L168 Benchmark]: CACSL2BoogieTranslator took 460.42 ms. Allocated memory is still 354.4 MB. Free memory was 316.3 MB in the beginning and 313.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. [2021-06-05 19:49:39,568 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.58 ms. Allocated memory is still 354.4 MB. Free memory was 313.1 MB in the beginning and 310.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 19:49:39,568 INFO L168 Benchmark]: Boogie Preprocessor took 24.37 ms. Allocated memory is still 354.4 MB. Free memory was 310.0 MB in the beginning and 307.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 19:49:39,569 INFO L168 Benchmark]: RCFGBuilder took 1444.76 ms. Allocated memory is still 354.4 MB. Free memory was 307.9 MB in the beginning and 240.3 MB in the end (delta: 67.6 MB). Peak memory consumption was 144.1 MB. Max. memory is 16.0 GB. [2021-06-05 19:49:39,573 INFO L168 Benchmark]: TraceAbstraction took 8499.84 ms. Allocated memory was 354.4 MB in the beginning and 4.2 GB in the end (delta: 3.9 GB). Free memory was 239.2 MB in the beginning and 3.3 GB in the end (delta: -3.1 GB). Peak memory consumption was 806.2 MB. Max. memory is 16.0 GB. [2021-06-05 19:49:39,573 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.13 ms. Allocated memory is still 354.4 MB. Free memory was 334.7 MB in the beginning and 334.6 MB in the end (delta: 71.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 460.42 ms. Allocated memory is still 354.4 MB. Free memory was 316.3 MB in the beginning and 313.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 37.58 ms. Allocated memory is still 354.4 MB. Free memory was 313.1 MB in the beginning and 310.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 24.37 ms. Allocated memory is still 354.4 MB. Free memory was 310.0 MB in the beginning and 307.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1444.76 ms. Allocated memory is still 354.4 MB. Free memory was 307.9 MB in the beginning and 240.3 MB in the end (delta: 67.6 MB). Peak memory consumption was 144.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 8499.84 ms. Allocated memory was 354.4 MB in the beginning and 4.2 GB in the end (delta: 3.9 GB). Free memory was 239.2 MB in the beginning and 3.3 GB in the end (delta: -3.1 GB). Peak memory consumption was 806.2 MB. 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L718] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L719] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L720] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L721] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L722] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L723] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L724] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L725] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L726] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L727] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L728] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L729] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L730] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L731] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L732] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L733] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L735] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L818] 0 pthread_t t1807; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L819] FCALL, FORK 0 pthread_create(&t1807, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] 0 pthread_t t1808; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L821] FCALL, FORK 0 pthread_create(&t1808, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L822] 0 pthread_t t1809; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L823] FCALL, FORK 0 pthread_create(&t1809, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __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=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __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=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __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=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P1 with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 843.4ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 129.2ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 711.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=16151occurred 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: P1Thread1of1ForFork1 with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1006.0ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 25.6ms, AutomataDifference: 200.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 488.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 94 SDtfs, 42 SDslu, 72 SDs, 0 SdLazy, 11 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=16151occurred 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: 6.2ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 7.3ms SsaConstructionTime, 53.9ms SatisfiabilityAnalysisTime, 114.3ms InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 89 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 - 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: 6466.0ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 128.1ms, AutomataDifference: 2424.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 552.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1727 SDtfs, 2415 SDslu, 6136 SDs, 0 SdLazy, 809 SolverSat, 122 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 584.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 180 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1300.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=16151occurred in iteration=0, InterpolantAutomatonStates: 138, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1561.0ms AutomataMinimizationTime, 13 MinimizatonAttempts, 254 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 36.9ms SsaConstructionTime, 343.1ms SatisfiabilityAnalysisTime, 1231.6ms InterpolantComputationTime, 1043 NumberOfCodeBlocks, 1043 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 948 ConstructedInterpolants, 0 QuantifiedInterpolants, 4382 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...