/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/mix024_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 22:40:10,308 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 22:40:10,312 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 22:40:10,354 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 22:40:10,355 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 22:40:10,366 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 22:40:10,368 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 22:40:10,371 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 22:40:10,373 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 22:40:10,375 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 22:40:10,376 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 22:40:10,379 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 22:40:10,379 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 22:40:10,384 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 22:40:10,387 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 22:40:10,389 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 22:40:10,390 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 22:40:10,393 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 22:40:10,395 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 22:40:10,403 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 22:40:10,405 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 22:40:10,407 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 22:40:10,408 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 22:40:10,408 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 22:40:10,413 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 22:40:10,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 22:40:10,413 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 22:40:10,416 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 22:40:10,417 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 22:40:10,419 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 22:40:10,419 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 22:40:10,420 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 22:40:10,421 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 22:40:10,421 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 22:40:10,423 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 22:40:10,423 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 22:40:10,423 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 22:40:10,424 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 22:40:10,424 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 22:40:10,425 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 22:40:10,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 22:40:10,427 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-05 22:40:10,474 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 22:40:10,474 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 22:40:10,477 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 22:40:10,477 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 22:40:10,477 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 22:40:10,477 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 22:40:10,478 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 22:40:10,478 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 22:40:10,478 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 22:40:10,478 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 22:40:10,478 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 22:40:10,480 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 22:40:10,480 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 22:40:10,480 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 22:40:10,481 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 22:40:10,481 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 22:40:10,481 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 22:40:10,481 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 22:40:10,481 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 22:40:10,481 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 22:40:10,482 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 22:40:10,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 22:40:10,482 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 22:40:10,482 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-05 22:40:10,482 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 22:40:10,483 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 22:40:10,483 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 22:40:10,483 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 22:40:10,483 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-05 22:40:10,483 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-05 22:40:10,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 22:40:10,772 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 22:40:10,775 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 22:40:10,777 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 22:40:10,779 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 22:40:10,780 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_tso.opt.i [2020-10-05 22:40:10,848 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed9715b9b/03870272c54d491fa0a5101b5496684e/FLAG5598f0dd6 [2020-10-05 22:40:11,423 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 22:40:11,424 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_tso.opt.i [2020-10-05 22:40:11,449 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed9715b9b/03870272c54d491fa0a5101b5496684e/FLAG5598f0dd6 [2020-10-05 22:40:11,700 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed9715b9b/03870272c54d491fa0a5101b5496684e [2020-10-05 22:40:11,709 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 22:40:11,711 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 22:40:11,712 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 22:40:11,712 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 22:40:11,716 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 22:40:11,717 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:40:11" (1/1) ... [2020-10-05 22:40:11,721 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c056663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:11, skipping insertion in model container [2020-10-05 22:40:11,721 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:40:11" (1/1) ... [2020-10-05 22:40:11,729 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 22:40:11,785 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 22:40:12,308 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 22:40:12,321 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 22:40:12,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 22:40:12,459 INFO L208 MainTranslator]: Completed translation [2020-10-05 22:40:12,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:12 WrapperNode [2020-10-05 22:40:12,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 22:40:12,460 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 22:40:12,461 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 22:40:12,461 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 22:40:12,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:12" (1/1) ... [2020-10-05 22:40:12,490 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:12" (1/1) ... [2020-10-05 22:40:12,524 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 22:40:12,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 22:40:12,524 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 22:40:12,525 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 22:40:12,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:12" (1/1) ... [2020-10-05 22:40:12,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:12" (1/1) ... [2020-10-05 22:40:12,541 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:12" (1/1) ... [2020-10-05 22:40:12,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:12" (1/1) ... [2020-10-05 22:40:12,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:12" (1/1) ... [2020-10-05 22:40:12,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:12" (1/1) ... [2020-10-05 22:40:12,561 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:12" (1/1) ... [2020-10-05 22:40:12,567 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 22:40:12,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 22:40:12,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 22:40:12,568 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 22:40:12,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:12" (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-05 22:40:12,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 22:40:12,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 22:40:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 22:40:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 22:40:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 22:40:12,643 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 22:40:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 22:40:12,644 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 22:40:12,644 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-05 22:40:12,644 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-05 22:40:12,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 22:40:12,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 22:40:12,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 22:40:12,648 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 22:40:14,682 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 22:40:14,683 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 22:40:14,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:40:14 BoogieIcfgContainer [2020-10-05 22:40:14,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 22:40:14,686 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 22:40:14,686 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 22:40:14,690 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 22:40:14,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 10:40:11" (1/3) ... [2020-10-05 22:40:14,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e028b8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:40:14, skipping insertion in model container [2020-10-05 22:40:14,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:12" (2/3) ... [2020-10-05 22:40:14,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e028b8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:40:14, skipping insertion in model container [2020-10-05 22:40:14,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:40:14" (3/3) ... [2020-10-05 22:40:14,694 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_tso.opt.i [2020-10-05 22:40:14,704 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 22:40:14,704 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-05 22:40:14,712 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 22:40:14,714 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 22:40:14,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,747 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,748 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,748 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,748 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,752 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,752 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,754 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,755 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,755 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,762 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,762 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,766 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,770 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,770 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,771 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,771 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,771 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,771 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,771 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,772 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,772 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,777 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,778 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,778 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,778 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,778 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,779 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,779 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,779 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,779 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,779 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,780 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,780 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,780 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,780 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,780 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,781 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,781 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,781 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,781 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,781 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,782 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,782 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,782 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,782 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,782 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,786 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,787 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,787 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,787 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,787 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,788 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,788 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,788 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,788 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,788 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,789 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,789 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:14,804 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-05 22:40:14,825 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 22:40:14,825 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 22:40:14,826 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-05 22:40:14,826 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 22:40:14,826 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 22:40:14,826 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 22:40:14,826 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 22:40:14,826 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 22:40:14,843 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 99 transitions, 213 flow [2020-10-05 22:40:14,845 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 107 places, 99 transitions, 213 flow [2020-10-05 22:40:14,896 INFO L129 PetriNetUnfolder]: 2/96 cut-off events. [2020-10-05 22:40:14,896 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 22:40:14,902 INFO L80 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 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-05 22:40:14,906 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 107 places, 99 transitions, 213 flow [2020-10-05 22:40:14,934 INFO L129 PetriNetUnfolder]: 2/96 cut-off events. [2020-10-05 22:40:14,934 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 22:40:14,935 INFO L80 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 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-05 22:40:14,938 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1928 [2020-10-05 22:40:14,939 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-10-05 22:40:15,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:15,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:15,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:15,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:15,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:15,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:15,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:15,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:15,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:15,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:15,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:15,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:15,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:15,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:15,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:15,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:15,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-05 22:40:15,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:15,693 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-05 22:40:15,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:15,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:15,983 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:15,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:15,986 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:15,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:15,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:15,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:16,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:16,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:16,017 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:16,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:16,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:16,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:16,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:16,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:16,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:16,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:16,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:16,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:16,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:16,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:16,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:16,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:16,384 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:16,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:16,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:16,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:16,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:16,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:16,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:16,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:16,461 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:40:16,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-05 22:40:16,464 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:40:16,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:16,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:16,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:16,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:40:16,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:40:16,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:40:16,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:40:16,514 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:40:16,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:40:16,516 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:40:16,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:16,518 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-05 22:40:16,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:16,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:40:16,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:16,857 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:16,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:16,858 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:16,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:16,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:16,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:16,865 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:16,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:16,880 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:16,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:16,881 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:16,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:16,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:16,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:16,886 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:16,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:17,229 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:17,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:17,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:17,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:17,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:17,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:17,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:17,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:17,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:17,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:17,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:17,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:17,257 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:17,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:17,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:17,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:17,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:17,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:17,345 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:40:17,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:40:17,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:40:17,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:40:17,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:40:17,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:40:17,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:40:17,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:17,353 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-05 22:40:17,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:17,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:40:17,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:17,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:40:17,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-05 22:40:17,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:40:17,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:17,428 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:17,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:17,429 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:17,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:17,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:17,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:17,433 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:17,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:17,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:17,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:17,449 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:17,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:17,451 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:17,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:17,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:17,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:17,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:17,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:17,517 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:17,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:17,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:17,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:17,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:17,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:17,535 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:17,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:17,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:17,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:17,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:17,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:17,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:17,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:18,484 WARN L193 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2020-10-05 22:40:18,606 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-05 22:40:18,616 INFO L206 etLargeBlockEncoding]: Checked pairs total: 4982 [2020-10-05 22:40:18,616 INFO L214 etLargeBlockEncoding]: Total number of compositions: 79 [2020-10-05 22:40:18,620 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 30 transitions, 75 flow [2020-10-05 22:40:18,699 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1346 states. [2020-10-05 22:40:18,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states. [2020-10-05 22:40:18,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 22:40:18,708 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:40:18,709 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 22:40:18,710 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:40:18,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:40:18,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1061971, now seen corresponding path program 1 times [2020-10-05 22:40:18,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:40:18,727 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807460343] [2020-10-05 22:40:18,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:40:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:40:18,932 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-05 22:40:18,933 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807460343] [2020-10-05 22:40:18,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:40:18,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 22:40:18,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736552162] [2020-10-05 22:40:18,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 22:40:18,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:40:18,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 22:40:18,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:40:18,960 INFO L87 Difference]: Start difference. First operand 1346 states. Second operand 3 states. [2020-10-05 22:40:19,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:40:19,062 INFO L93 Difference]: Finished difference Result 1154 states and 3746 transitions. [2020-10-05 22:40:19,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 22:40:19,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 22:40:19,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:40:19,094 INFO L225 Difference]: With dead ends: 1154 [2020-10-05 22:40:19,095 INFO L226 Difference]: Without dead ends: 974 [2020-10-05 22:40:19,096 INFO L675 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-05 22:40:19,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2020-10-05 22:40:19,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2020-10-05 22:40:19,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2020-10-05 22:40:19,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 3122 transitions. [2020-10-05 22:40:19,241 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 3122 transitions. Word has length 3 [2020-10-05 22:40:19,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:40:19,241 INFO L479 AbstractCegarLoop]: Abstraction has 974 states and 3122 transitions. [2020-10-05 22:40:19,241 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 22:40:19,241 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 3122 transitions. [2020-10-05 22:40:19,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-05 22:40:19,244 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:40:19,245 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:40:19,245 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 22:40:19,245 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:40:19,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:40:19,246 INFO L82 PathProgramCache]: Analyzing trace with hash 2142989789, now seen corresponding path program 1 times [2020-10-05 22:40:19,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:40:19,249 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031589518] [2020-10-05 22:40:19,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:40:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:40:19,459 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-05 22:40:19,459 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031589518] [2020-10-05 22:40:19,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:40:19,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 22:40:19,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014177804] [2020-10-05 22:40:19,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 22:40:19,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:40:19,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 22:40:19,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 22:40:19,463 INFO L87 Difference]: Start difference. First operand 974 states and 3122 transitions. Second operand 4 states. [2020-10-05 22:40:19,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:40:19,512 INFO L93 Difference]: Finished difference Result 1130 states and 3486 transitions. [2020-10-05 22:40:19,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 22:40:19,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-05 22:40:19,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:40:19,521 INFO L225 Difference]: With dead ends: 1130 [2020-10-05 22:40:19,522 INFO L226 Difference]: Without dead ends: 950 [2020-10-05 22:40:19,523 INFO L675 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-05 22:40:19,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2020-10-05 22:40:19,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2020-10-05 22:40:19,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2020-10-05 22:40:19,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 3030 transitions. [2020-10-05 22:40:19,597 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 3030 transitions. Word has length 10 [2020-10-05 22:40:19,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:40:19,599 INFO L479 AbstractCegarLoop]: Abstraction has 950 states and 3030 transitions. [2020-10-05 22:40:19,599 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 22:40:19,599 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 3030 transitions. [2020-10-05 22:40:19,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 22:40:19,602 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:40:19,602 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:40:19,602 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 22:40:19,602 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:40:19,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:40:19,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1959622985, now seen corresponding path program 1 times [2020-10-05 22:40:19,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:40:19,603 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332357667] [2020-10-05 22:40:19,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:40:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:40:19,693 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-05 22:40:19,693 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332357667] [2020-10-05 22:40:19,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:40:19,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 22:40:19,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28861373] [2020-10-05 22:40:19,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 22:40:19,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:40:19,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 22:40:19,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 22:40:19,696 INFO L87 Difference]: Start difference. First operand 950 states and 3030 transitions. Second operand 4 states. [2020-10-05 22:40:19,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:40:19,739 INFO L93 Difference]: Finished difference Result 1022 states and 3144 transitions. [2020-10-05 22:40:19,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 22:40:19,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-05 22:40:19,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:40:19,746 INFO L225 Difference]: With dead ends: 1022 [2020-10-05 22:40:19,746 INFO L226 Difference]: Without dead ends: 854 [2020-10-05 22:40:19,747 INFO L675 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-05 22:40:19,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2020-10-05 22:40:19,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 854. [2020-10-05 22:40:19,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2020-10-05 22:40:19,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 2686 transitions. [2020-10-05 22:40:19,776 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 2686 transitions. Word has length 11 [2020-10-05 22:40:19,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:40:19,777 INFO L479 AbstractCegarLoop]: Abstraction has 854 states and 2686 transitions. [2020-10-05 22:40:19,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 22:40:19,777 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 2686 transitions. [2020-10-05 22:40:19,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 22:40:19,780 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:40:19,780 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:40:19,780 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 22:40:19,780 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:40:19,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:40:19,781 INFO L82 PathProgramCache]: Analyzing trace with hash 556366542, now seen corresponding path program 1 times [2020-10-05 22:40:19,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:40:19,781 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325129208] [2020-10-05 22:40:19,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:40:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:40:19,854 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-05 22:40:19,855 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325129208] [2020-10-05 22:40:19,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:40:19,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 22:40:19,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409987628] [2020-10-05 22:40:19,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 22:40:19,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:40:19,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 22:40:19,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 22:40:19,857 INFO L87 Difference]: Start difference. First operand 854 states and 2686 transitions. Second operand 5 states. [2020-10-05 22:40:19,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:40:19,925 INFO L93 Difference]: Finished difference Result 894 states and 2728 transitions. [2020-10-05 22:40:19,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:40:19,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-05 22:40:19,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:40:19,931 INFO L225 Difference]: With dead ends: 894 [2020-10-05 22:40:19,931 INFO L226 Difference]: Without dead ends: 774 [2020-10-05 22:40:19,932 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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-05 22:40:19,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2020-10-05 22:40:19,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 774. [2020-10-05 22:40:19,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-10-05 22:40:19,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 2402 transitions. [2020-10-05 22:40:19,957 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 2402 transitions. Word has length 12 [2020-10-05 22:40:19,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:40:19,958 INFO L479 AbstractCegarLoop]: Abstraction has 774 states and 2402 transitions. [2020-10-05 22:40:19,958 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 22:40:19,958 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 2402 transitions. [2020-10-05 22:40:19,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 22:40:19,960 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:40:19,960 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:40:19,960 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 22:40:19,960 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:40:19,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:40:19,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1154913123, now seen corresponding path program 1 times [2020-10-05 22:40:19,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:40:19,961 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56457594] [2020-10-05 22:40:19,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:40:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:40:20,041 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-05 22:40:20,041 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56457594] [2020-10-05 22:40:20,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:40:20,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 22:40:20,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374452017] [2020-10-05 22:40:20,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 22:40:20,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:40:20,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 22:40:20,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 22:40:20,043 INFO L87 Difference]: Start difference. First operand 774 states and 2402 transitions. Second operand 4 states. [2020-10-05 22:40:20,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:40:20,084 INFO L93 Difference]: Finished difference Result 682 states and 1858 transitions. [2020-10-05 22:40:20,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 22:40:20,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-05 22:40:20,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:40:20,089 INFO L225 Difference]: With dead ends: 682 [2020-10-05 22:40:20,089 INFO L226 Difference]: Without dead ends: 502 [2020-10-05 22:40:20,090 INFO L675 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-05 22:40:20,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2020-10-05 22:40:20,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 502. [2020-10-05 22:40:20,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2020-10-05 22:40:20,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 1314 transitions. [2020-10-05 22:40:20,104 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 1314 transitions. Word has length 14 [2020-10-05 22:40:20,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:40:20,104 INFO L479 AbstractCegarLoop]: Abstraction has 502 states and 1314 transitions. [2020-10-05 22:40:20,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 22:40:20,104 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 1314 transitions. [2020-10-05 22:40:20,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 22:40:20,105 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:40:20,106 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:40:20,106 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 22:40:20,106 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:40:20,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:40:20,106 INFO L82 PathProgramCache]: Analyzing trace with hash -920993858, now seen corresponding path program 1 times [2020-10-05 22:40:20,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:40:20,107 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832101595] [2020-10-05 22:40:20,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:40:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:40:20,198 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-05 22:40:20,198 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832101595] [2020-10-05 22:40:20,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:40:20,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 22:40:20,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388534175] [2020-10-05 22:40:20,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 22:40:20,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:40:20,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 22:40:20,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 22:40:20,200 INFO L87 Difference]: Start difference. First operand 502 states and 1314 transitions. Second operand 5 states. [2020-10-05 22:40:20,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:40:20,253 INFO L93 Difference]: Finished difference Result 386 states and 935 transitions. [2020-10-05 22:40:20,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 22:40:20,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-05 22:40:20,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:40:20,256 INFO L225 Difference]: With dead ends: 386 [2020-10-05 22:40:20,256 INFO L226 Difference]: Without dead ends: 306 [2020-10-05 22:40:20,256 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 22:40:20,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2020-10-05 22:40:20,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2020-10-05 22:40:20,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2020-10-05 22:40:20,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 726 transitions. [2020-10-05 22:40:20,264 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 726 transitions. Word has length 17 [2020-10-05 22:40:20,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:40:20,265 INFO L479 AbstractCegarLoop]: Abstraction has 306 states and 726 transitions. [2020-10-05 22:40:20,265 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 22:40:20,265 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 726 transitions. [2020-10-05 22:40:20,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-05 22:40:20,266 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:40:20,266 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-05 22:40:20,266 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 22:40:20,266 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:40:20,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:40:20,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1904084769, now seen corresponding path program 1 times [2020-10-05 22:40:20,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:40:20,267 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584259994] [2020-10-05 22:40:20,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:40:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:40:20,589 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-05 22:40:20,589 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584259994] [2020-10-05 22:40:20,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:40:20,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-05 22:40:20,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280375038] [2020-10-05 22:40:20,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-05 22:40:20,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:40:20,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-05 22:40:20,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-05 22:40:20,591 INFO L87 Difference]: Start difference. First operand 306 states and 726 transitions. Second operand 10 states. [2020-10-05 22:40:21,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:40:21,021 INFO L93 Difference]: Finished difference Result 439 states and 1041 transitions. [2020-10-05 22:40:21,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-05 22:40:21,022 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-10-05 22:40:21,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:40:21,025 INFO L225 Difference]: With dead ends: 439 [2020-10-05 22:40:21,025 INFO L226 Difference]: Without dead ends: 382 [2020-10-05 22:40:21,026 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2020-10-05 22:40:21,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2020-10-05 22:40:21,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 336. [2020-10-05 22:40:21,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2020-10-05 22:40:21,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 797 transitions. [2020-10-05 22:40:21,037 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 797 transitions. Word has length 20 [2020-10-05 22:40:21,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:40:21,038 INFO L479 AbstractCegarLoop]: Abstraction has 336 states and 797 transitions. [2020-10-05 22:40:21,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-05 22:40:21,038 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 797 transitions. [2020-10-05 22:40:21,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-05 22:40:21,039 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:40:21,039 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-05 22:40:21,039 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 22:40:21,039 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:40:21,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:40:21,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1393225499, now seen corresponding path program 2 times [2020-10-05 22:40:21,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:40:21,040 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079351863] [2020-10-05 22:40:21,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:40:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:40:21,254 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-05 22:40:21,255 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079351863] [2020-10-05 22:40:21,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:40:21,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 22:40:21,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269115899] [2020-10-05 22:40:21,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 22:40:21,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:40:21,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 22:40:21,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 22:40:21,257 INFO L87 Difference]: Start difference. First operand 336 states and 797 transitions. Second operand 6 states. [2020-10-05 22:40:21,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:40:21,306 INFO L93 Difference]: Finished difference Result 303 states and 729 transitions. [2020-10-05 22:40:21,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:40:21,306 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-05 22:40:21,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:40:21,308 INFO L225 Difference]: With dead ends: 303 [2020-10-05 22:40:21,309 INFO L226 Difference]: Without dead ends: 288 [2020-10-05 22:40:21,309 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-05 22:40:21,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2020-10-05 22:40:21,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2020-10-05 22:40:21,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2020-10-05 22:40:21,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 701 transitions. [2020-10-05 22:40:21,318 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 701 transitions. Word has length 20 [2020-10-05 22:40:21,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:40:21,319 INFO L479 AbstractCegarLoop]: Abstraction has 288 states and 701 transitions. [2020-10-05 22:40:21,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 22:40:21,319 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 701 transitions. [2020-10-05 22:40:21,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 22:40:21,320 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:40:21,320 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, 1, 1, 1, 1] [2020-10-05 22:40:21,320 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 22:40:21,321 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:40:21,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:40:21,321 INFO L82 PathProgramCache]: Analyzing trace with hash 81132582, now seen corresponding path program 1 times [2020-10-05 22:40:21,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:40:21,326 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307105790] [2020-10-05 22:40:21,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:40:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:40:21,507 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-05 22:40:21,508 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307105790] [2020-10-05 22:40:21,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:40:21,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 22:40:21,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919723628] [2020-10-05 22:40:21,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 22:40:21,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:40:21,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 22:40:21,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 22:40:21,511 INFO L87 Difference]: Start difference. First operand 288 states and 701 transitions. Second operand 4 states. [2020-10-05 22:40:21,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:40:21,533 INFO L93 Difference]: Finished difference Result 393 states and 938 transitions. [2020-10-05 22:40:21,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 22:40:21,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-10-05 22:40:21,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:40:21,535 INFO L225 Difference]: With dead ends: 393 [2020-10-05 22:40:21,536 INFO L226 Difference]: Without dead ends: 228 [2020-10-05 22:40:21,536 INFO L675 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-05 22:40:21,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-10-05 22:40:21,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2020-10-05 22:40:21,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2020-10-05 22:40:21,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 535 transitions. [2020-10-05 22:40:21,544 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 535 transitions. Word has length 24 [2020-10-05 22:40:21,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:40:21,546 INFO L479 AbstractCegarLoop]: Abstraction has 228 states and 535 transitions. [2020-10-05 22:40:21,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 22:40:21,546 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 535 transitions. [2020-10-05 22:40:21,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 22:40:21,547 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:40:21,547 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, 1, 1, 1, 1] [2020-10-05 22:40:21,548 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 22:40:21,548 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:40:21,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:40:21,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1996093800, now seen corresponding path program 2 times [2020-10-05 22:40:21,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:40:21,549 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645725813] [2020-10-05 22:40:21,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:40:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:40:22,300 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-05 22:40:22,301 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645725813] [2020-10-05 22:40:22,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:40:22,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-05 22:40:22,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224957589] [2020-10-05 22:40:22,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 22:40:22,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:40:22,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 22:40:22,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-10-05 22:40:22,302 INFO L87 Difference]: Start difference. First operand 228 states and 535 transitions. Second operand 12 states. [2020-10-05 22:40:23,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:40:23,263 INFO L93 Difference]: Finished difference Result 264 states and 591 transitions. [2020-10-05 22:40:23,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-05 22:40:23,263 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2020-10-05 22:40:23,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:40:23,266 INFO L225 Difference]: With dead ends: 264 [2020-10-05 22:40:23,266 INFO L226 Difference]: Without dead ends: 237 [2020-10-05 22:40:23,268 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2020-10-05 22:40:23,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2020-10-05 22:40:23,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 203. [2020-10-05 22:40:23,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2020-10-05 22:40:23,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 465 transitions. [2020-10-05 22:40:23,274 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 465 transitions. Word has length 24 [2020-10-05 22:40:23,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:40:23,274 INFO L479 AbstractCegarLoop]: Abstraction has 203 states and 465 transitions. [2020-10-05 22:40:23,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 22:40:23,274 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 465 transitions. [2020-10-05 22:40:23,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 22:40:23,275 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:40:23,275 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, 1, 1, 1, 1] [2020-10-05 22:40:23,276 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 22:40:23,276 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:40:23,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:40:23,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1690939578, now seen corresponding path program 3 times [2020-10-05 22:40:23,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:40:23,277 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208350662] [2020-10-05 22:40:23,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:40:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:40:23,679 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-05 22:40:23,679 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208350662] [2020-10-05 22:40:23,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:40:23,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-05 22:40:23,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278046984] [2020-10-05 22:40:23,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 22:40:23,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:40:23,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 22:40:23,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-05 22:40:23,681 INFO L87 Difference]: Start difference. First operand 203 states and 465 transitions. Second operand 12 states. [2020-10-05 22:40:24,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:40:24,146 INFO L93 Difference]: Finished difference Result 243 states and 544 transitions. [2020-10-05 22:40:24,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-05 22:40:24,147 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2020-10-05 22:40:24,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:40:24,149 INFO L225 Difference]: With dead ends: 243 [2020-10-05 22:40:24,149 INFO L226 Difference]: Without dead ends: 191 [2020-10-05 22:40:24,150 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2020-10-05 22:40:24,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-10-05 22:40:24,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 162. [2020-10-05 22:40:24,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-10-05 22:40:24,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 360 transitions. [2020-10-05 22:40:24,155 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 360 transitions. Word has length 24 [2020-10-05 22:40:24,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:40:24,155 INFO L479 AbstractCegarLoop]: Abstraction has 162 states and 360 transitions. [2020-10-05 22:40:24,155 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 22:40:24,155 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 360 transitions. [2020-10-05 22:40:24,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 22:40:24,156 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:40:24,156 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, 1, 1, 1, 1] [2020-10-05 22:40:24,156 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 22:40:24,157 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:40:24,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:40:24,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1460936444, now seen corresponding path program 4 times [2020-10-05 22:40:24,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:40:24,158 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518399525] [2020-10-05 22:40:24,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:40:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 22:40:24,217 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 22:40:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 22:40:24,269 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 22:40:24,317 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 22:40:24,318 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 22:40:24,318 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 22:40:24,344 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-05 22:40:24,344 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,351 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-05 22:40:24,351 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,352 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-05 22:40:24,352 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,352 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-05 22:40:24,353 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,353 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-05 22:40:24,353 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,353 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-05 22:40:24,353 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,354 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-05 22:40:24,354 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,354 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-05 22:40:24,354 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,355 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-05 22:40:24,355 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,355 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-05 22:40:24,355 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,356 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-05 22:40:24,356 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,356 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-05 22:40:24,356 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,356 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-05 22:40:24,356 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,357 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-05 22:40:24,357 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,357 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-05 22:40:24,357 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,357 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-05 22:40:24,357 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,358 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-05 22:40:24,358 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,358 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-05 22:40:24,358 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,358 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-05 22:40:24,358 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,364 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-05 22:40:24,365 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,365 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-05 22:40:24,365 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,365 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-05 22:40:24,365 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,366 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-05 22:40:24,366 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,366 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-05 22:40:24,366 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,366 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-05 22:40:24,366 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,366 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-05 22:40:24,367 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,367 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-05 22:40:24,367 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,367 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-05 22:40:24,367 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,368 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-05 22:40:24,368 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,368 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-05 22:40:24,368 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,368 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-05 22:40:24,368 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,369 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-05 22:40:24,369 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,370 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-05 22:40:24,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,371 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-05 22:40:24,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,371 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-05 22:40:24,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,371 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-05 22:40:24,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,372 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-05 22:40:24,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,372 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-05 22:40:24,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:24,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 10:40:24 BasicIcfg [2020-10-05 22:40:24,484 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 22:40:24,486 INFO L168 Benchmark]: Toolchain (without parser) took 12775.31 ms. Allocated memory was 141.6 MB in the beginning and 376.4 MB in the end (delta: 234.9 MB). Free memory was 102.9 MB in the beginning and 136.7 MB in the end (delta: -33.7 MB). Peak memory consumption was 201.1 MB. Max. memory is 7.1 GB. [2020-10-05 22:40:24,487 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 141.6 MB. Free memory was 123.1 MB in the beginning and 122.7 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. [2020-10-05 22:40:24,488 INFO L168 Benchmark]: CACSL2BoogieTranslator took 748.14 ms. Allocated memory was 141.6 MB in the beginning and 205.5 MB in the end (delta: 64.0 MB). Free memory was 102.5 MB in the beginning and 157.0 MB in the end (delta: -54.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. [2020-10-05 22:40:24,488 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.69 ms. Allocated memory is still 205.5 MB. Free memory was 157.0 MB in the beginning and 154.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2020-10-05 22:40:24,489 INFO L168 Benchmark]: Boogie Preprocessor took 42.78 ms. Allocated memory is still 205.5 MB. Free memory was 154.0 MB in the beginning and 151.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-05 22:40:24,490 INFO L168 Benchmark]: RCFGBuilder took 2117.77 ms. Allocated memory was 205.5 MB in the beginning and 245.4 MB in the end (delta: 39.8 MB). Free memory was 151.2 MB in the beginning and 155.0 MB in the end (delta: -3.8 MB). Peak memory consumption was 94.1 MB. Max. memory is 7.1 GB. [2020-10-05 22:40:24,491 INFO L168 Benchmark]: TraceAbstraction took 9797.79 ms. Allocated memory was 245.4 MB in the beginning and 376.4 MB in the end (delta: 131.1 MB). Free memory was 155.0 MB in the beginning and 136.7 MB in the end (delta: 18.4 MB). Peak memory consumption was 149.4 MB. Max. memory is 7.1 GB. [2020-10-05 22:40:24,494 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51 ms. Allocated memory is still 141.6 MB. Free memory was 123.1 MB in the beginning and 122.7 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 748.14 ms. Allocated memory was 141.6 MB in the beginning and 205.5 MB in the end (delta: 64.0 MB). Free memory was 102.5 MB in the beginning and 157.0 MB in the end (delta: -54.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.69 ms. Allocated memory is still 205.5 MB. Free memory was 157.0 MB in the beginning and 154.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.78 ms. Allocated memory is still 205.5 MB. Free memory was 154.0 MB in the beginning and 151.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2117.77 ms. Allocated memory was 205.5 MB in the beginning and 245.4 MB in the end (delta: 39.8 MB). Free memory was 151.2 MB in the beginning and 155.0 MB in the end (delta: -3.8 MB). Peak memory consumption was 94.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9797.79 ms. Allocated memory was 245.4 MB in the beginning and 376.4 MB in the end (delta: 131.1 MB). Free memory was 155.0 MB in the beginning and 136.7 MB in the end (delta: 18.4 MB). Peak memory consumption was 149.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 107 ProgramPointsBefore, 39 ProgramPointsAfterwards, 99 TransitionsBefore, 30 TransitionsAfterwards, 1928 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 1099 VarBasedMoverChecksPositive, 55 VarBasedMoverChecksNegative, 38 SemBasedMoverChecksPositive, 41 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 4982 CheckedPairsTotal, 79 TotalNumberOfCompositions - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p0_EAX = 0; [L702] 0 int __unbuffered_p0_EBX = 0; [L704] 0 int __unbuffered_p2_EAX = 0; [L706] 0 int __unbuffered_p2_EBX = 0; [L708] 0 int a = 0; [L709] 0 _Bool a$flush_delayed; [L710] 0 int a$mem_tmp; [L711] 0 _Bool a$r_buff0_thd0; [L712] 0 _Bool a$r_buff0_thd1; [L713] 0 _Bool a$r_buff0_thd2; [L714] 0 _Bool a$r_buff0_thd3; [L715] 0 _Bool a$r_buff1_thd0; [L716] 0 _Bool a$r_buff1_thd1; [L717] 0 _Bool a$r_buff1_thd2; [L718] 0 _Bool a$r_buff1_thd3; [L719] 0 _Bool a$read_delayed; [L720] 0 int *a$read_delayed_var; [L721] 0 int a$w_buff0; [L722] 0 _Bool a$w_buff0_used; [L723] 0 int a$w_buff1; [L724] 0 _Bool a$w_buff1_used; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L837] 0 pthread_t t654; [L838] FCALL, FORK 0 pthread_create(&t654, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] 0 pthread_t t655; [L738] 1 a$w_buff1 = a$w_buff0 [L739] 1 a$w_buff0 = 1 [L740] 1 a$w_buff1_used = a$w_buff0_used [L741] 1 a$w_buff0_used = (_Bool)1 [L7] COND FALSE 1 !(!expression) [L743] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L744] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L745] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L746] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L747] 1 a$r_buff0_thd1 = (_Bool)1 [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L756] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L840] FCALL, FORK 0 pthread_create(&t655, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L841] 0 pthread_t t656; [L842] FCALL, FORK 0 pthread_create(&t656, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, z=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, z=0] [L776] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, z=1] [L779] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L779] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L780] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L780] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L781] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L781] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L782] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L782] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L783] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L783] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L793] 3 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, z=2] [L796] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, z=2] [L799] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L800] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L801] 3 a$flush_delayed = weak$$choice2 [L802] 3 a$mem_tmp = a [L803] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L803] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1 [L803] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L803] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L804] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L804] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0) [L804] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L804] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L805] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L805] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L806] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L806] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used) [L806] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L806] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L807] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L807] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L808] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L809] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L809] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0 [L809] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L809] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L810] 3 __unbuffered_p2_EBX = a [L811] EXPR 3 a$flush_delayed ? a$mem_tmp : a [L811] 3 a = a$flush_delayed ? a$mem_tmp : a [L812] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=1, y=1, z=2] [L815] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L815] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L815] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L815] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L816] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L817] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L817] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L818] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L818] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L819] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L819] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L759] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L759] EXPR 1 a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a [L759] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L759] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L760] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L760] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L761] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L761] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L762] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L762] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L763] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L763] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 2 return 0; [L766] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 1 return 0; [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L848] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L848] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L848] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L848] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L849] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L849] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L850] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L850] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L851] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L851] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L852] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L852] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L855] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=1, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.4s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 376 SDtfs, 428 SDslu, 1349 SDs, 0 SdLazy, 1027 SolverSat, 100 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1346occurred 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.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 109 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 203 NumberOfCodeBlocks, 203 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 168 ConstructedInterpolants, 0 QuantifiedInterpolants, 37730 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...