/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/safe011_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 22:49:12,349 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 22:49:12,351 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 22:49:12,374 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 22:49:12,375 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 22:49:12,376 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 22:49:12,377 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 22:49:12,379 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 22:49:12,381 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 22:49:12,381 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 22:49:12,382 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 22:49:12,383 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 22:49:12,384 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 22:49:12,385 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 22:49:12,386 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 22:49:12,387 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 22:49:12,388 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 22:49:12,389 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 22:49:12,391 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 22:49:12,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 22:49:12,394 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 22:49:12,395 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 22:49:12,397 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 22:49:12,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 22:49:12,400 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 22:49:12,400 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 22:49:12,401 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 22:49:12,402 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 22:49:12,402 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 22:49:12,403 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 22:49:12,403 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 22:49:12,404 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 22:49:12,405 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 22:49:12,405 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 22:49:12,406 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 22:49:12,407 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 22:49:12,407 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 22:49:12,408 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 22:49:12,408 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 22:49:12,409 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 22:49:12,409 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 22:49:12,410 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:49:12,433 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 22:49:12,433 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 22:49:12,434 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 22:49:12,434 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 22:49:12,435 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 22:49:12,435 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 22:49:12,435 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 22:49:12,435 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 22:49:12,435 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 22:49:12,436 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 22:49:12,436 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 22:49:12,436 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 22:49:12,436 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 22:49:12,436 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 22:49:12,437 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 22:49:12,437 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 22:49:12,437 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 22:49:12,437 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 22:49:12,437 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 22:49:12,438 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 22:49:12,438 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 22:49:12,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 22:49:12,438 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 22:49:12,439 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-05 22:49:12,439 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 22:49:12,439 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 22:49:12,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 22:49:12,439 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 22:49:12,440 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-05 22:49:12,440 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-05 22:49:12,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 22:49:12,764 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 22:49:12,767 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 22:49:12,769 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 22:49:12,769 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 22:49:12,770 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_pso.oepc.i [2020-10-05 22:49:12,858 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bd755a0f/50c7b953227f450e813ef79f9d542942/FLAG882339c61 [2020-10-05 22:49:13,468 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 22:49:13,468 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_pso.oepc.i [2020-10-05 22:49:13,488 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bd755a0f/50c7b953227f450e813ef79f9d542942/FLAG882339c61 [2020-10-05 22:49:13,761 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bd755a0f/50c7b953227f450e813ef79f9d542942 [2020-10-05 22:49:13,769 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 22:49:13,771 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 22:49:13,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 22:49:13,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 22:49:13,776 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 22:49:13,777 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:49:13" (1/1) ... [2020-10-05 22:49:13,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d75f09a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:49:13, skipping insertion in model container [2020-10-05 22:49:13,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:49:13" (1/1) ... [2020-10-05 22:49:13,788 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 22:49:13,839 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 22:49:14,356 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 22:49:14,369 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 22:49:14,440 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 22:49:14,515 INFO L208 MainTranslator]: Completed translation [2020-10-05 22:49:14,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:49:14 WrapperNode [2020-10-05 22:49:14,516 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 22:49:14,517 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 22:49:14,517 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 22:49:14,517 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 22:49:14,526 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:49:14" (1/1) ... [2020-10-05 22:49:14,548 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:49:14" (1/1) ... [2020-10-05 22:49:14,588 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 22:49:14,588 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 22:49:14,588 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 22:49:14,588 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 22:49:14,599 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:49:14" (1/1) ... [2020-10-05 22:49:14,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:49:14" (1/1) ... [2020-10-05 22:49:14,604 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:49:14" (1/1) ... [2020-10-05 22:49:14,604 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:49:14" (1/1) ... [2020-10-05 22:49:14,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:49:14" (1/1) ... [2020-10-05 22:49:14,620 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:49:14" (1/1) ... [2020-10-05 22:49:14,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:49:14" (1/1) ... [2020-10-05 22:49:14,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 22:49:14,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 22:49:14,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 22:49:14,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 22:49:14,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:49:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 22:49:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 22:49:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 22:49:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 22:49:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 22:49:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 22:49:14,698 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 22:49:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 22:49:14,698 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 22:49:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-05 22:49:14,698 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-05 22:49:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 22:49:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 22:49:14,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 22:49:14,701 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:49:16,932 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 22:49:16,932 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 22:49:16,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:49:16 BoogieIcfgContainer [2020-10-05 22:49:16,935 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 22:49:16,936 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 22:49:16,936 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 22:49:16,939 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 22:49:16,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 10:49:13" (1/3) ... [2020-10-05 22:49:16,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6657c4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:49:16, skipping insertion in model container [2020-10-05 22:49:16,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:49:14" (2/3) ... [2020-10-05 22:49:16,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6657c4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:49:16, skipping insertion in model container [2020-10-05 22:49:16,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:49:16" (3/3) ... [2020-10-05 22:49:16,942 INFO L109 eAbstractionObserver]: Analyzing ICFG safe011_pso.oepc.i [2020-10-05 22:49:16,954 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 22:49:16,954 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-05 22:49:16,962 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 22:49:16,963 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 22:49:16,991 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:16,992 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:16,992 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:16,992 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:16,993 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:16,993 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:16,993 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:16,993 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:16,994 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:16,994 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:16,994 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:16,994 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:16,995 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:16,995 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:16,995 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:16,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:16,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:16,996 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:16,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:16,997 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:16,997 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:16,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:16,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:16,998 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:16,998 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:16,998 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:16,998 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:16,998 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:16,999 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:16,999 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:16,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,000 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,000 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,007 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,007 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,007 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,007 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,007 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,008 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,008 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,008 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,010 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,010 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,011 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,011 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,011 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,011 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,011 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,011 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,012 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,012 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,012 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,012 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,014 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,014 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,014 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,014 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,014 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,015 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,015 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,015 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,015 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,015 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:49:17,030 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-05 22:49:17,051 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 22:49:17,051 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 22:49:17,051 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-05 22:49:17,051 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 22:49:17,052 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 22:49:17,052 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 22:49:17,052 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 22:49:17,052 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 22:49:17,070 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 199 flow [2020-10-05 22:49:17,072 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-05 22:49:17,118 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-05 22:49:17,119 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 22:49:17,124 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-05 22:49:17,127 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-05 22:49:17,148 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-05 22:49:17,148 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 22:49:17,149 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-05 22:49:17,152 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1650 [2020-10-05 22:49:17,153 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-10-05 22:49:17,271 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-05 22:49:17,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:17,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:49:17,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:49:17,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-05 22:49:17,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:49:17,340 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:49:17,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:49:17,342 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-05 22:49:17,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:49:17,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:17,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:17,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:17,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:17,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:17,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:17,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:17,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:17,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:17,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:17,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:17,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:17,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:17,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:17,425 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:17,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:17,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:17,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:17,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:17,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:17,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:17,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:17,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:17,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:17,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:17,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:17,552 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:17,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:17,555 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:17,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:17,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:17,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:17,673 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:17,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:17,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:17,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:17,677 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:17,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:17,680 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:17,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:17,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:17,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:17,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:17,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:17,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:17,704 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:17,706 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:17,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:17,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:49:17,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:49:17,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-05 22:49:17,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:49:17,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:49:17,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:49:17,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-05 22:49:17,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:49:17,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:17,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:17,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:17,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:17,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:17,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:17,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:17,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:17,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:17,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:17,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:17,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:17,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:17,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:17,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:17,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:18,200 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:49:18,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:49:18,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-05 22:49:18,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:49:18,226 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:49:18,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:49:18,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-05 22:49:18,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:49:18,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:18,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:18,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:18,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:18,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:18,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:18,259 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:18,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:18,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:18,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:18,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:18,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:18,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:18,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:18,282 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:18,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:18,381 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:18,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:18,384 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-05 22:49:18,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:49:18,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-05 22:49:18,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:49:18,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-05 22:49:18,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:49:18,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-05 22:49:18,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:49:18,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-05 22:49:18,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:49:18,407 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:49:18,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:49:18,409 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:49:18,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:49:18,411 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:49:18,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:49:18,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:49:18,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:49:18,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-05 22:49:18,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:49:18,475 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-05 22:49:18,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-05 22:49:18,479 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:49:18,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:49:19,816 WARN L193 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-10-05 22:49:19,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-05 22:49:19,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:49:19,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-05 22:49:19,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:49:20,634 WARN L193 SmtUtils]: Spent 793.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-10-05 22:49:20,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-05 22:49:20,712 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:21,031 WARN L193 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-05 22:49:21,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-05 22:49:21,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:21,687 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:21,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:21,688 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:21,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:21,690 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:21,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:21,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:21,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:21,713 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:21,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:21,715 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:21,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:21,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:21,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:21,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:21,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:21,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:21,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:21,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:21,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:21,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:21,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:21,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:21,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:21,862 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:21,862 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:21,863 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:21,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:21,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:21,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:21,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:21,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:21,914 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:21,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:21,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:21,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:21,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:21,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:21,921 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:21,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:21,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:21,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:21,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:21,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:21,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:21,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:21,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:21,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:21,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:21,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:21,996 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:21,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:21,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:21,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:22,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:22,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:22,013 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:22,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:22,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:22,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:22,017 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:22,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:22,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:22,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:22,136 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:22,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:22,139 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:22,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:22,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:22,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:49:22,143 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:22,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:49:22,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:22,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:22,162 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:22,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:22,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:22,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:22,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:22,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:22,218 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:22,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:22,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:22,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:22,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:22,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:22,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:22,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:49:22,235 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:22,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:22,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:22,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:49:22,238 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:49:22,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:49:22,240 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:49:22,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:49:22,697 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2020-10-05 22:49:22,916 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-05 22:49:23,058 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-05 22:49:23,066 INFO L206 etLargeBlockEncoding]: Checked pairs total: 4579 [2020-10-05 22:49:23,066 INFO L214 etLargeBlockEncoding]: Total number of compositions: 75 [2020-10-05 22:49:23,069 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2020-10-05 22:49:23,134 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 974 states. [2020-10-05 22:49:23,136 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states. [2020-10-05 22:49:23,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 22:49:23,143 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:49:23,143 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 22:49:23,144 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:49:23,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:49:23,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1041180, now seen corresponding path program 1 times [2020-10-05 22:49:23,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:49:23,161 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764484396] [2020-10-05 22:49:23,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:49:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:49:23,376 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:49:23,377 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764484396] [2020-10-05 22:49:23,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:49:23,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 22:49:23,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085015252] [2020-10-05 22:49:23,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 22:49:23,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:49:23,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 22:49:23,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:49:23,406 INFO L87 Difference]: Start difference. First operand 974 states. Second operand 3 states. [2020-10-05 22:49:23,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:49:23,513 INFO L93 Difference]: Finished difference Result 812 states and 2575 transitions. [2020-10-05 22:49:23,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 22:49:23,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 22:49:23,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:49:23,549 INFO L225 Difference]: With dead ends: 812 [2020-10-05 22:49:23,549 INFO L226 Difference]: Without dead ends: 687 [2020-10-05 22:49:23,551 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:49:23,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-10-05 22:49:23,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2020-10-05 22:49:23,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2020-10-05 22:49:23,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2150 transitions. [2020-10-05 22:49:23,712 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 2150 transitions. Word has length 3 [2020-10-05 22:49:23,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:49:23,712 INFO L479 AbstractCegarLoop]: Abstraction has 687 states and 2150 transitions. [2020-10-05 22:49:23,713 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 22:49:23,713 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 2150 transitions. [2020-10-05 22:49:23,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-05 22:49:23,715 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:49:23,715 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:49:23,715 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 22:49:23,716 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:49:23,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:49:23,716 INFO L82 PathProgramCache]: Analyzing trace with hash 626468161, now seen corresponding path program 1 times [2020-10-05 22:49:23,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:49:23,717 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101656725] [2020-10-05 22:49:23,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:49:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:49:23,947 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:49:23,948 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101656725] [2020-10-05 22:49:23,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:49:23,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 22:49:23,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520883774] [2020-10-05 22:49:23,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 22:49:23,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:49:23,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 22:49:23,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 22:49:23,951 INFO L87 Difference]: Start difference. First operand 687 states and 2150 transitions. Second operand 4 states. [2020-10-05 22:49:23,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:49:23,998 INFO L93 Difference]: Finished difference Result 792 states and 2384 transitions. [2020-10-05 22:49:23,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 22:49:23,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-05 22:49:23,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:49:24,004 INFO L225 Difference]: With dead ends: 792 [2020-10-05 22:49:24,005 INFO L226 Difference]: Without dead ends: 667 [2020-10-05 22:49:24,006 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:49:24,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2020-10-05 22:49:24,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2020-10-05 22:49:24,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2020-10-05 22:49:24,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 2074 transitions. [2020-10-05 22:49:24,034 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 2074 transitions. Word has length 10 [2020-10-05 22:49:24,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:49:24,035 INFO L479 AbstractCegarLoop]: Abstraction has 667 states and 2074 transitions. [2020-10-05 22:49:24,036 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 22:49:24,036 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 2074 transitions. [2020-10-05 22:49:24,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 22:49:24,038 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:49:24,038 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:49:24,038 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 22:49:24,039 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:49:24,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:49:24,039 INFO L82 PathProgramCache]: Analyzing trace with hash 254166472, now seen corresponding path program 1 times [2020-10-05 22:49:24,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:49:24,039 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915283267] [2020-10-05 22:49:24,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:49:24,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:49:24,159 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:49:24,159 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915283267] [2020-10-05 22:49:24,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:49:24,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 22:49:24,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922165056] [2020-10-05 22:49:24,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 22:49:24,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:49:24,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 22:49:24,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 22:49:24,161 INFO L87 Difference]: Start difference. First operand 667 states and 2074 transitions. Second operand 4 states. [2020-10-05 22:49:24,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:49:24,247 INFO L93 Difference]: Finished difference Result 759 states and 2283 transitions. [2020-10-05 22:49:24,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 22:49:24,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-05 22:49:24,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:49:24,253 INFO L225 Difference]: With dead ends: 759 [2020-10-05 22:49:24,254 INFO L226 Difference]: Without dead ends: 659 [2020-10-05 22:49:24,254 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:49:24,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2020-10-05 22:49:24,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2020-10-05 22:49:24,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2020-10-05 22:49:24,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 2044 transitions. [2020-10-05 22:49:24,277 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 2044 transitions. Word has length 11 [2020-10-05 22:49:24,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:49:24,277 INFO L479 AbstractCegarLoop]: Abstraction has 659 states and 2044 transitions. [2020-10-05 22:49:24,277 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 22:49:24,278 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 2044 transitions. [2020-10-05 22:49:24,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 22:49:24,279 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:49:24,280 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:49:24,280 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 22:49:24,280 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:49:24,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:49:24,280 INFO L82 PathProgramCache]: Analyzing trace with hash -731543524, now seen corresponding path program 1 times [2020-10-05 22:49:24,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:49:24,281 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486938797] [2020-10-05 22:49:24,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:49:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:49:24,389 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:49:24,389 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486938797] [2020-10-05 22:49:24,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:49:24,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 22:49:24,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760719302] [2020-10-05 22:49:24,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 22:49:24,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:49:24,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 22:49:24,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-05 22:49:24,392 INFO L87 Difference]: Start difference. First operand 659 states and 2044 transitions. Second operand 5 states. [2020-10-05 22:49:24,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:49:24,561 INFO L93 Difference]: Finished difference Result 767 states and 2325 transitions. [2020-10-05 22:49:24,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:49:24,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-05 22:49:24,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:49:24,568 INFO L225 Difference]: With dead ends: 767 [2020-10-05 22:49:24,568 INFO L226 Difference]: Without dead ends: 687 [2020-10-05 22:49:24,568 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-05 22:49:24,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-10-05 22:49:24,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2020-10-05 22:49:24,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2020-10-05 22:49:24,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2125 transitions. [2020-10-05 22:49:24,592 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 2125 transitions. Word has length 12 [2020-10-05 22:49:24,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:49:24,592 INFO L479 AbstractCegarLoop]: Abstraction has 687 states and 2125 transitions. [2020-10-05 22:49:24,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 22:49:24,593 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 2125 transitions. [2020-10-05 22:49:24,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 22:49:24,594 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:49:24,594 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:49:24,594 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 22:49:24,595 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:49:24,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:49:24,595 INFO L82 PathProgramCache]: Analyzing trace with hash -710778236, now seen corresponding path program 1 times [2020-10-05 22:49:24,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:49:24,596 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627174391] [2020-10-05 22:49:24,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:49:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:49:24,662 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:49:24,664 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627174391] [2020-10-05 22:49:24,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:49:24,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 22:49:24,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873433880] [2020-10-05 22:49:24,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 22:49:24,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:49:24,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 22:49:24,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 22:49:24,666 INFO L87 Difference]: Start difference. First operand 687 states and 2125 transitions. Second operand 4 states. [2020-10-05 22:49:24,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:49:24,697 INFO L93 Difference]: Finished difference Result 744 states and 2231 transitions. [2020-10-05 22:49:24,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 22:49:24,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-05 22:49:24,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:49:24,703 INFO L225 Difference]: With dead ends: 744 [2020-10-05 22:49:24,703 INFO L226 Difference]: Without dead ends: 649 [2020-10-05 22:49:24,704 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:49:24,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2020-10-05 22:49:24,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 649. [2020-10-05 22:49:24,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2020-10-05 22:49:24,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1991 transitions. [2020-10-05 22:49:24,733 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1991 transitions. Word has length 12 [2020-10-05 22:49:24,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:49:24,734 INFO L479 AbstractCegarLoop]: Abstraction has 649 states and 1991 transitions. [2020-10-05 22:49:24,734 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 22:49:24,734 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1991 transitions. [2020-10-05 22:49:24,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 22:49:24,736 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:49:24,736 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:49:24,736 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 22:49:24,737 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:49:24,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:49:24,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1394966630, now seen corresponding path program 1 times [2020-10-05 22:49:24,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:49:24,737 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725992819] [2020-10-05 22:49:24,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:49:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:49:24,942 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:49:24,944 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725992819] [2020-10-05 22:49:24,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:49:24,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 22:49:24,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610849746] [2020-10-05 22:49:24,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 22:49:24,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:49:24,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 22:49:24,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 22:49:24,946 INFO L87 Difference]: Start difference. First operand 649 states and 1991 transitions. Second operand 5 states. [2020-10-05 22:49:25,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:49:25,043 INFO L93 Difference]: Finished difference Result 703 states and 2105 transitions. [2020-10-05 22:49:25,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 22:49:25,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 22:49:25,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:49:25,049 INFO L225 Difference]: With dead ends: 703 [2020-10-05 22:49:25,049 INFO L226 Difference]: Without dead ends: 643 [2020-10-05 22:49:25,049 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-05 22:49:25,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2020-10-05 22:49:25,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2020-10-05 22:49:25,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2020-10-05 22:49:25,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1969 transitions. [2020-10-05 22:49:25,070 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1969 transitions. Word has length 13 [2020-10-05 22:49:25,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:49:25,071 INFO L479 AbstractCegarLoop]: Abstraction has 643 states and 1969 transitions. [2020-10-05 22:49:25,071 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 22:49:25,071 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1969 transitions. [2020-10-05 22:49:25,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 22:49:25,072 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:49:25,072 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:49:25,073 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 22:49:25,073 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:49:25,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:49:25,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1203017040, now seen corresponding path program 1 times [2020-10-05 22:49:25,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:49:25,074 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998941422] [2020-10-05 22:49:25,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:49:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:49:25,148 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:49:25,148 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998941422] [2020-10-05 22:49:25,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:49:25,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 22:49:25,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489596538] [2020-10-05 22:49:25,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 22:49:25,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:49:25,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 22:49:25,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-05 22:49:25,151 INFO L87 Difference]: Start difference. First operand 643 states and 1969 transitions. Second operand 5 states. [2020-10-05 22:49:25,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:49:25,205 INFO L93 Difference]: Finished difference Result 807 states and 2432 transitions. [2020-10-05 22:49:25,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 22:49:25,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 22:49:25,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:49:25,209 INFO L225 Difference]: With dead ends: 807 [2020-10-05 22:49:25,209 INFO L226 Difference]: Without dead ends: 431 [2020-10-05 22:49:25,210 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-05 22:49:25,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2020-10-05 22:49:25,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2020-10-05 22:49:25,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2020-10-05 22:49:25,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1248 transitions. [2020-10-05 22:49:25,224 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 1248 transitions. Word has length 13 [2020-10-05 22:49:25,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:49:25,224 INFO L479 AbstractCegarLoop]: Abstraction has 431 states and 1248 transitions. [2020-10-05 22:49:25,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 22:49:25,225 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 1248 transitions. [2020-10-05 22:49:25,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 22:49:25,225 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:49:25,226 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:49:25,227 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 22:49:25,227 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:49:25,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:49:25,227 INFO L82 PathProgramCache]: Analyzing trace with hash 244893855, now seen corresponding path program 1 times [2020-10-05 22:49:25,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:49:25,228 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879116642] [2020-10-05 22:49:25,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:49:25,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:49:25,452 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:49:25,452 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879116642] [2020-10-05 22:49:25,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:49:25,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 22:49:25,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386573189] [2020-10-05 22:49:25,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 22:49:25,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:49:25,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 22:49:25,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-05 22:49:25,454 INFO L87 Difference]: Start difference. First operand 431 states and 1248 transitions. Second operand 6 states. [2020-10-05 22:49:25,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:49:25,586 INFO L93 Difference]: Finished difference Result 458 states and 1293 transitions. [2020-10-05 22:49:25,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 22:49:25,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-05 22:49:25,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:49:25,591 INFO L225 Difference]: With dead ends: 458 [2020-10-05 22:49:25,591 INFO L226 Difference]: Without dead ends: 413 [2020-10-05 22:49:25,592 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-05 22:49:25,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2020-10-05 22:49:25,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2020-10-05 22:49:25,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2020-10-05 22:49:25,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 1188 transitions. [2020-10-05 22:49:25,604 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 1188 transitions. Word has length 14 [2020-10-05 22:49:25,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:49:25,604 INFO L479 AbstractCegarLoop]: Abstraction has 413 states and 1188 transitions. [2020-10-05 22:49:25,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 22:49:25,605 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 1188 transitions. [2020-10-05 22:49:25,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 22:49:25,606 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:49:25,606 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:49:25,606 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 22:49:25,606 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:49:25,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:49:25,607 INFO L82 PathProgramCache]: Analyzing trace with hash 294288294, now seen corresponding path program 1 times [2020-10-05 22:49:25,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:49:25,607 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634838524] [2020-10-05 22:49:25,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:49:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:49:25,751 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:49:25,752 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634838524] [2020-10-05 22:49:25,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:49:25,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 22:49:25,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382974984] [2020-10-05 22:49:25,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 22:49:25,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:49:25,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 22:49:25,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 22:49:25,754 INFO L87 Difference]: Start difference. First operand 413 states and 1188 transitions. Second operand 6 states. [2020-10-05 22:49:25,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:49:25,874 INFO L93 Difference]: Finished difference Result 493 states and 1388 transitions. [2020-10-05 22:49:25,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 22:49:25,875 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-05 22:49:25,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:49:25,878 INFO L225 Difference]: With dead ends: 493 [2020-10-05 22:49:25,878 INFO L226 Difference]: Without dead ends: 441 [2020-10-05 22:49:25,879 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-05 22:49:25,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2020-10-05 22:49:25,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2020-10-05 22:49:25,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2020-10-05 22:49:25,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1268 transitions. [2020-10-05 22:49:25,891 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 1268 transitions. Word has length 14 [2020-10-05 22:49:25,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:49:25,892 INFO L479 AbstractCegarLoop]: Abstraction has 441 states and 1268 transitions. [2020-10-05 22:49:25,892 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 22:49:25,892 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 1268 transitions. [2020-10-05 22:49:25,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 22:49:25,893 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:49:25,893 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:49:25,894 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 22:49:25,894 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:49:25,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:49:25,894 INFO L82 PathProgramCache]: Analyzing trace with hash -998229363, now seen corresponding path program 1 times [2020-10-05 22:49:25,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:49:25,895 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146838627] [2020-10-05 22:49:25,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:49:25,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:49:26,076 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:49:26,077 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146838627] [2020-10-05 22:49:26,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:49:26,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 22:49:26,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495183596] [2020-10-05 22:49:26,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 22:49:26,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:49:26,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 22:49:26,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-05 22:49:26,079 INFO L87 Difference]: Start difference. First operand 441 states and 1268 transitions. Second operand 7 states. [2020-10-05 22:49:26,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:49:26,299 INFO L93 Difference]: Finished difference Result 544 states and 1543 transitions. [2020-10-05 22:49:26,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:49:26,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-05 22:49:26,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:49:26,307 INFO L225 Difference]: With dead ends: 544 [2020-10-05 22:49:26,307 INFO L226 Difference]: Without dead ends: 492 [2020-10-05 22:49:26,307 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-05 22:49:26,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2020-10-05 22:49:26,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 485. [2020-10-05 22:49:26,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2020-10-05 22:49:26,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 1392 transitions. [2020-10-05 22:49:26,321 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 1392 transitions. Word has length 15 [2020-10-05 22:49:26,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:49:26,321 INFO L479 AbstractCegarLoop]: Abstraction has 485 states and 1392 transitions. [2020-10-05 22:49:26,321 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 22:49:26,321 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 1392 transitions. [2020-10-05 22:49:26,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 22:49:26,323 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:49:26,323 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:49:26,323 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 22:49:26,323 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:49:26,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:49:26,324 INFO L82 PathProgramCache]: Analyzing trace with hash 532955001, now seen corresponding path program 1 times [2020-10-05 22:49:26,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:49:26,324 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295215232] [2020-10-05 22:49:26,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:49:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:49:26,520 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:49:26,520 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295215232] [2020-10-05 22:49:26,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:49:26,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 22:49:26,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502009466] [2020-10-05 22:49:26,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 22:49:26,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:49:26,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 22:49:26,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 22:49:26,522 INFO L87 Difference]: Start difference. First operand 485 states and 1392 transitions. Second operand 7 states. [2020-10-05 22:49:26,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:49:26,694 INFO L93 Difference]: Finished difference Result 509 states and 1432 transitions. [2020-10-05 22:49:26,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 22:49:26,695 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-05 22:49:26,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:49:26,699 INFO L225 Difference]: With dead ends: 509 [2020-10-05 22:49:26,699 INFO L226 Difference]: Without dead ends: 477 [2020-10-05 22:49:26,700 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-10-05 22:49:26,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2020-10-05 22:49:26,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2020-10-05 22:49:26,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2020-10-05 22:49:26,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 1364 transitions. [2020-10-05 22:49:26,712 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 1364 transitions. Word has length 15 [2020-10-05 22:49:26,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:49:26,713 INFO L479 AbstractCegarLoop]: Abstraction has 477 states and 1364 transitions. [2020-10-05 22:49:26,713 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 22:49:26,713 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 1364 transitions. [2020-10-05 22:49:26,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 22:49:26,714 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:49:26,714 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:49:26,715 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 22:49:26,715 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:49:26,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:49:26,715 INFO L82 PathProgramCache]: Analyzing trace with hash -880386702, now seen corresponding path program 1 times [2020-10-05 22:49:26,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:49:26,716 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107127632] [2020-10-05 22:49:26,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:49:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:49:26,968 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:49:26,968 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107127632] [2020-10-05 22:49:26,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:49:26,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 22:49:26,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112246434] [2020-10-05 22:49:26,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 22:49:26,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:49:26,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 22:49:26,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-05 22:49:26,970 INFO L87 Difference]: Start difference. First operand 477 states and 1364 transitions. Second operand 8 states. [2020-10-05 22:49:27,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:49:27,204 INFO L93 Difference]: Finished difference Result 525 states and 1474 transitions. [2020-10-05 22:49:27,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:49:27,205 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-10-05 22:49:27,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:49:27,209 INFO L225 Difference]: With dead ends: 525 [2020-10-05 22:49:27,209 INFO L226 Difference]: Without dead ends: 493 [2020-10-05 22:49:27,210 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-05 22:49:27,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2020-10-05 22:49:27,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 425. [2020-10-05 22:49:27,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2020-10-05 22:49:27,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1202 transitions. [2020-10-05 22:49:27,223 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 1202 transitions. Word has length 16 [2020-10-05 22:49:27,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:49:27,224 INFO L479 AbstractCegarLoop]: Abstraction has 425 states and 1202 transitions. [2020-10-05 22:49:27,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 22:49:27,224 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1202 transitions. [2020-10-05 22:49:27,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 22:49:27,225 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:49:27,225 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:49:27,226 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 22:49:27,226 INFO L427 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:49:27,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:49:27,226 INFO L82 PathProgramCache]: Analyzing trace with hash -880379975, now seen corresponding path program 1 times [2020-10-05 22:49:27,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:49:27,227 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826806141] [2020-10-05 22:49:27,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:49:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:49:27,600 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:49:27,601 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826806141] [2020-10-05 22:49:27,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:49:27,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 22:49:27,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790759464] [2020-10-05 22:49:27,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 22:49:27,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:49:27,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 22:49:27,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-05 22:49:27,603 INFO L87 Difference]: Start difference. First operand 425 states and 1202 transitions. Second operand 8 states. [2020-10-05 22:49:27,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:49:27,936 INFO L93 Difference]: Finished difference Result 553 states and 1553 transitions. [2020-10-05 22:49:27,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:49:27,936 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-10-05 22:49:27,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:49:27,940 INFO L225 Difference]: With dead ends: 553 [2020-10-05 22:49:27,940 INFO L226 Difference]: Without dead ends: 521 [2020-10-05 22:49:27,941 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-05 22:49:27,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-10-05 22:49:27,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 461. [2020-10-05 22:49:27,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2020-10-05 22:49:27,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 1319 transitions. [2020-10-05 22:49:27,959 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 1319 transitions. Word has length 16 [2020-10-05 22:49:27,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:49:27,959 INFO L479 AbstractCegarLoop]: Abstraction has 461 states and 1319 transitions. [2020-10-05 22:49:27,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 22:49:27,959 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 1319 transitions. [2020-10-05 22:49:27,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 22:49:27,961 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:49:27,961 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:49:27,961 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 22:49:27,961 INFO L427 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:49:27,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:49:27,961 INFO L82 PathProgramCache]: Analyzing trace with hash -658126201, now seen corresponding path program 2 times [2020-10-05 22:49:27,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:49:27,962 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757225946] [2020-10-05 22:49:27,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:49:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:49:28,274 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:49:28,275 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757225946] [2020-10-05 22:49:28,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:49:28,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 22:49:28,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354161816] [2020-10-05 22:49:28,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 22:49:28,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:49:28,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 22:49:28,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-05 22:49:28,277 INFO L87 Difference]: Start difference. First operand 461 states and 1319 transitions. Second operand 8 states. [2020-10-05 22:49:28,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:49:28,582 INFO L93 Difference]: Finished difference Result 669 states and 1841 transitions. [2020-10-05 22:49:28,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 22:49:28,583 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-10-05 22:49:28,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:49:28,587 INFO L225 Difference]: With dead ends: 669 [2020-10-05 22:49:28,587 INFO L226 Difference]: Without dead ends: 579 [2020-10-05 22:49:28,587 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-05 22:49:28,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-10-05 22:49:28,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 453. [2020-10-05 22:49:28,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2020-10-05 22:49:28,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 1270 transitions. [2020-10-05 22:49:28,600 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 1270 transitions. Word has length 16 [2020-10-05 22:49:28,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:49:28,600 INFO L479 AbstractCegarLoop]: Abstraction has 453 states and 1270 transitions. [2020-10-05 22:49:28,600 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 22:49:28,600 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 1270 transitions. [2020-10-05 22:49:28,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 22:49:28,602 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:49:28,602 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:49:28,602 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 22:49:28,602 INFO L427 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:49:28,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:49:28,603 INFO L82 PathProgramCache]: Analyzing trace with hash -658556729, now seen corresponding path program 1 times [2020-10-05 22:49:28,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:49:28,603 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327665878] [2020-10-05 22:49:28,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:49:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:49:28,697 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:49:28,698 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327665878] [2020-10-05 22:49:28,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:49:28,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 22:49:28,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472589743] [2020-10-05 22:49:28,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 22:49:28,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:49:28,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 22:49:28,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-05 22:49:28,700 INFO L87 Difference]: Start difference. First operand 453 states and 1270 transitions. Second operand 6 states. [2020-10-05 22:49:28,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:49:28,834 INFO L93 Difference]: Finished difference Result 719 states and 1993 transitions. [2020-10-05 22:49:28,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 22:49:28,835 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-05 22:49:28,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:49:28,839 INFO L225 Difference]: With dead ends: 719 [2020-10-05 22:49:28,839 INFO L226 Difference]: Without dead ends: 553 [2020-10-05 22:49:28,840 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 22:49:28,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-10-05 22:49:28,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 546. [2020-10-05 22:49:28,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2020-10-05 22:49:28,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1490 transitions. [2020-10-05 22:49:28,853 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 1490 transitions. Word has length 16 [2020-10-05 22:49:28,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:49:28,853 INFO L479 AbstractCegarLoop]: Abstraction has 546 states and 1490 transitions. [2020-10-05 22:49:28,853 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 22:49:28,853 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1490 transitions. [2020-10-05 22:49:28,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 22:49:28,855 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:49:28,855 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:49:28,855 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-05 22:49:28,855 INFO L427 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:49:28,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:49:28,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1563905219, now seen corresponding path program 2 times [2020-10-05 22:49:28,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:49:28,856 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621728324] [2020-10-05 22:49:28,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:49:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:49:29,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:49:29,041 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621728324] [2020-10-05 22:49:29,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:49:29,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 22:49:29,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568585161] [2020-10-05 22:49:29,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 22:49:29,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:49:29,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 22:49:29,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-05 22:49:29,043 INFO L87 Difference]: Start difference. First operand 546 states and 1490 transitions. Second operand 7 states. [2020-10-05 22:49:29,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:49:29,210 INFO L93 Difference]: Finished difference Result 738 states and 1986 transitions. [2020-10-05 22:49:29,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:49:29,211 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-05 22:49:29,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:49:29,215 INFO L225 Difference]: With dead ends: 738 [2020-10-05 22:49:29,215 INFO L226 Difference]: Without dead ends: 542 [2020-10-05 22:49:29,215 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-05 22:49:29,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-10-05 22:49:29,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 536. [2020-10-05 22:49:29,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2020-10-05 22:49:29,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1453 transitions. [2020-10-05 22:49:29,227 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1453 transitions. Word has length 16 [2020-10-05 22:49:29,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:49:29,228 INFO L479 AbstractCegarLoop]: Abstraction has 536 states and 1453 transitions. [2020-10-05 22:49:29,228 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 22:49:29,228 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1453 transitions. [2020-10-05 22:49:29,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 22:49:29,230 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:49:29,230 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:49:29,230 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-05 22:49:29,230 INFO L427 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:49:29,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:49:29,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1070278051, now seen corresponding path program 3 times [2020-10-05 22:49:29,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:49:29,231 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956500294] [2020-10-05 22:49:29,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:49:29,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:49:29,282 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:49:29,283 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956500294] [2020-10-05 22:49:29,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:49:29,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 22:49:29,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172651249] [2020-10-05 22:49:29,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 22:49:29,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:49:29,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 22:49:29,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 22:49:29,285 INFO L87 Difference]: Start difference. First operand 536 states and 1453 transitions. Second operand 4 states. [2020-10-05 22:49:29,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:49:29,330 INFO L93 Difference]: Finished difference Result 527 states and 1274 transitions. [2020-10-05 22:49:29,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 22:49:29,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-05 22:49:29,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:49:29,333 INFO L225 Difference]: With dead ends: 527 [2020-10-05 22:49:29,333 INFO L226 Difference]: Without dead ends: 393 [2020-10-05 22:49:29,334 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:49:29,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2020-10-05 22:49:29,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2020-10-05 22:49:29,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-10-05 22:49:29,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 935 transitions. [2020-10-05 22:49:29,344 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 935 transitions. Word has length 16 [2020-10-05 22:49:29,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:49:29,345 INFO L479 AbstractCegarLoop]: Abstraction has 393 states and 935 transitions. [2020-10-05 22:49:29,345 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 22:49:29,345 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 935 transitions. [2020-10-05 22:49:29,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 22:49:29,346 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:49:29,346 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:49:29,347 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-05 22:49:29,347 INFO L427 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:49:29,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:49:29,347 INFO L82 PathProgramCache]: Analyzing trace with hash -55478072, now seen corresponding path program 1 times [2020-10-05 22:49:29,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:49:29,348 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854847936] [2020-10-05 22:49:29,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:49:29,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:49:29,446 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:49:29,447 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854847936] [2020-10-05 22:49:29,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:49:29,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 22:49:29,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301746119] [2020-10-05 22:49:29,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 22:49:29,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:49:29,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 22:49:29,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 22:49:29,452 INFO L87 Difference]: Start difference. First operand 393 states and 935 transitions. Second operand 5 states. [2020-10-05 22:49:29,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:49:29,504 INFO L93 Difference]: Finished difference Result 325 states and 706 transitions. [2020-10-05 22:49:29,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 22:49:29,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-05 22:49:29,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:49:29,507 INFO L225 Difference]: With dead ends: 325 [2020-10-05 22:49:29,507 INFO L226 Difference]: Without dead ends: 251 [2020-10-05 22:49:29,508 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:49:29,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2020-10-05 22:49:29,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2020-10-05 22:49:29,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2020-10-05 22:49:29,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 530 transitions. [2020-10-05 22:49:29,515 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 530 transitions. Word has length 17 [2020-10-05 22:49:29,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:49:29,516 INFO L479 AbstractCegarLoop]: Abstraction has 251 states and 530 transitions. [2020-10-05 22:49:29,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 22:49:29,516 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 530 transitions. [2020-10-05 22:49:29,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 22:49:29,519 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:49:29,519 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:49:29,519 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-05 22:49:29,520 INFO L427 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:49:29,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:49:29,520 INFO L82 PathProgramCache]: Analyzing trace with hash -996306610, now seen corresponding path program 1 times [2020-10-05 22:49:29,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:49:29,520 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929041433] [2020-10-05 22:49:29,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:49:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:49:30,004 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:49:30,004 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929041433] [2020-10-05 22:49:30,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:49:30,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 22:49:30,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446120025] [2020-10-05 22:49:30,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 22:49:30,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:49:30,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 22:49:30,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 22:49:30,006 INFO L87 Difference]: Start difference. First operand 251 states and 530 transitions. Second operand 9 states. [2020-10-05 22:49:30,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:49:30,235 INFO L93 Difference]: Finished difference Result 300 states and 630 transitions. [2020-10-05 22:49:30,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:49:30,236 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-05 22:49:30,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:49:30,238 INFO L225 Difference]: With dead ends: 300 [2020-10-05 22:49:30,239 INFO L226 Difference]: Without dead ends: 296 [2020-10-05 22:49:30,239 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-10-05 22:49:30,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-10-05 22:49:30,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 251. [2020-10-05 22:49:30,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2020-10-05 22:49:30,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 532 transitions. [2020-10-05 22:49:30,245 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 532 transitions. Word has length 19 [2020-10-05 22:49:30,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:49:30,245 INFO L479 AbstractCegarLoop]: Abstraction has 251 states and 532 transitions. [2020-10-05 22:49:30,245 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 22:49:30,245 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 532 transitions. [2020-10-05 22:49:30,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 22:49:30,246 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:49:30,247 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:49:30,247 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-05 22:49:30,247 INFO L427 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:49:30,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:49:30,247 INFO L82 PathProgramCache]: Analyzing trace with hash -256873496, now seen corresponding path program 1 times [2020-10-05 22:49:30,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:49:30,248 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605107382] [2020-10-05 22:49:30,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:49:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:49:30,302 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:49:30,302 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605107382] [2020-10-05 22:49:30,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:49:30,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 22:49:30,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653315754] [2020-10-05 22:49:30,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 22:49:30,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:49:30,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 22:49:30,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 22:49:30,304 INFO L87 Difference]: Start difference. First operand 251 states and 532 transitions. Second operand 4 states. [2020-10-05 22:49:30,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:49:30,326 INFO L93 Difference]: Finished difference Result 339 states and 697 transitions. [2020-10-05 22:49:30,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 22:49:30,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-05 22:49:30,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:49:30,327 INFO L225 Difference]: With dead ends: 339 [2020-10-05 22:49:30,328 INFO L226 Difference]: Without dead ends: 182 [2020-10-05 22:49:30,328 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:49:30,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-10-05 22:49:30,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 176. [2020-10-05 22:49:30,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-10-05 22:49:30,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 350 transitions. [2020-10-05 22:49:30,332 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 350 transitions. Word has length 19 [2020-10-05 22:49:30,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:49:30,333 INFO L479 AbstractCegarLoop]: Abstraction has 176 states and 350 transitions. [2020-10-05 22:49:30,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 22:49:30,333 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 350 transitions. [2020-10-05 22:49:30,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 22:49:30,334 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:49:30,334 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:49:30,334 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-05 22:49:30,334 INFO L427 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:49:30,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:49:30,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1744897356, now seen corresponding path program 2 times [2020-10-05 22:49:30,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:49:30,336 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347462882] [2020-10-05 22:49:30,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:49:30,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:49:30,718 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:49:30,719 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347462882] [2020-10-05 22:49:30,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:49:30,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 22:49:30,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434075102] [2020-10-05 22:49:30,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 22:49:30,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:49:30,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 22:49:30,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-05 22:49:30,720 INFO L87 Difference]: Start difference. First operand 176 states and 350 transitions. Second operand 9 states. [2020-10-05 22:49:30,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:49:30,918 INFO L93 Difference]: Finished difference Result 209 states and 401 transitions. [2020-10-05 22:49:30,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:49:30,919 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-05 22:49:30,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:49:30,920 INFO L225 Difference]: With dead ends: 209 [2020-10-05 22:49:30,920 INFO L226 Difference]: Without dead ends: 145 [2020-10-05 22:49:30,920 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-10-05 22:49:30,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-10-05 22:49:30,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 131. [2020-10-05 22:49:30,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-10-05 22:49:30,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 262 transitions. [2020-10-05 22:49:30,924 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 262 transitions. Word has length 19 [2020-10-05 22:49:30,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:49:30,924 INFO L479 AbstractCegarLoop]: Abstraction has 131 states and 262 transitions. [2020-10-05 22:49:30,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 22:49:30,924 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 262 transitions. [2020-10-05 22:49:30,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 22:49:30,925 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:49:30,925 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:49:30,925 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-05 22:49:30,925 INFO L427 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:49:30,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:49:30,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1136707252, now seen corresponding path program 2 times [2020-10-05 22:49:30,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:49:30,926 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210880170] [2020-10-05 22:49:30,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:49:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:49:30,994 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:49:30,994 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210880170] [2020-10-05 22:49:30,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:49:30,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 22:49:30,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041733840] [2020-10-05 22:49:30,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 22:49:30,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:49:30,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 22:49:30,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 22:49:30,996 INFO L87 Difference]: Start difference. First operand 131 states and 262 transitions. Second operand 6 states. [2020-10-05 22:49:31,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:49:31,044 INFO L93 Difference]: Finished difference Result 112 states and 223 transitions. [2020-10-05 22:49:31,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:49:31,045 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-05 22:49:31,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:49:31,046 INFO L225 Difference]: With dead ends: 112 [2020-10-05 22:49:31,046 INFO L226 Difference]: Without dead ends: 63 [2020-10-05 22:49:31,047 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:49:31,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-05 22:49:31,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-10-05 22:49:31,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-05 22:49:31,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 110 transitions. [2020-10-05 22:49:31,049 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 110 transitions. Word has length 19 [2020-10-05 22:49:31,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:49:31,049 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 110 transitions. [2020-10-05 22:49:31,049 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 22:49:31,049 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 110 transitions. [2020-10-05 22:49:31,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 22:49:31,050 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:49:31,050 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] [2020-10-05 22:49:31,050 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-05 22:49:31,050 INFO L427 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:49:31,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:49:31,051 INFO L82 PathProgramCache]: Analyzing trace with hash -898304440, now seen corresponding path program 1 times [2020-10-05 22:49:31,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:49:31,051 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773199306] [2020-10-05 22:49:31,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:49:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 22:49:31,087 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 22:49:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 22:49:31,131 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 22:49:31,165 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 22:49:31,166 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 22:49:31,166 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-05 22:49:31,183 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:49:31,184 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,185 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:49:31,185 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,185 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:49:31,185 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,185 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:49:31,186 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,186 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:49:31,186 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,186 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:49:31,186 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,187 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:49:31,187 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,188 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:49:31,188 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,188 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:49:31,188 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,188 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:49:31,188 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,189 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:49:31,189 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,189 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:49:31,189 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,189 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:49:31,189 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,190 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:49:31,190 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,190 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:49:31,190 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,190 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:49:31,191 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,192 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:49:31,192 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,192 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:49:31,192 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,193 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:49:31,193 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,193 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:49:31,193 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,193 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:49:31,194 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,194 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:49:31,194 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,194 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:49:31,195 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,195 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:49:31,195 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,195 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:49:31,195 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,195 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:49:31,196 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,196 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:49:31,196 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,196 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:49:31,196 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,196 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:49:31,196 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,197 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:49:31,197 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,197 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:49:31,198 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,198 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:49:31,198 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,198 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:49:31,199 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,199 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:49:31,199 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,199 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:49:31,200 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,200 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:49:31,200 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:49:31,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 10:49:31 BasicIcfg [2020-10-05 22:49:31,267 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 22:49:31,269 INFO L168 Benchmark]: Toolchain (without parser) took 17498.34 ms. Allocated memory was 138.4 MB in the beginning and 448.8 MB in the end (delta: 310.4 MB). Free memory was 100.1 MB in the beginning and 155.4 MB in the end (delta: -55.4 MB). Peak memory consumption was 255.0 MB. Max. memory is 7.1 GB. [2020-10-05 22:49:31,270 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-05 22:49:31,271 INFO L168 Benchmark]: CACSL2BoogieTranslator took 744.45 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 99.6 MB in the beginning and 154.3 MB in the end (delta: -54.7 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. [2020-10-05 22:49:31,271 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.85 ms. Allocated memory is still 201.3 MB. Free memory was 154.3 MB in the beginning and 151.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-05 22:49:31,272 INFO L168 Benchmark]: Boogie Preprocessor took 41.23 ms. Allocated memory is still 201.3 MB. Free memory was 151.4 MB in the beginning and 148.6 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:49:31,272 INFO L168 Benchmark]: RCFGBuilder took 2305.11 ms. Allocated memory was 201.3 MB in the beginning and 252.2 MB in the end (delta: 50.9 MB). Free memory was 148.6 MB in the beginning and 172.1 MB in the end (delta: -23.5 MB). Peak memory consumption was 103.8 MB. Max. memory is 7.1 GB. [2020-10-05 22:49:31,273 INFO L168 Benchmark]: TraceAbstraction took 14331.42 ms. Allocated memory was 252.2 MB in the beginning and 448.8 MB in the end (delta: 196.6 MB). Free memory was 172.1 MB in the beginning and 155.4 MB in the end (delta: 16.7 MB). Peak memory consumption was 213.3 MB. Max. memory is 7.1 GB. [2020-10-05 22:49:31,276 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.25 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 744.45 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 99.6 MB in the beginning and 154.3 MB in the end (delta: -54.7 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.85 ms. Allocated memory is still 201.3 MB. Free memory was 154.3 MB in the beginning and 151.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.23 ms. Allocated memory is still 201.3 MB. Free memory was 151.4 MB in the beginning and 148.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2305.11 ms. Allocated memory was 201.3 MB in the beginning and 252.2 MB in the end (delta: 50.9 MB). Free memory was 148.6 MB in the beginning and 172.1 MB in the end (delta: -23.5 MB). Peak memory consumption was 103.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14331.42 ms. Allocated memory was 252.2 MB in the beginning and 448.8 MB in the end (delta: 196.6 MB). Free memory was 172.1 MB in the beginning and 155.4 MB in the end (delta: 16.7 MB). Peak memory consumption was 213.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 100 ProgramPointsBefore, 37 ProgramPointsAfterwards, 92 TransitionsBefore, 28 TransitionsAfterwards, 1650 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 834 VarBasedMoverChecksPositive, 46 VarBasedMoverChecksNegative, 20 SemBasedMoverChecksPositive, 40 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 4579 CheckedPairsTotal, 75 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_p2_EAX = 0; [L701] 0 _Bool main$tmp_guard0; [L702] 0 _Bool main$tmp_guard1; [L704] 0 int x = 0; [L706] 0 int y = 0; [L708] 0 int z = 0; [L709] 0 _Bool z$flush_delayed; [L710] 0 int z$mem_tmp; [L711] 0 _Bool z$r_buff0_thd0; [L712] 0 _Bool z$r_buff0_thd1; [L713] 0 _Bool z$r_buff0_thd2; [L714] 0 _Bool z$r_buff0_thd3; [L715] 0 _Bool z$r_buff1_thd0; [L716] 0 _Bool z$r_buff1_thd1; [L717] 0 _Bool z$r_buff1_thd2; [L718] 0 _Bool z$r_buff1_thd3; [L719] 0 _Bool z$read_delayed; [L720] 0 int *z$read_delayed_var; [L721] 0 int z$w_buff0; [L722] 0 _Bool z$w_buff0_used; [L723] 0 int z$w_buff1; [L724] 0 _Bool z$w_buff1_used; [L725] 0 _Bool weak$$choice0; [L726] 0 _Bool weak$$choice2; [L807] 0 pthread_t t2031; [L808] FCALL, FORK 0 pthread_create(&t2031, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] 0 pthread_t t2032; [L810] FCALL, FORK 0 pthread_create(&t2032, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L811] 0 pthread_t t2033; [L812] FCALL, FORK 0 pthread_create(&t2033, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L730] 1 z$w_buff1 = z$w_buff0 [L731] 1 z$w_buff0 = 2 [L732] 1 z$w_buff1_used = z$w_buff0_used [L733] 1 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L735] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L736] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L737] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L738] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L739] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L765] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L766] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L767] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L768] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L768] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L769] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L769] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L779] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L774] 2 return 0; [L782] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L789] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L745] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L747] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L747] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L748] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L748] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L749] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L749] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L752] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L754] 1 return 0; [L792] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 3 return 0; [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L818] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L818] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L819] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L820] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L820] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L821] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L821] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L822] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L822] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L825] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 0 z$flush_delayed = weak$$choice2 [L828] 0 z$mem_tmp = z [L829] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L829] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L829] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L830] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L830] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L830] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L830] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L831] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L831] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1 [L831] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L831] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L831] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L832] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L832] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L833] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L834] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L834] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L834] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L834] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L834] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L835] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L835] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L836] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L837] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L837] 0 z = z$flush_delayed ? z$mem_tmp : z [L838] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 91 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.1s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.0s, HoareTripleCheckerStatistics: 637 SDtfs, 754 SDslu, 1542 SDs, 0 SdLazy, 908 SolverSat, 216 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=974occurred 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.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 339 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 343 NumberOfCodeBlocks, 343 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 51380 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...