/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe034_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 22:04:58,064 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 22:04:58,068 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 22:04:58,108 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 22:04:58,108 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 22:04:58,110 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 22:04:58,111 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 22:04:58,113 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 22:04:58,114 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 22:04:58,115 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 22:04:58,116 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 22:04:58,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 22:04:58,118 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 22:04:58,119 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 22:04:58,120 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 22:04:58,121 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 22:04:58,122 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 22:04:58,126 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 22:04:58,128 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 22:04:58,135 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 22:04:58,137 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 22:04:58,140 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 22:04:58,141 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 22:04:58,142 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 22:04:58,145 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 22:04:58,145 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 22:04:58,145 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 22:04:58,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 22:04:58,147 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 22:04:58,147 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 22:04:58,148 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 22:04:58,148 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 22:04:58,149 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 22:04:58,150 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 22:04:58,151 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 22:04:58,151 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 22:04:58,152 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 22:04:58,152 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 22:04:58,152 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 22:04:58,153 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 22:04:58,154 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 22:04:58,155 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-21 22:04:58,178 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 22:04:58,178 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 22:04:58,180 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 22:04:58,180 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 22:04:58,180 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 22:04:58,180 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 22:04:58,181 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 22:04:58,181 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 22:04:58,181 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 22:04:58,181 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 22:04:58,181 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 22:04:58,182 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 22:04:58,182 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 22:04:58,182 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 22:04:58,182 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 22:04:58,182 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 22:04:58,183 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 22:04:58,183 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 22:04:58,183 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 22:04:58,183 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 22:04:58,183 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 22:04:58,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 22:04:58,184 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 22:04:58,184 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-21 22:04:58,184 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 22:04:58,184 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 22:04:58,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 22:04:58,185 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 22:04:58,185 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-21 22:04:58,185 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-21 22:04:58,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 22:04:58,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 22:04:58,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 22:04:58,567 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 22:04:58,568 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 22:04:58,569 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe034_rmo.opt.i [2020-10-21 22:04:58,646 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a41fae6a3/1a304dc6a6a6463d92c80d5c8170aadb/FLAG5d8890c4e [2020-10-21 22:04:59,241 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 22:04:59,242 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_rmo.opt.i [2020-10-21 22:04:59,256 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a41fae6a3/1a304dc6a6a6463d92c80d5c8170aadb/FLAG5d8890c4e [2020-10-21 22:04:59,568 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a41fae6a3/1a304dc6a6a6463d92c80d5c8170aadb [2020-10-21 22:04:59,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 22:04:59,584 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 22:04:59,585 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 22:04:59,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 22:04:59,589 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 22:04:59,590 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:04:59" (1/1) ... [2020-10-21 22:04:59,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4512dfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:59, skipping insertion in model container [2020-10-21 22:04:59,594 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:04:59" (1/1) ... [2020-10-21 22:04:59,602 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 22:04:59,650 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 22:05:00,122 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 22:05:00,135 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 22:05:00,218 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 22:05:00,304 INFO L208 MainTranslator]: Completed translation [2020-10-21 22:05:00,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:05:00 WrapperNode [2020-10-21 22:05:00,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 22:05:00,305 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 22:05:00,306 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 22:05:00,306 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 22:05:00,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:05:00" (1/1) ... [2020-10-21 22:05:00,336 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:05:00" (1/1) ... [2020-10-21 22:05:00,385 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 22:05:00,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 22:05:00,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 22:05:00,386 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 22:05:00,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:05:00" (1/1) ... [2020-10-21 22:05:00,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:05:00" (1/1) ... [2020-10-21 22:05:00,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:05:00" (1/1) ... [2020-10-21 22:05:00,401 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:05:00" (1/1) ... [2020-10-21 22:05:00,411 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:05:00" (1/1) ... [2020-10-21 22:05:00,415 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:05:00" (1/1) ... [2020-10-21 22:05:00,419 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:05:00" (1/1) ... [2020-10-21 22:05:00,424 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 22:05:00,425 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 22:05:00,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 22:05:00,425 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 22:05:00,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:05:00" (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 [2020-10-21 22:05:00,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 22:05:00,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 22:05:00,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 22:05:00,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 22:05:00,497 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 22:05:00,498 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 22:05:00,498 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 22:05:00,498 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 22:05:00,498 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-21 22:05:00,498 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-21 22:05:00,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 22:05:00,499 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 22:05:00,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 22:05:00,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 22:05:00,501 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 22:05:02,432 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 22:05:02,433 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 22:05:02,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:05:02 BoogieIcfgContainer [2020-10-21 22:05:02,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 22:05:02,437 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 22:05:02,437 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 22:05:02,440 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 22:05:02,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 10:04:59" (1/3) ... [2020-10-21 22:05:02,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4380cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:05:02, skipping insertion in model container [2020-10-21 22:05:02,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:05:00" (2/3) ... [2020-10-21 22:05:02,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4380cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:05:02, skipping insertion in model container [2020-10-21 22:05:02,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:05:02" (3/3) ... [2020-10-21 22:05:02,445 INFO L111 eAbstractionObserver]: Analyzing ICFG safe034_rmo.opt.i [2020-10-21 22:05:02,457 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 22:05:02,457 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-21 22:05:02,465 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 22:05:02,466 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 22:05:02,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,498 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,498 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,498 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,499 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,500 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,506 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,506 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,506 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,506 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,506 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,507 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,508 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,509 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,509 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,510 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,510 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,510 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,510 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,510 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,511 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,511 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,511 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,511 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,512 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,521 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,524 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,528 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,529 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,529 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,535 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,536 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:05:02,537 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 22:05:02,552 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-21 22:05:02,574 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 22:05:02,574 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 22:05:02,574 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-21 22:05:02,575 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 22:05:02,575 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 22:05:02,575 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 22:05:02,575 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 22:05:02,575 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 22:05:02,590 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-21 22:05:02,593 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 100 transitions, 215 flow [2020-10-21 22:05:02,595 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 100 transitions, 215 flow [2020-10-21 22:05:02,598 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 107 places, 100 transitions, 215 flow [2020-10-21 22:05:02,648 INFO L129 PetriNetUnfolder]: 3/97 cut-off events. [2020-10-21 22:05:02,648 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 22:05:02,654 INFO L80 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 3/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2020-10-21 22:05:02,657 INFO L116 LiptonReduction]: Number of co-enabled transitions 1648 [2020-10-21 22:05:02,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-21 22:05:02,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:05:02,905 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 22:05:02,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:05:02,908 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 22:05:02,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:05:03,237 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:05:03,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:05:03,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 22:05:03,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:05:03,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 22:05:03,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:05:03,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 22:05:03,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:05:03,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-21 22:05:03,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:05:03,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 22:05:03,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:05:03,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 22:05:03,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:05:03,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 22:05:03,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-21 22:05:03,307 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 22:05:03,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:05:03,473 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-21 22:05:03,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:05:03,475 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-21 22:05:03,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:05:03,477 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-21 22:05:03,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:05:03,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-21 22:05:03,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:05:03,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-21 22:05:03,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:05:03,831 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-21 22:05:03,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:05:03,899 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 22:05:03,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-21 22:05:03,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 22:05:03,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:05:03,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:05:03,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:05:03,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 22:05:03,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:05:03,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 22:05:03,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:05:03,949 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 22:05:03,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:05:03,951 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-21 22:05:03,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:05:03,953 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 22:05:03,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:05:03,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 22:05:03,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:05:03,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-21 22:05:03,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:05:04,820 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2020-10-21 22:05:05,309 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2020-10-21 22:05:06,162 WARN L193 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2020-10-21 22:05:06,333 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-10-21 22:05:06,340 INFO L131 LiptonReduction]: Checked pairs total: 3735 [2020-10-21 22:05:06,341 INFO L133 LiptonReduction]: Total number of compositions: 89 [2020-10-21 22:05:06,347 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 26 transitions, 67 flow [2020-10-21 22:05:06,390 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 618 states. [2020-10-21 22:05:06,392 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states. [2020-10-21 22:05:06,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-21 22:05:06,403 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:05:06,404 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:05:06,404 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:05:06,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:05:06,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1887798330, now seen corresponding path program 1 times [2020-10-21 22:05:06,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:05:06,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124328743] [2020-10-21 22:05:06,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:05:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:05:06,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:05:06,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124328743] [2020-10-21 22:05:06,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:05:06,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 22:05:06,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691239910] [2020-10-21 22:05:06,677 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:05:06,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:05:06,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:05:06,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:05:06,698 INFO L87 Difference]: Start difference. First operand 618 states. Second operand 3 states. [2020-10-21 22:05:06,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:05:06,807 INFO L93 Difference]: Finished difference Result 522 states and 1600 transitions. [2020-10-21 22:05:06,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:05:06,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-21 22:05:06,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:05:06,830 INFO L225 Difference]: With dead ends: 522 [2020-10-21 22:05:06,830 INFO L226 Difference]: Without dead ends: 442 [2020-10-21 22:05:06,832 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:05:06,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2020-10-21 22:05:06,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2020-10-21 22:05:06,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-10-21 22:05:06,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1336 transitions. [2020-10-21 22:05:06,923 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1336 transitions. Word has length 7 [2020-10-21 22:05:06,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:05:06,924 INFO L481 AbstractCegarLoop]: Abstraction has 442 states and 1336 transitions. [2020-10-21 22:05:06,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:05:06,925 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1336 transitions. [2020-10-21 22:05:06,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-21 22:05:06,927 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:05:06,928 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:05:06,928 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 22:05:06,928 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:05:06,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:05:06,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1097353602, now seen corresponding path program 1 times [2020-10-21 22:05:06,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:05:06,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704346463] [2020-10-21 22:05:06,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:05:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:05:07,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:05:07,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704346463] [2020-10-21 22:05:07,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:05:07,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 22:05:07,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850900267] [2020-10-21 22:05:07,088 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 22:05:07,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:05:07,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 22:05:07,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:05:07,089 INFO L87 Difference]: Start difference. First operand 442 states and 1336 transitions. Second operand 4 states. [2020-10-21 22:05:07,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:05:07,125 INFO L93 Difference]: Finished difference Result 506 states and 1468 transitions. [2020-10-21 22:05:07,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:05:07,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-21 22:05:07,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:05:07,130 INFO L225 Difference]: With dead ends: 506 [2020-10-21 22:05:07,131 INFO L226 Difference]: Without dead ends: 426 [2020-10-21 22:05:07,132 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:05:07,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2020-10-21 22:05:07,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2020-10-21 22:05:07,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2020-10-21 22:05:07,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1276 transitions. [2020-10-21 22:05:07,161 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1276 transitions. Word has length 10 [2020-10-21 22:05:07,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:05:07,162 INFO L481 AbstractCegarLoop]: Abstraction has 426 states and 1276 transitions. [2020-10-21 22:05:07,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 22:05:07,162 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1276 transitions. [2020-10-21 22:05:07,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 22:05:07,164 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:05:07,165 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:05:07,165 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 22:05:07,165 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:05:07,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:05:07,166 INFO L82 PathProgramCache]: Analyzing trace with hash -232556567, now seen corresponding path program 1 times [2020-10-21 22:05:07,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:05:07,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951776623] [2020-10-21 22:05:07,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:05:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:05:07,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:05:07,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951776623] [2020-10-21 22:05:07,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:05:07,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:05:07,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720670635] [2020-10-21 22:05:07,277 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 22:05:07,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:05:07,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 22:05:07,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:05:07,278 INFO L87 Difference]: Start difference. First operand 426 states and 1276 transitions. Second operand 4 states. [2020-10-21 22:05:07,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:05:07,309 INFO L93 Difference]: Finished difference Result 374 states and 968 transitions. [2020-10-21 22:05:07,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:05:07,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-21 22:05:07,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:05:07,312 INFO L225 Difference]: With dead ends: 374 [2020-10-21 22:05:07,312 INFO L226 Difference]: Without dead ends: 294 [2020-10-21 22:05:07,313 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:05:07,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-10-21 22:05:07,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2020-10-21 22:05:07,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2020-10-21 22:05:07,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 748 transitions. [2020-10-21 22:05:07,327 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 748 transitions. Word has length 11 [2020-10-21 22:05:07,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:05:07,327 INFO L481 AbstractCegarLoop]: Abstraction has 294 states and 748 transitions. [2020-10-21 22:05:07,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 22:05:07,328 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 748 transitions. [2020-10-21 22:05:07,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 22:05:07,329 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:05:07,330 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:05:07,330 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 22:05:07,330 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:05:07,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:05:07,330 INFO L82 PathProgramCache]: Analyzing trace with hash 674437631, now seen corresponding path program 1 times [2020-10-21 22:05:07,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:05:07,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417468085] [2020-10-21 22:05:07,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:05:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:05:07,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:05:07,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417468085] [2020-10-21 22:05:07,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:05:07,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:05:07,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733711125] [2020-10-21 22:05:07,403 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 22:05:07,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:05:07,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 22:05:07,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:05:07,404 INFO L87 Difference]: Start difference. First operand 294 states and 748 transitions. Second operand 5 states. [2020-10-21 22:05:07,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:05:07,446 INFO L93 Difference]: Finished difference Result 210 states and 473 transitions. [2020-10-21 22:05:07,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:05:07,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-21 22:05:07,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:05:07,448 INFO L225 Difference]: With dead ends: 210 [2020-10-21 22:05:07,449 INFO L226 Difference]: Without dead ends: 166 [2020-10-21 22:05:07,449 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-21 22:05:07,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-10-21 22:05:07,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2020-10-21 22:05:07,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2020-10-21 22:05:07,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 364 transitions. [2020-10-21 22:05:07,454 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 364 transitions. Word has length 13 [2020-10-21 22:05:07,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:05:07,455 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 364 transitions. [2020-10-21 22:05:07,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 22:05:07,455 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 364 transitions. [2020-10-21 22:05:07,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 22:05:07,457 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:05:07,457 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:05:07,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 22:05:07,457 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:05:07,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:05:07,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1010145456, now seen corresponding path program 1 times [2020-10-21 22:05:07,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:05:07,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389828220] [2020-10-21 22:05:07,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:05:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:05:07,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:05:07,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389828220] [2020-10-21 22:05:07,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:05:07,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 22:05:07,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205321098] [2020-10-21 22:05:07,567 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 22:05:07,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:05:07,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 22:05:07,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:05:07,568 INFO L87 Difference]: Start difference. First operand 166 states and 364 transitions. Second operand 6 states. [2020-10-21 22:05:07,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:05:07,622 INFO L93 Difference]: Finished difference Result 137 states and 304 transitions. [2020-10-21 22:05:07,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 22:05:07,622 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-21 22:05:07,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:05:07,624 INFO L225 Difference]: With dead ends: 137 [2020-10-21 22:05:07,624 INFO L226 Difference]: Without dead ends: 126 [2020-10-21 22:05:07,624 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-21 22:05:07,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-10-21 22:05:07,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2020-10-21 22:05:07,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-10-21 22:05:07,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 284 transitions. [2020-10-21 22:05:07,629 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 284 transitions. Word has length 16 [2020-10-21 22:05:07,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:05:07,629 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 284 transitions. [2020-10-21 22:05:07,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 22:05:07,629 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 284 transitions. [2020-10-21 22:05:07,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-21 22:05:07,631 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:05:07,631 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:05:07,631 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 22:05:07,631 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:05:07,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:05:07,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1573307070, now seen corresponding path program 1 times [2020-10-21 22:05:07,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:05:07,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184658955] [2020-10-21 22:05:07,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:05:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:05:07,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:05:07,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184658955] [2020-10-21 22:05:07,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:05:07,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 22:05:07,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948056470] [2020-10-21 22:05:07,773 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 22:05:07,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:05:07,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 22:05:07,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:05:07,774 INFO L87 Difference]: Start difference. First operand 126 states and 284 transitions. Second operand 6 states. [2020-10-21 22:05:07,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:05:07,860 INFO L93 Difference]: Finished difference Result 178 states and 381 transitions. [2020-10-21 22:05:07,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 22:05:07,861 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-21 22:05:07,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:05:07,862 INFO L225 Difference]: With dead ends: 178 [2020-10-21 22:05:07,862 INFO L226 Difference]: Without dead ends: 143 [2020-10-21 22:05:07,863 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-21 22:05:07,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-10-21 22:05:07,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 110. [2020-10-21 22:05:07,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-10-21 22:05:07,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 240 transitions. [2020-10-21 22:05:07,867 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 240 transitions. Word has length 20 [2020-10-21 22:05:07,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:05:07,868 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 240 transitions. [2020-10-21 22:05:07,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 22:05:07,868 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 240 transitions. [2020-10-21 22:05:07,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-21 22:05:07,869 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:05:07,869 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:05:07,869 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 22:05:07,869 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:05:07,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:05:07,870 INFO L82 PathProgramCache]: Analyzing trace with hash -965853822, now seen corresponding path program 2 times [2020-10-21 22:05:07,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:05:07,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279124536] [2020-10-21 22:05:07,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:05:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:05:07,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:05:07,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279124536] [2020-10-21 22:05:07,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:05:07,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:05:07,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360782142] [2020-10-21 22:05:07,951 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 22:05:07,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:05:07,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 22:05:07,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:05:07,952 INFO L87 Difference]: Start difference. First operand 110 states and 240 transitions. Second operand 4 states. [2020-10-21 22:05:07,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:05:07,972 INFO L93 Difference]: Finished difference Result 137 states and 286 transitions. [2020-10-21 22:05:07,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:05:07,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-10-21 22:05:07,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:05:07,973 INFO L225 Difference]: With dead ends: 137 [2020-10-21 22:05:07,973 INFO L226 Difference]: Without dead ends: 56 [2020-10-21 22:05:07,974 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:05:07,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-10-21 22:05:07,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-10-21 22:05:07,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-10-21 22:05:07,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 96 transitions. [2020-10-21 22:05:07,976 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 96 transitions. Word has length 20 [2020-10-21 22:05:07,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:05:07,976 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 96 transitions. [2020-10-21 22:05:07,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 22:05:07,977 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 96 transitions. [2020-10-21 22:05:07,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-21 22:05:07,977 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:05:07,977 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:05:07,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 22:05:07,978 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:05:07,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:05:07,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1548393002, now seen corresponding path program 3 times [2020-10-21 22:05:07,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:05:07,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119125858] [2020-10-21 22:05:07,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:05:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:05:08,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:05:08,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119125858] [2020-10-21 22:05:08,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:05:08,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:05:08,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391148415] [2020-10-21 22:05:08,087 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 22:05:08,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:05:08,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 22:05:08,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:05:08,088 INFO L87 Difference]: Start difference. First operand 56 states and 96 transitions. Second operand 5 states. [2020-10-21 22:05:08,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:05:08,125 INFO L93 Difference]: Finished difference Result 73 states and 122 transitions. [2020-10-21 22:05:08,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:05:08,127 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-10-21 22:05:08,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:05:08,128 INFO L225 Difference]: With dead ends: 73 [2020-10-21 22:05:08,128 INFO L226 Difference]: Without dead ends: 30 [2020-10-21 22:05:08,129 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-21 22:05:08,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-10-21 22:05:08,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-10-21 22:05:08,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-10-21 22:05:08,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2020-10-21 22:05:08,134 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 20 [2020-10-21 22:05:08,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:05:08,134 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2020-10-21 22:05:08,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 22:05:08,134 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2020-10-21 22:05:08,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-21 22:05:08,135 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:05:08,135 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:05:08,135 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 22:05:08,135 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:05:08,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:05:08,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1317260430, now seen corresponding path program 4 times [2020-10-21 22:05:08,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:05:08,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874754392] [2020-10-21 22:05:08,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:05:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 22:05:08,226 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 22:05:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 22:05:08,302 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 22:05:08,362 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 22:05:08,362 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 22:05:08,362 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 22:05:08,394 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:05:08,395 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [789] [2020-10-21 22:05:08,397 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:05:08,398 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:05:08,398 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:05:08,399 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:05:08,399 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:05:08,399 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:05:08,400 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:05:08,400 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:05:08,400 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:05:08,400 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:05:08,400 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:05:08,401 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:05:08,401 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:05:08,401 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:05:08,401 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:05:08,402 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:05:08,402 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:05:08,403 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:05:08,403 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:05:08,403 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:05:08,403 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:05:08,404 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:05:08,404 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:05:08,404 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:05:08,404 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:05:08,405 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:05:08,405 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:05:08,405 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:05:08,406 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:05:08,406 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:05:08,406 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:05:08,406 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:05:08,407 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:05:08,407 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:05:08,412 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:05:08,412 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:05:08,412 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:05:08,413 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:05:08,416 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:05:08,416 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:05:08,417 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:05:08,417 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:05:08,417 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:05:08,417 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:05:08,417 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:05:08,418 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:05:08,418 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:05:08,418 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:05:08,418 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:05:08,418 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:05:08,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 10:05:08 BasicIcfg [2020-10-21 22:05:08,537 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 22:05:08,540 INFO L168 Benchmark]: Toolchain (without parser) took 8960.37 ms. Allocated memory was 139.5 MB in the beginning and 335.5 MB in the end (delta: 196.1 MB). Free memory was 100.7 MB in the beginning and 98.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 197.9 MB. Max. memory is 7.1 GB. [2020-10-21 22:05:08,541 INFO L168 Benchmark]: CDTParser took 3.35 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-21 22:05:08,542 INFO L168 Benchmark]: CACSL2BoogieTranslator took 720.30 ms. Allocated memory was 139.5 MB in the beginning and 201.9 MB in the end (delta: 62.4 MB). Free memory was 99.7 MB in the beginning and 155.2 MB in the end (delta: -55.5 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2020-10-21 22:05:08,544 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.94 ms. Allocated memory is still 201.9 MB. Free memory was 155.2 MB in the beginning and 152.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-21 22:05:08,545 INFO L168 Benchmark]: Boogie Preprocessor took 38.60 ms. Allocated memory is still 201.9 MB. Free memory was 152.6 MB in the beginning and 150.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-21 22:05:08,546 INFO L168 Benchmark]: RCFGBuilder took 2010.79 ms. Allocated memory was 201.9 MB in the beginning and 249.6 MB in the end (delta: 47.7 MB). Free memory was 150.0 MB in the beginning and 217.0 MB in the end (delta: -67.0 MB). Peak memory consumption was 104.3 MB. Max. memory is 7.1 GB. [2020-10-21 22:05:08,549 INFO L168 Benchmark]: TraceAbstraction took 6099.96 ms. Allocated memory was 249.6 MB in the beginning and 335.5 MB in the end (delta: 86.0 MB). Free memory was 217.0 MB in the beginning and 98.9 MB in the end (delta: 118.1 MB). Peak memory consumption was 204.0 MB. Max. memory is 7.1 GB. [2020-10-21 22:05:08,559 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.35 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 720.30 ms. Allocated memory was 139.5 MB in the beginning and 201.9 MB in the end (delta: 62.4 MB). Free memory was 99.7 MB in the beginning and 155.2 MB in the end (delta: -55.5 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.94 ms. Allocated memory is still 201.9 MB. Free memory was 155.2 MB in the beginning and 152.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.60 ms. Allocated memory is still 201.9 MB. Free memory was 152.6 MB in the beginning and 150.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2010.79 ms. Allocated memory was 201.9 MB in the beginning and 249.6 MB in the end (delta: 47.7 MB). Free memory was 150.0 MB in the beginning and 217.0 MB in the end (delta: -67.0 MB). Peak memory consumption was 104.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6099.96 ms. Allocated memory was 249.6 MB in the beginning and 335.5 MB in the end (delta: 86.0 MB). Free memory was 217.0 MB in the beginning and 98.9 MB in the end (delta: 118.1 MB). Peak memory consumption was 204.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1083 VarBasedMoverChecksPositive, 56 VarBasedMoverChecksNegative, 22 SemBasedMoverChecksPositive, 34 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.7s, 100 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.7s, 107 PlacesBefore, 35 PlacesAfterwards, 100 TransitionsBefore, 26 TransitionsAfterwards, 1648 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 89 TotalNumberOfCompositions, 3735 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L827] 0 pthread_t t2592; [L828] FCALL, FORK 0 pthread_create(&t2592, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L829] 0 pthread_t t2593; [L830] FCALL, FORK 0 pthread_create(&t2593, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L831] 0 pthread_t t2594; [L832] FCALL, FORK 0 pthread_create(&t2594, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 [L769] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L769] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L770] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L770] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L771] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L771] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1) [L771] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L771] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L772] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L772] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used) [L772] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L772] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L773] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0 [L773] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L773] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L774] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L775] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EAX = y [L777] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L805] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L806] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L806] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L807] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L807] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L808] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L808] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L809] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L812] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L814] 3 return 0; [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L834] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L3] COND FALSE 0 !(!cond) [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L838] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L838] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L839] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L839] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L840] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L840] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L841] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L841] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L842] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L842] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L845] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe034_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.7s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 180 SDtfs, 218 SDslu, 346 SDs, 0 SdLazy, 105 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=618occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 33 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 137 NumberOfCodeBlocks, 137 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 109 ConstructedInterpolants, 0 QuantifiedInterpolants, 4951 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...