/usr/bin/java -Xmx16000000000 -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/safe030_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-09 13:01:32,448 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-09 13:01:32,451 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-09 13:01:32,480 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-09 13:01:32,481 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-09 13:01:32,482 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-09 13:01:32,483 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-09 13:01:32,485 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-09 13:01:32,487 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-09 13:01:32,488 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-09 13:01:32,489 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-09 13:01:32,490 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-09 13:01:32,490 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-09 13:01:32,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-09 13:01:32,492 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-09 13:01:32,494 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-09 13:01:32,494 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-09 13:01:32,495 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-09 13:01:32,497 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-09 13:01:32,499 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-09 13:01:32,500 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-09 13:01:32,501 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-09 13:01:32,503 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-09 13:01:32,503 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-09 13:01:32,506 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-09 13:01:32,506 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-09 13:01:32,506 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-09 13:01:32,507 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-09 13:01:32,508 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-09 13:01:32,509 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-09 13:01:32,509 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-09 13:01:32,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-09 13:01:32,510 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-09 13:01:32,511 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-09 13:01:32,512 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-09 13:01:32,512 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-09 13:01:32,513 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-09 13:01:32,513 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-09 13:01:32,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-09 13:01:32,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-09 13:01:32,515 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-09 13:01:32,516 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-09 13:01:32,541 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-09 13:01:32,541 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-09 13:01:32,543 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-09 13:01:32,543 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-09 13:01:32,543 INFO L138 SettingsManager]: * Use SBE=true [2020-10-09 13:01:32,543 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-09 13:01:32,543 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-09 13:01:32,544 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-09 13:01:32,544 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-09 13:01:32,544 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-09 13:01:32,544 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-09 13:01:32,544 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-09 13:01:32,544 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-09 13:01:32,545 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-09 13:01:32,545 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-09 13:01:32,545 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-09 13:01:32,545 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-09 13:01:32,546 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-09 13:01:32,546 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-09 13:01:32,546 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-09 13:01:32,546 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-09 13:01:32,546 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 13:01:32,546 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-09 13:01:32,547 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-09 13:01:32,547 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-09 13:01:32,547 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-09 13:01:32,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-09 13:01:32,547 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-09 13:01:32,548 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-09 13:01:32,548 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-09 13:01:32,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-09 13:01:32,855 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-09 13:01:32,859 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-09 13:01:32,860 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-09 13:01:32,861 INFO L275 PluginConnector]: CDTParser initialized [2020-10-09 13:01:32,861 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_rmo.opt.i [2020-10-09 13:01:32,936 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20d7e13e2/790f222087aa48a7a67247552409c3e7/FLAGdcc51e6eb [2020-10-09 13:01:33,498 INFO L306 CDTParser]: Found 1 translation units. [2020-10-09 13:01:33,499 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_rmo.opt.i [2020-10-09 13:01:33,528 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20d7e13e2/790f222087aa48a7a67247552409c3e7/FLAGdcc51e6eb [2020-10-09 13:01:33,741 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20d7e13e2/790f222087aa48a7a67247552409c3e7 [2020-10-09 13:01:33,754 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-09 13:01:33,756 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-09 13:01:33,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-09 13:01:33,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-09 13:01:33,763 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-09 13:01:33,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 01:01:33" (1/1) ... [2020-10-09 13:01:33,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23c2a4c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:01:33, skipping insertion in model container [2020-10-09 13:01:33,768 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 01:01:33" (1/1) ... [2020-10-09 13:01:33,777 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-09 13:01:33,830 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-09 13:01:34,349 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 13:01:34,371 INFO L203 MainTranslator]: Completed pre-run [2020-10-09 13:01:34,463 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 13:01:34,537 INFO L208 MainTranslator]: Completed translation [2020-10-09 13:01:34,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:01:34 WrapperNode [2020-10-09 13:01:34,538 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-09 13:01:34,539 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-09 13:01:34,539 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-09 13:01:34,539 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-09 13:01:34,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:01:34" (1/1) ... [2020-10-09 13:01:34,568 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:01:34" (1/1) ... [2020-10-09 13:01:34,626 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-09 13:01:34,627 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-09 13:01:34,627 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-09 13:01:34,627 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-09 13:01:34,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:01:34" (1/1) ... [2020-10-09 13:01:34,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:01:34" (1/1) ... [2020-10-09 13:01:34,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:01:34" (1/1) ... [2020-10-09 13:01:34,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:01:34" (1/1) ... [2020-10-09 13:01:34,650 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:01:34" (1/1) ... [2020-10-09 13:01:34,654 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:01:34" (1/1) ... [2020-10-09 13:01:34,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:01:34" (1/1) ... [2020-10-09 13:01:34,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-09 13:01:34,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-09 13:01:34,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-09 13:01:34,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-09 13:01:34,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:01:34" (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-09 13:01:34,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-09 13:01:34,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-09 13:01:34,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-09 13:01:34,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-09 13:01:34,744 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-09 13:01:34,744 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-09 13:01:34,744 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-09 13:01:34,744 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-09 13:01:34,744 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-09 13:01:34,745 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-09 13:01:34,745 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-09 13:01:34,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-09 13:01:34,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-09 13:01:34,747 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-09 13:01:36,574 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-09 13:01:36,574 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-09 13:01:36,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 01:01:36 BoogieIcfgContainer [2020-10-09 13:01:36,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-09 13:01:36,578 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-09 13:01:36,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-09 13:01:36,581 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-09 13:01:36,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.10 01:01:33" (1/3) ... [2020-10-09 13:01:36,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32edd2f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 01:01:36, skipping insertion in model container [2020-10-09 13:01:36,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:01:34" (2/3) ... [2020-10-09 13:01:36,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32edd2f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 01:01:36, skipping insertion in model container [2020-10-09 13:01:36,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 01:01:36" (3/3) ... [2020-10-09 13:01:36,585 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_rmo.opt.i [2020-10-09 13:01:36,597 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-09 13:01:36,597 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-09 13:01:36,605 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-09 13:01:36,606 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-09 13:01:36,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,634 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,634 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,635 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,635 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,635 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,636 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,636 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,636 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,636 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,636 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,638 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,639 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,639 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,639 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,639 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,641 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,641 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,641 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,642 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,642 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,649 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,651 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,651 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,656 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,657 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,657 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,657 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,657 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,657 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,658 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,658 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,658 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,658 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,658 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,658 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,660 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,661 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:01:36,676 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-09 13:01:36,698 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 13:01:36,698 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-09 13:01:36,698 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 13:01:36,698 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 13:01:36,698 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 13:01:36,699 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 13:01:36,699 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 13:01:36,699 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 13:01:36,717 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-09 13:01:36,721 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 90 transitions, 195 flow [2020-10-09 13:01:36,723 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 90 transitions, 195 flow [2020-10-09 13:01:36,725 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 98 places, 90 transitions, 195 flow [2020-10-09 13:01:36,775 INFO L129 PetriNetUnfolder]: 2/87 cut-off events. [2020-10-09 13:01:36,775 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 13:01:36,780 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-09 13:01:36,784 INFO L117 LiptonReduction]: Number of co-enabled transitions 1536 [2020-10-09 13:01:37,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-09 13:01:37,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:37,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-09 13:01:37,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:37,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-09 13:01:37,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:37,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-09 13:01:37,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:37,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-09 13:01:37,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:37,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-09 13:01:37,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:37,323 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-09 13:01:37,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:37,325 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-09 13:01:37,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:37,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-09 13:01:37,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:37,349 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-09 13:01:37,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:37,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-09 13:01:37,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:37,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-09 13:01:37,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:37,602 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-09 13:01:37,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:37,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-09 13:01:37,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:37,654 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-09 13:01:37,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:37,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-09 13:01:37,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:37,682 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-09 13:01:37,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:37,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-09 13:01:37,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:37,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-09 13:01:37,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:37,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-09 13:01:37,776 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:37,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-09 13:01:37,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:37,800 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-09 13:01:37,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:37,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 13:01:37,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:37,863 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-09 13:01:37,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:37,865 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-09 13:01:37,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:37,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-09 13:01:37,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 13:01:37,871 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-09 13:01:37,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 13:01:37,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-09 13:01:37,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 13:01:37,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-09 13:01:37,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:37,879 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-09 13:01:37,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:37,882 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-09 13:01:37,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:37,926 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-09 13:01:37,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:37,928 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-09 13:01:37,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:37,931 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-09 13:01:37,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-09 13:01:37,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-09 13:01:37,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:37,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 13:01:37,989 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:37,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 13:01:37,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:37,992 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 13:01:37,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:37,997 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-09 13:01:37,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:37,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-09 13:01:37,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:38,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-10-09 13:01:38,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:38,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-09 13:01:38,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:39,375 WARN L193 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-10-09 13:01:39,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-09 13:01:39,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:39,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-09 13:01:39,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:40,219 WARN L193 SmtUtils]: Spent 825.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 121 [2020-10-09 13:01:40,370 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:40,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:40,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:40,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:40,374 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:40,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 13:01:40,376 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 13:01:40,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 13:01:40,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 13:01:40,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:40,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:40,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:40,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:40,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 13:01:40,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 13:01:40,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 13:01:40,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 13:01:40,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:40,484 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:40,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:40,487 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:40,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 13:01:40,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 13:01:40,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 13:01:40,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:40,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:40,512 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:40,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:40,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:40,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 13:01:40,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 13:01:40,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 13:01:40,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 13:01:40,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:40,562 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:40,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:40,564 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:40,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 13:01:40,566 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 13:01:40,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 13:01:40,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 13:01:40,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:40,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:40,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:40,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:40,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 13:01:40,590 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 13:01:40,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 13:01:40,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 13:01:40,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:40,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:40,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:40,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:40,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 13:01:40,704 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 13:01:40,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 13:01:40,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:40,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:40,723 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:40,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:40,725 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:40,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 13:01:40,729 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 13:01:40,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 13:01:40,842 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-09 13:01:40,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:41,143 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-09 13:01:41,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:41,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:41,424 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:41,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:41,426 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:41,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:41,428 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-09 13:01:41,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:41,441 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 13:01:41,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:41,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:41,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:41,445 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:41,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 13:01:41,447 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 13:01:41,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 13:01:41,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:41,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:41,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:41,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:41,501 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:41,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:41,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-09 13:01:41,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:41,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 13:01:41,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:41,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:41,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:41,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:41,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 13:01:41,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 13:01:41,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 13:01:41,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:41,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:41,593 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:41,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:41,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:41,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 13:01:41,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 13:01:41,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 13:01:41,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:41,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:41,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:41,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:41,617 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:41,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:41,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-09 13:01:41,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:41,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:41,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:41,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:41,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:41,681 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:41,682 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 13:01:41,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 13:01:41,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 13:01:41,697 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 13:01:41,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:41,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:41,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 13:01:41,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 13:01:41,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:41,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-09 13:01:41,704 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 13:01:42,383 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-10-09 13:01:42,485 INFO L132 LiptonReduction]: Checked pairs total: 4033 [2020-10-09 13:01:42,485 INFO L134 LiptonReduction]: Total number of compositions: 75 [2020-10-09 13:01:42,492 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 69 flow [2020-10-09 13:01:42,544 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 770 states. [2020-10-09 13:01:42,546 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states. [2020-10-09 13:01:42,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-09 13:01:42,553 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:01:42,554 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:01:42,555 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:01:42,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:01:42,560 INFO L82 PathProgramCache]: Analyzing trace with hash -66047429, now seen corresponding path program 1 times [2020-10-09 13:01:42,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:01:42,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575223288] [2020-10-09 13:01:42,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:01:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:01:42,809 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-09 13:01:42,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575223288] [2020-10-09 13:01:42,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:01:42,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-09 13:01:42,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793259347] [2020-10-09 13:01:42,815 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 13:01:42,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:01:42,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 13:01:42,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 13:01:42,828 INFO L87 Difference]: Start difference. First operand 770 states. Second operand 3 states. [2020-10-09 13:01:42,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:01:42,930 INFO L93 Difference]: Finished difference Result 650 states and 2028 transitions. [2020-10-09 13:01:42,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 13:01:42,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-09 13:01:42,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:01:42,953 INFO L225 Difference]: With dead ends: 650 [2020-10-09 13:01:42,953 INFO L226 Difference]: Without dead ends: 550 [2020-10-09 13:01:42,955 INFO L673 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-09 13:01:42,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-10-09 13:01:43,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2020-10-09 13:01:43,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2020-10-09 13:01:43,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1693 transitions. [2020-10-09 13:01:43,067 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1693 transitions. Word has length 7 [2020-10-09 13:01:43,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:01:43,068 INFO L481 AbstractCegarLoop]: Abstraction has 550 states and 1693 transitions. [2020-10-09 13:01:43,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 13:01:43,069 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1693 transitions. [2020-10-09 13:01:43,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-09 13:01:43,071 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:01:43,071 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:01:43,071 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-09 13:01:43,072 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:01:43,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:01:43,072 INFO L82 PathProgramCache]: Analyzing trace with hash -522474688, now seen corresponding path program 1 times [2020-10-09 13:01:43,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:01:43,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016778323] [2020-10-09 13:01:43,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:01:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:01:43,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 13:01:43,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016778323] [2020-10-09 13:01:43,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:01:43,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-09 13:01:43,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584514357] [2020-10-09 13:01:43,260 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 13:01:43,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:01:43,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 13:01:43,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-09 13:01:43,262 INFO L87 Difference]: Start difference. First operand 550 states and 1693 transitions. Second operand 4 states. [2020-10-09 13:01:43,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:01:43,321 INFO L93 Difference]: Finished difference Result 630 states and 1862 transitions. [2020-10-09 13:01:43,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-09 13:01:43,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-09 13:01:43,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:01:43,331 INFO L225 Difference]: With dead ends: 630 [2020-10-09 13:01:43,331 INFO L226 Difference]: Without dead ends: 530 [2020-10-09 13:01:43,332 INFO L673 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-09 13:01:43,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-10-09 13:01:43,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2020-10-09 13:01:43,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2020-10-09 13:01:43,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1617 transitions. [2020-10-09 13:01:43,383 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1617 transitions. Word has length 10 [2020-10-09 13:01:43,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:01:43,384 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 1617 transitions. [2020-10-09 13:01:43,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 13:01:43,384 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1617 transitions. [2020-10-09 13:01:43,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-09 13:01:43,388 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:01:43,389 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:01:43,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-09 13:01:43,389 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:01:43,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:01:43,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1950155091, now seen corresponding path program 1 times [2020-10-09 13:01:43,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:01:43,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910320942] [2020-10-09 13:01:43,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:01:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:01:43,482 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-09 13:01:43,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910320942] [2020-10-09 13:01:43,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:01:43,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-09 13:01:43,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106090337] [2020-10-09 13:01:43,483 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 13:01:43,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:01:43,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 13:01:43,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-09 13:01:43,484 INFO L87 Difference]: Start difference. First operand 530 states and 1617 transitions. Second operand 4 states. [2020-10-09 13:01:43,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:01:43,552 INFO L93 Difference]: Finished difference Result 602 states and 1775 transitions. [2020-10-09 13:01:43,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-09 13:01:43,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-09 13:01:43,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:01:43,557 INFO L225 Difference]: With dead ends: 602 [2020-10-09 13:01:43,557 INFO L226 Difference]: Without dead ends: 522 [2020-10-09 13:01:43,558 INFO L673 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-09 13:01:43,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2020-10-09 13:01:43,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2020-10-09 13:01:43,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2020-10-09 13:01:43,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1587 transitions. [2020-10-09 13:01:43,575 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1587 transitions. Word has length 11 [2020-10-09 13:01:43,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:01:43,575 INFO L481 AbstractCegarLoop]: Abstraction has 522 states and 1587 transitions. [2020-10-09 13:01:43,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 13:01:43,575 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1587 transitions. [2020-10-09 13:01:43,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-09 13:01:43,576 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:01:43,577 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:01:43,577 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-09 13:01:43,577 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:01:43,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:01:43,577 INFO L82 PathProgramCache]: Analyzing trace with hash 306338463, now seen corresponding path program 1 times [2020-10-09 13:01:43,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:01:43,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912033266] [2020-10-09 13:01:43,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:01:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:01:43,711 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-09 13:01:43,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912033266] [2020-10-09 13:01:43,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:01:43,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-09 13:01:43,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420790657] [2020-10-09 13:01:43,712 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-09 13:01:43,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:01:43,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-09 13:01:43,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-09 13:01:43,713 INFO L87 Difference]: Start difference. First operand 522 states and 1587 transitions. Second operand 5 states. [2020-10-09 13:01:43,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:01:43,816 INFO L93 Difference]: Finished difference Result 578 states and 1705 transitions. [2020-10-09 13:01:43,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-09 13:01:43,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-09 13:01:43,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:01:43,820 INFO L225 Difference]: With dead ends: 578 [2020-10-09 13:01:43,821 INFO L226 Difference]: Without dead ends: 514 [2020-10-09 13:01:43,821 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-09 13:01:43,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2020-10-09 13:01:43,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2020-10-09 13:01:43,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2020-10-09 13:01:43,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 1557 transitions. [2020-10-09 13:01:43,837 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 1557 transitions. Word has length 12 [2020-10-09 13:01:43,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:01:43,838 INFO L481 AbstractCegarLoop]: Abstraction has 514 states and 1557 transitions. [2020-10-09 13:01:43,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-09 13:01:43,838 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 1557 transitions. [2020-10-09 13:01:43,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-09 13:01:43,839 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:01:43,839 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:01:43,840 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-09 13:01:43,840 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:01:43,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:01:43,840 INFO L82 PathProgramCache]: Analyzing trace with hash 325262475, now seen corresponding path program 1 times [2020-10-09 13:01:43,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:01:43,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99612289] [2020-10-09 13:01:43,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:01:43,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:01:43,957 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-09 13:01:43,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99612289] [2020-10-09 13:01:43,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:01:43,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-09 13:01:43,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512385570] [2020-10-09 13:01:43,959 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-09 13:01:43,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:01:43,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-09 13:01:43,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-09 13:01:43,960 INFO L87 Difference]: Start difference. First operand 514 states and 1557 transitions. Second operand 5 states. [2020-10-09 13:01:44,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:01:44,070 INFO L93 Difference]: Finished difference Result 574 states and 1682 transitions. [2020-10-09 13:01:44,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-09 13:01:44,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-09 13:01:44,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:01:44,075 INFO L225 Difference]: With dead ends: 574 [2020-10-09 13:01:44,075 INFO L226 Difference]: Without dead ends: 504 [2020-10-09 13:01:44,075 INFO L673 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-09 13:01:44,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2020-10-09 13:01:44,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2020-10-09 13:01:44,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2020-10-09 13:01:44,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1521 transitions. [2020-10-09 13:01:44,094 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1521 transitions. Word has length 12 [2020-10-09 13:01:44,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:01:44,094 INFO L481 AbstractCegarLoop]: Abstraction has 504 states and 1521 transitions. [2020-10-09 13:01:44,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-09 13:01:44,094 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1521 transitions. [2020-10-09 13:01:44,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-09 13:01:44,095 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:01:44,096 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:01:44,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-09 13:01:44,096 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:01:44,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:01:44,096 INFO L82 PathProgramCache]: Analyzing trace with hash 906516119, now seen corresponding path program 1 times [2020-10-09 13:01:44,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:01:44,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466858883] [2020-10-09 13:01:44,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:01:44,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:01:44,194 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-09 13:01:44,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466858883] [2020-10-09 13:01:44,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:01:44,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-09 13:01:44,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9990094] [2020-10-09 13:01:44,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-09 13:01:44,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:01:44,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-09 13:01:44,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-09 13:01:44,196 INFO L87 Difference]: Start difference. First operand 504 states and 1521 transitions. Second operand 7 states. [2020-10-09 13:01:44,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:01:44,377 INFO L93 Difference]: Finished difference Result 573 states and 1681 transitions. [2020-10-09 13:01:44,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-09 13:01:44,378 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-10-09 13:01:44,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:01:44,384 INFO L225 Difference]: With dead ends: 573 [2020-10-09 13:01:44,384 INFO L226 Difference]: Without dead ends: 500 [2020-10-09 13:01:44,385 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-10-09 13:01:44,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2020-10-09 13:01:44,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 482. [2020-10-09 13:01:44,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2020-10-09 13:01:44,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1441 transitions. [2020-10-09 13:01:44,409 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1441 transitions. Word has length 13 [2020-10-09 13:01:44,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:01:44,409 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 1441 transitions. [2020-10-09 13:01:44,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-09 13:01:44,410 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1441 transitions. [2020-10-09 13:01:44,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-09 13:01:44,412 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:01:44,412 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:01:44,412 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-09 13:01:44,412 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:01:44,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:01:44,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1491768963, now seen corresponding path program 1 times [2020-10-09 13:01:44,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:01:44,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308341360] [2020-10-09 13:01:44,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:01:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:01:44,484 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-09 13:01:44,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308341360] [2020-10-09 13:01:44,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:01:44,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-09 13:01:44,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281171143] [2020-10-09 13:01:44,485 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-09 13:01:44,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:01:44,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-09 13:01:44,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-09 13:01:44,486 INFO L87 Difference]: Start difference. First operand 482 states and 1441 transitions. Second operand 5 states. [2020-10-09 13:01:44,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:01:44,572 INFO L93 Difference]: Finished difference Result 531 states and 1551 transitions. [2020-10-09 13:01:44,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-09 13:01:44,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-09 13:01:44,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:01:44,577 INFO L225 Difference]: With dead ends: 531 [2020-10-09 13:01:44,577 INFO L226 Difference]: Without dead ends: 486 [2020-10-09 13:01:44,578 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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-09 13:01:44,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2020-10-09 13:01:44,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2020-10-09 13:01:44,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2020-10-09 13:01:44,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1452 transitions. [2020-10-09 13:01:44,596 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 1452 transitions. Word has length 13 [2020-10-09 13:01:44,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:01:44,597 INFO L481 AbstractCegarLoop]: Abstraction has 486 states and 1452 transitions. [2020-10-09 13:01:44,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-09 13:01:44,597 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 1452 transitions. [2020-10-09 13:01:44,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-09 13:01:44,598 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:01:44,598 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:01:44,598 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-09 13:01:44,599 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:01:44,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:01:44,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1427420403, now seen corresponding path program 2 times [2020-10-09 13:01:44,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:01:44,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552530764] [2020-10-09 13:01:44,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:01:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:01:44,724 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-09 13:01:44,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552530764] [2020-10-09 13:01:44,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:01:44,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-09 13:01:44,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173959651] [2020-10-09 13:01:44,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-09 13:01:44,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:01:44,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-09 13:01:44,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-09 13:01:44,727 INFO L87 Difference]: Start difference. First operand 486 states and 1452 transitions. Second operand 6 states. [2020-10-09 13:01:44,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:01:44,889 INFO L93 Difference]: Finished difference Result 513 states and 1497 transitions. [2020-10-09 13:01:44,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-09 13:01:44,890 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-09 13:01:44,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:01:44,894 INFO L225 Difference]: With dead ends: 513 [2020-10-09 13:01:44,894 INFO L226 Difference]: Without dead ends: 468 [2020-10-09 13:01:44,895 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-09 13:01:44,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2020-10-09 13:01:44,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 464. [2020-10-09 13:01:44,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-10-09 13:01:44,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1381 transitions. [2020-10-09 13:01:44,920 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1381 transitions. Word has length 13 [2020-10-09 13:01:44,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:01:44,921 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 1381 transitions. [2020-10-09 13:01:44,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-09 13:01:44,921 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1381 transitions. [2020-10-09 13:01:44,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-09 13:01:44,923 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:01:44,923 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:01:44,923 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-09 13:01:44,923 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:01:44,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:01:44,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1962812064, now seen corresponding path program 1 times [2020-10-09 13:01:44,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:01:44,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905656364] [2020-10-09 13:01:44,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:01:44,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:01:44,986 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-09 13:01:44,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905656364] [2020-10-09 13:01:44,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:01:44,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-09 13:01:44,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847844909] [2020-10-09 13:01:44,988 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 13:01:44,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:01:44,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 13:01:44,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-09 13:01:44,989 INFO L87 Difference]: Start difference. First operand 464 states and 1381 transitions. Second operand 4 states. [2020-10-09 13:01:45,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:01:45,020 INFO L93 Difference]: Finished difference Result 712 states and 2036 transitions. [2020-10-09 13:01:45,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-09 13:01:45,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-09 13:01:45,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:01:45,025 INFO L225 Difference]: With dead ends: 712 [2020-10-09 13:01:45,025 INFO L226 Difference]: Without dead ends: 496 [2020-10-09 13:01:45,026 INFO L673 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-09 13:01:45,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2020-10-09 13:01:45,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 442. [2020-10-09 13:01:45,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-10-09 13:01:45,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1262 transitions. [2020-10-09 13:01:45,071 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1262 transitions. Word has length 14 [2020-10-09 13:01:45,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:01:45,071 INFO L481 AbstractCegarLoop]: Abstraction has 442 states and 1262 transitions. [2020-10-09 13:01:45,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 13:01:45,072 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1262 transitions. [2020-10-09 13:01:45,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-09 13:01:45,073 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:01:45,073 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:01:45,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-09 13:01:45,073 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:01:45,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:01:45,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1963012913, now seen corresponding path program 1 times [2020-10-09 13:01:45,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:01:45,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515100281] [2020-10-09 13:01:45,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:01:45,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:01:45,200 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-09 13:01:45,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515100281] [2020-10-09 13:01:45,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:01:45,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-09 13:01:45,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208797111] [2020-10-09 13:01:45,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-09 13:01:45,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:01:45,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-09 13:01:45,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-09 13:01:45,202 INFO L87 Difference]: Start difference. First operand 442 states and 1262 transitions. Second operand 6 states. [2020-10-09 13:01:45,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:01:45,321 INFO L93 Difference]: Finished difference Result 526 states and 1481 transitions. [2020-10-09 13:01:45,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-09 13:01:45,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-09 13:01:45,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:01:45,326 INFO L225 Difference]: With dead ends: 526 [2020-10-09 13:01:45,326 INFO L226 Difference]: Without dead ends: 490 [2020-10-09 13:01:45,327 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-09 13:01:45,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2020-10-09 13:01:45,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 462. [2020-10-09 13:01:45,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2020-10-09 13:01:45,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 1310 transitions. [2020-10-09 13:01:45,341 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 1310 transitions. Word has length 14 [2020-10-09 13:01:45,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:01:45,342 INFO L481 AbstractCegarLoop]: Abstraction has 462 states and 1310 transitions. [2020-10-09 13:01:45,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-09 13:01:45,342 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 1310 transitions. [2020-10-09 13:01:45,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-09 13:01:45,343 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:01:45,344 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:01:45,344 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-09 13:01:45,344 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:01:45,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:01:45,344 INFO L82 PathProgramCache]: Analyzing trace with hash -2027361473, now seen corresponding path program 2 times [2020-10-09 13:01:45,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:01:45,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093723726] [2020-10-09 13:01:45,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:01:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:01:45,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 13:01:45,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093723726] [2020-10-09 13:01:45,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:01:45,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-09 13:01:45,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041047764] [2020-10-09 13:01:45,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-09 13:01:45,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:01:45,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-09 13:01:45,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-09 13:01:45,568 INFO L87 Difference]: Start difference. First operand 462 states and 1310 transitions. Second operand 6 states. [2020-10-09 13:01:45,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:01:45,719 INFO L93 Difference]: Finished difference Result 572 states and 1604 transitions. [2020-10-09 13:01:45,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-09 13:01:45,720 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-09 13:01:45,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:01:45,724 INFO L225 Difference]: With dead ends: 572 [2020-10-09 13:01:45,725 INFO L226 Difference]: Without dead ends: 530 [2020-10-09 13:01:45,725 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-09 13:01:45,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-10-09 13:01:45,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 494. [2020-10-09 13:01:45,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2020-10-09 13:01:45,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1416 transitions. [2020-10-09 13:01:45,744 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1416 transitions. Word has length 14 [2020-10-09 13:01:45,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:01:45,747 INFO L481 AbstractCegarLoop]: Abstraction has 494 states and 1416 transitions. [2020-10-09 13:01:45,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-09 13:01:45,747 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1416 transitions. [2020-10-09 13:01:45,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-09 13:01:45,749 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:01:45,749 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:01:45,749 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-09 13:01:45,749 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:01:45,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:01:45,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1267824559, now seen corresponding path program 3 times [2020-10-09 13:01:45,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:01:45,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370621312] [2020-10-09 13:01:45,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:01:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:01:45,867 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-09 13:01:45,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370621312] [2020-10-09 13:01:45,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:01:45,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-09 13:01:45,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000712677] [2020-10-09 13:01:45,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-09 13:01:45,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:01:45,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-09 13:01:45,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-09 13:01:45,869 INFO L87 Difference]: Start difference. First operand 494 states and 1416 transitions. Second operand 6 states. [2020-10-09 13:01:45,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:01:45,993 INFO L93 Difference]: Finished difference Result 546 states and 1535 transitions. [2020-10-09 13:01:45,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-09 13:01:45,994 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-09 13:01:45,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:01:45,998 INFO L225 Difference]: With dead ends: 546 [2020-10-09 13:01:45,998 INFO L226 Difference]: Without dead ends: 510 [2020-10-09 13:01:45,998 INFO L673 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-09 13:01:46,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2020-10-09 13:01:46,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 478. [2020-10-09 13:01:46,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2020-10-09 13:01:46,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1362 transitions. [2020-10-09 13:01:46,013 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1362 transitions. Word has length 14 [2020-10-09 13:01:46,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:01:46,013 INFO L481 AbstractCegarLoop]: Abstraction has 478 states and 1362 transitions. [2020-10-09 13:01:46,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-09 13:01:46,014 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1362 transitions. [2020-10-09 13:01:46,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-09 13:01:46,015 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:01:46,015 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:01:46,015 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-09 13:01:46,016 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:01:46,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:01:46,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1299998839, now seen corresponding path program 4 times [2020-10-09 13:01:46,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:01:46,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567569232] [2020-10-09 13:01:46,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:01:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:01:46,195 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-09 13:01:46,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567569232] [2020-10-09 13:01:46,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:01:46,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-09 13:01:46,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68628684] [2020-10-09 13:01:46,196 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-09 13:01:46,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:01:46,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-09 13:01:46,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-09 13:01:46,197 INFO L87 Difference]: Start difference. First operand 478 states and 1362 transitions. Second operand 7 states. [2020-10-09 13:01:46,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:01:46,329 INFO L93 Difference]: Finished difference Result 586 states and 1632 transitions. [2020-10-09 13:01:46,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-09 13:01:46,331 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-10-09 13:01:46,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:01:46,334 INFO L225 Difference]: With dead ends: 586 [2020-10-09 13:01:46,334 INFO L226 Difference]: Without dead ends: 490 [2020-10-09 13:01:46,335 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-09 13:01:46,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2020-10-09 13:01:46,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 454. [2020-10-09 13:01:46,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2020-10-09 13:01:46,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 1269 transitions. [2020-10-09 13:01:46,349 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 1269 transitions. Word has length 14 [2020-10-09 13:01:46,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:01:46,349 INFO L481 AbstractCegarLoop]: Abstraction has 454 states and 1269 transitions. [2020-10-09 13:01:46,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-09 13:01:46,350 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 1269 transitions. [2020-10-09 13:01:46,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-09 13:01:46,351 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:01:46,351 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:01:46,351 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-09 13:01:46,352 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:01:46,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:01:46,352 INFO L82 PathProgramCache]: Analyzing trace with hash -717635042, now seen corresponding path program 1 times [2020-10-09 13:01:46,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:01:46,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944615230] [2020-10-09 13:01:46,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:01:46,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:01:46,433 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-09 13:01:46,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944615230] [2020-10-09 13:01:46,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:01:46,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-09 13:01:46,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174588179] [2020-10-09 13:01:46,435 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 13:01:46,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:01:46,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 13:01:46,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-09 13:01:46,436 INFO L87 Difference]: Start difference. First operand 454 states and 1269 transitions. Second operand 4 states. [2020-10-09 13:01:46,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:01:46,465 INFO L93 Difference]: Finished difference Result 438 states and 1075 transitions. [2020-10-09 13:01:46,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-09 13:01:46,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-09 13:01:46,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:01:46,468 INFO L225 Difference]: With dead ends: 438 [2020-10-09 13:01:46,468 INFO L226 Difference]: Without dead ends: 326 [2020-10-09 13:01:46,469 INFO L673 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-09 13:01:46,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-10-09 13:01:46,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2020-10-09 13:01:46,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2020-10-09 13:01:46,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 781 transitions. [2020-10-09 13:01:46,478 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 781 transitions. Word has length 15 [2020-10-09 13:01:46,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:01:46,478 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 781 transitions. [2020-10-09 13:01:46,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 13:01:46,478 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 781 transitions. [2020-10-09 13:01:46,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-09 13:01:46,479 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:01:46,479 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:01:46,479 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-09 13:01:46,480 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:01:46,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:01:46,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1081399702, now seen corresponding path program 1 times [2020-10-09 13:01:46,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:01:46,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873191043] [2020-10-09 13:01:46,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:01:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:01:46,534 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-09 13:01:46,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873191043] [2020-10-09 13:01:46,534 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:01:46,535 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-09 13:01:46,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071303565] [2020-10-09 13:01:46,535 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-09 13:01:46,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:01:46,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-09 13:01:46,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-09 13:01:46,536 INFO L87 Difference]: Start difference. First operand 326 states and 781 transitions. Second operand 5 states. [2020-10-09 13:01:46,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:01:46,574 INFO L93 Difference]: Finished difference Result 255 states and 549 transitions. [2020-10-09 13:01:46,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-09 13:01:46,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-09 13:01:46,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:01:46,576 INFO L225 Difference]: With dead ends: 255 [2020-10-09 13:01:46,577 INFO L226 Difference]: Without dead ends: 196 [2020-10-09 13:01:46,577 INFO L673 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-09 13:01:46,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2020-10-09 13:01:46,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2020-10-09 13:01:46,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-10-09 13:01:46,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 409 transitions. [2020-10-09 13:01:46,582 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 409 transitions. Word has length 16 [2020-10-09 13:01:46,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:01:46,582 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 409 transitions. [2020-10-09 13:01:46,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-09 13:01:46,583 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 409 transitions. [2020-10-09 13:01:46,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-09 13:01:46,583 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:01:46,584 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:01:46,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-09 13:01:46,584 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:01:46,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:01:46,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1975064388, now seen corresponding path program 1 times [2020-10-09 13:01:46,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:01:46,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97439010] [2020-10-09 13:01:46,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:01:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:01:46,648 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-09 13:01:46,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97439010] [2020-10-09 13:01:46,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:01:46,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-09 13:01:46,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622208525] [2020-10-09 13:01:46,649 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-09 13:01:46,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:01:46,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-09 13:01:46,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-09 13:01:46,650 INFO L87 Difference]: Start difference. First operand 196 states and 409 transitions. Second operand 6 states. [2020-10-09 13:01:46,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:01:46,702 INFO L93 Difference]: Finished difference Result 277 states and 549 transitions. [2020-10-09 13:01:46,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-09 13:01:46,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-09 13:01:46,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:01:46,704 INFO L225 Difference]: With dead ends: 277 [2020-10-09 13:01:46,704 INFO L226 Difference]: Without dead ends: 182 [2020-10-09 13:01:46,705 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-09 13:01:46,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-10-09 13:01:46,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 168. [2020-10-09 13:01:46,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-10-09 13:01:46,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 320 transitions. [2020-10-09 13:01:46,709 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 320 transitions. Word has length 17 [2020-10-09 13:01:46,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:01:46,710 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 320 transitions. [2020-10-09 13:01:46,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-09 13:01:46,710 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 320 transitions. [2020-10-09 13:01:46,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-09 13:01:46,711 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:01:46,711 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:01:46,711 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-09 13:01:46,711 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:01:46,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:01:46,711 INFO L82 PathProgramCache]: Analyzing trace with hash 704500665, now seen corresponding path program 1 times [2020-10-09 13:01:46,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:01:46,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507572031] [2020-10-09 13:01:46,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:01:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:01:46,779 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-09 13:01:46,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507572031] [2020-10-09 13:01:46,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:01:46,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-09 13:01:46,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968404570] [2020-10-09 13:01:46,780 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-09 13:01:46,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:01:46,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-09 13:01:46,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-09 13:01:46,781 INFO L87 Difference]: Start difference. First operand 168 states and 320 transitions. Second operand 6 states. [2020-10-09 13:01:46,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:01:46,828 INFO L93 Difference]: Finished difference Result 142 states and 268 transitions. [2020-10-09 13:01:46,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-09 13:01:46,829 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-09 13:01:46,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:01:46,829 INFO L225 Difference]: With dead ends: 142 [2020-10-09 13:01:46,829 INFO L226 Difference]: Without dead ends: 52 [2020-10-09 13:01:46,830 INFO L673 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-09 13:01:46,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-10-09 13:01:46,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2020-10-09 13:01:46,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-09 13:01:46,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 81 transitions. [2020-10-09 13:01:46,832 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 81 transitions. Word has length 18 [2020-10-09 13:01:46,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:01:46,832 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 81 transitions. [2020-10-09 13:01:46,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-09 13:01:46,832 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 81 transitions. [2020-10-09 13:01:46,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-09 13:01:46,833 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:01:46,833 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:01:46,833 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-09 13:01:46,833 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:01:46,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:01:46,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1659320673, now seen corresponding path program 1 times [2020-10-09 13:01:46,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:01:46,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692532793] [2020-10-09 13:01:46,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:01:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:01:47,181 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-09 13:01:47,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692532793] [2020-10-09 13:01:47,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:01:47,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-09 13:01:47,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115384111] [2020-10-09 13:01:47,183 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-09 13:01:47,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:01:47,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-09 13:01:47,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-09 13:01:47,183 INFO L87 Difference]: Start difference. First operand 48 states and 81 transitions. Second operand 9 states. [2020-10-09 13:01:47,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:01:47,437 INFO L93 Difference]: Finished difference Result 75 states and 120 transitions. [2020-10-09 13:01:47,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-09 13:01:47,437 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-09 13:01:47,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:01:47,438 INFO L225 Difference]: With dead ends: 75 [2020-10-09 13:01:47,438 INFO L226 Difference]: Without dead ends: 48 [2020-10-09 13:01:47,438 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-10-09 13:01:47,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-10-09 13:01:47,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2020-10-09 13:01:47,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-10-09 13:01:47,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2020-10-09 13:01:47,440 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 21 [2020-10-09 13:01:47,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:01:47,440 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2020-10-09 13:01:47,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-09 13:01:47,441 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2020-10-09 13:01:47,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-09 13:01:47,441 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:01:47,441 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:01:47,442 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-09 13:01:47,442 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:01:47,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:01:47,442 INFO L82 PathProgramCache]: Analyzing trace with hash 923826655, now seen corresponding path program 2 times [2020-10-09 13:01:47,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:01:47,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337296983] [2020-10-09 13:01:47,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:01:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 13:01:47,477 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 13:01:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 13:01:47,511 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 13:01:47,543 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-09 13:01:47,544 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 13:01:47,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-09 13:01:47,561 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-09 13:01:47,561 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:01:47,563 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-09 13:01:47,563 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:01:47,563 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-09 13:01:47,563 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:01:47,563 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-09 13:01:47,564 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:01:47,564 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-09 13:01:47,564 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:01:47,564 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-09 13:01:47,564 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:01:47,565 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-09 13:01:47,565 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:01:47,565 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-09 13:01:47,566 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:01:47,566 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-09 13:01:47,566 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:01:47,566 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-09 13:01:47,566 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:01:47,566 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-09 13:01:47,567 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:01:47,567 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-09 13:01:47,567 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:01:47,568 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-09 13:01:47,568 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:01:47,568 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-09 13:01:47,568 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:01:47,568 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-09 13:01:47,568 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:01:47,568 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-09 13:01:47,569 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:01:47,569 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-09 13:01:47,569 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:01:47,569 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-09 13:01:47,570 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:01:47,570 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-09 13:01:47,570 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:01:47,570 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-09 13:01:47,570 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:01:47,570 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-09 13:01:47,571 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:01:47,571 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-09 13:01:47,571 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:01:47,571 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-09 13:01:47,571 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:01:47,571 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-09 13:01:47,572 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:01:47,572 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-09 13:01:47,572 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:01:47,572 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-09 13:01:47,572 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:01:47,572 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-09 13:01:47,572 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:01:47,573 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-09 13:01:47,573 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:01:47,573 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-09 13:01:47,573 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:01:47,573 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-09 13:01:47,573 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:01:47,574 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-09 13:01:47,574 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 13:01:47,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.10 01:01:47 BasicIcfg [2020-10-09 13:01:47,631 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-09 13:01:47,633 INFO L168 Benchmark]: Toolchain (without parser) took 13877.63 ms. Allocated memory was 247.5 MB in the beginning and 565.7 MB in the end (delta: 318.2 MB). Free memory was 202.6 MB in the beginning and 487.2 MB in the end (delta: -284.6 MB). Peak memory consumption was 33.7 MB. Max. memory is 14.2 GB. [2020-10-09 13:01:47,634 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 247.5 MB. Free memory is still 223.8 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 13:01:47,634 INFO L168 Benchmark]: CACSL2BoogieTranslator took 781.01 ms. Allocated memory was 247.5 MB in the beginning and 303.6 MB in the end (delta: 56.1 MB). Free memory was 202.6 MB in the beginning and 256.0 MB in the end (delta: -53.4 MB). Peak memory consumption was 36.0 MB. Max. memory is 14.2 GB. [2020-10-09 13:01:47,635 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.89 ms. Allocated memory is still 303.6 MB. Free memory was 256.0 MB in the beginning and 253.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-09 13:01:47,635 INFO L168 Benchmark]: Boogie Preprocessor took 37.08 ms. Allocated memory is still 303.6 MB. Free memory was 253.5 MB in the beginning and 250.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-09 13:01:47,636 INFO L168 Benchmark]: RCFGBuilder took 1912.29 ms. Allocated memory was 303.6 MB in the beginning and 353.4 MB in the end (delta: 49.8 MB). Free memory was 250.9 MB in the beginning and 209.3 MB in the end (delta: 41.6 MB). Peak memory consumption was 101.5 MB. Max. memory is 14.2 GB. [2020-10-09 13:01:47,637 INFO L168 Benchmark]: TraceAbstraction took 11053.95 ms. Allocated memory was 353.4 MB in the beginning and 565.7 MB in the end (delta: 212.3 MB). Free memory was 209.3 MB in the beginning and 487.2 MB in the end (delta: -277.8 MB). There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 13:01:47,642 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.22 ms. Allocated memory is still 247.5 MB. Free memory is still 223.8 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 781.01 ms. Allocated memory was 247.5 MB in the beginning and 303.6 MB in the end (delta: 56.1 MB). Free memory was 202.6 MB in the beginning and 256.0 MB in the end (delta: -53.4 MB). Peak memory consumption was 36.0 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 87.89 ms. Allocated memory is still 303.6 MB. Free memory was 256.0 MB in the beginning and 253.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 37.08 ms. Allocated memory is still 303.6 MB. Free memory was 253.5 MB in the beginning and 250.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1912.29 ms. Allocated memory was 303.6 MB in the beginning and 353.4 MB in the end (delta: 49.8 MB). Free memory was 250.9 MB in the beginning and 209.3 MB in the end (delta: 41.6 MB). Peak memory consumption was 101.5 MB. Max. memory is 14.2 GB. * TraceAbstraction took 11053.95 ms. Allocated memory was 353.4 MB in the beginning and 565.7 MB in the end (delta: 212.3 MB). Free memory was 209.3 MB in the beginning and 487.2 MB in the end (delta: -277.8 MB). There was no memory consumed. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 998 VarBasedMoverChecksPositive, 67 VarBasedMoverChecksNegative, 23 SemBasedMoverChecksPositive, 44 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 141 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.7s, 98 PlacesBefore, 36 PlacesAfterwards, 90 TransitionsBefore, 27 TransitionsAfterwards, 1536 CoEnabledTransitionPairs, 6 FixpointIterations, 30 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 75 TotalNumberOfCompositions, 4033 MoverChecksTotal - 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; [L699] 0 _Bool main$tmp_guard0; [L700] 0 _Bool main$tmp_guard1; [L702] 0 int x = 0; [L704] 0 int y = 0; [L705] 0 _Bool y$flush_delayed; [L706] 0 int y$mem_tmp; [L707] 0 _Bool y$r_buff0_thd0; [L708] 0 _Bool y$r_buff0_thd1; [L709] 0 _Bool y$r_buff0_thd2; [L710] 0 _Bool y$r_buff0_thd3; [L711] 0 _Bool y$r_buff1_thd0; [L712] 0 _Bool y$r_buff1_thd1; [L713] 0 _Bool y$r_buff1_thd2; [L714] 0 _Bool y$r_buff1_thd3; [L715] 0 _Bool y$read_delayed; [L716] 0 int *y$read_delayed_var; [L717] 0 int y$w_buff0; [L718] 0 _Bool y$w_buff0_used; [L719] 0 int y$w_buff1; [L720] 0 _Bool y$w_buff1_used; [L722] 0 int z = 0; [L723] 0 _Bool weak$$choice0; [L724] 0 _Bool weak$$choice2; [L800] 0 pthread_t t2504; [L801] FCALL, FORK 0 pthread_create(&t2504, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 0 pthread_t t2505; [L803] FCALL, FORK 0 pthread_create(&t2505, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 0 pthread_t t2506; [L805] FCALL, FORK 0 pthread_create(&t2506, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L763] 3 y$w_buff1 = y$w_buff0 [L764] 3 y$w_buff0 = 2 [L765] 3 y$w_buff1_used = y$w_buff0_used [L766] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L768] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L769] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L770] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L771] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L772] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L775] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L728] 1 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L731] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L743] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L746] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L778] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L778] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L779] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L780] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L780] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L781] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L781] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L782] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L782] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L785] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 3 return 0; [L736] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L738] 1 return 0; [L749] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L749] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L750] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L751] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L752] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L752] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L753] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L753] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L756] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 2 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L812] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L813] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L814] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L815] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L815] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 y$flush_delayed = weak$$choice2 [L821] 0 y$mem_tmp = y [L822] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L823] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L823] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L824] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L825] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L825] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L826] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L827] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L827] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L827] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L828] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L828] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L828] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L830] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L830] 0 y = y$flush_delayed ? y$mem_tmp : y [L831] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, 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=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 89 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.8s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 519 SDtfs, 538 SDslu, 1030 SDs, 0 SdLazy, 533 SolverSat, 126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=770occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 238 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 230 ConstructedInterpolants, 0 QuantifiedInterpolants, 26089 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...