/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix051_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 11:13:53,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 11:13:53,488 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 11:13:53,530 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 11:13:53,530 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 11:13:53,541 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 11:13:53,543 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 11:13:53,546 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 11:13:53,548 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 11:13:53,549 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 11:13:53,551 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 11:13:53,553 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 11:13:53,553 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 11:13:53,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 11:13:53,560 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 11:13:53,561 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 11:13:53,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 11:13:53,563 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 11:13:53,565 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 11:13:53,571 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 11:13:53,572 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 11:13:53,574 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 11:13:53,575 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 11:13:53,576 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 11:13:53,581 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 11:13:53,581 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 11:13:53,582 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 11:13:53,584 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 11:13:53,585 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 11:13:53,587 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 11:13:53,587 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 11:13:53,587 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 11:13:53,588 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 11:13:53,589 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 11:13:53,590 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 11:13:53,590 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 11:13:53,591 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 11:13:53,591 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 11:13:53,591 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 11:13:53,592 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 11:13:53,593 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 11:13:53,594 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-16 11:13:53,634 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 11:13:53,635 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 11:13:53,637 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 11:13:53,637 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 11:13:53,637 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 11:13:53,637 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 11:13:53,638 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 11:13:53,638 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 11:13:53,638 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 11:13:53,638 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 11:13:53,639 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 11:13:53,639 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 11:13:53,639 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 11:13:53,640 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 11:13:53,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 11:13:53,640 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 11:13:53,640 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 11:13:53,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 11:13:53,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 11:13:53,641 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 11:13:53,641 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 11:13:53,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 11:13:53,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 11:13:53,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 11:13:53,642 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 11:13:53,642 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 11:13:53,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 11:13:53,643 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 11:13:53,643 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-16 11:13:53,643 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 11:13:53,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 11:13:53,926 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 11:13:53,929 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 11:13:53,930 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 11:13:53,931 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 11:13:53,931 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_tso.oepc.i [2020-10-16 11:13:53,984 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6d6ab0053/7c3b171b56a64e8ba2c28f23db199bbe/FLAG51f58991e [2020-10-16 11:13:54,496 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 11:13:54,497 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix051_tso.oepc.i [2020-10-16 11:13:54,514 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6d6ab0053/7c3b171b56a64e8ba2c28f23db199bbe/FLAG51f58991e [2020-10-16 11:13:54,803 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6d6ab0053/7c3b171b56a64e8ba2c28f23db199bbe [2020-10-16 11:13:54,816 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 11:13:54,818 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 11:13:54,819 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 11:13:54,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 11:13:54,823 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 11:13:54,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:13:54" (1/1) ... [2020-10-16 11:13:54,826 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f963932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:13:54, skipping insertion in model container [2020-10-16 11:13:54,827 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:13:54" (1/1) ... [2020-10-16 11:13:54,834 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 11:13:54,905 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 11:13:55,399 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 11:13:55,411 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 11:13:55,485 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 11:13:55,566 INFO L208 MainTranslator]: Completed translation [2020-10-16 11:13:55,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:13:55 WrapperNode [2020-10-16 11:13:55,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 11:13:55,568 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 11:13:55,568 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 11:13:55,568 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 11:13:55,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:13:55" (1/1) ... [2020-10-16 11:13:55,598 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:13:55" (1/1) ... [2020-10-16 11:13:55,632 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 11:13:55,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 11:13:55,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 11:13:55,633 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 11:13:55,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:13:55" (1/1) ... [2020-10-16 11:13:55,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:13:55" (1/1) ... [2020-10-16 11:13:55,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:13:55" (1/1) ... [2020-10-16 11:13:55,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:13:55" (1/1) ... [2020-10-16 11:13:55,659 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:13:55" (1/1) ... [2020-10-16 11:13:55,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:13:55" (1/1) ... [2020-10-16 11:13:55,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:13:55" (1/1) ... [2020-10-16 11:13:55,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 11:13:55,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 11:13:55,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 11:13:55,673 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 11:13:55,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:13:55" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-16 11:13:55,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 11:13:55,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 11:13:55,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 11:13:55,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 11:13:55,775 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 11:13:55,775 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 11:13:55,776 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 11:13:55,777 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 11:13:55,777 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 11:13:55,778 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 11:13:55,778 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 11:13:55,778 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 11:13:55,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 11:13:55,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 11:13:55,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 11:13:55,781 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 11:13:57,970 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 11:13:57,971 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 11:13:57,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:13:57 BoogieIcfgContainer [2020-10-16 11:13:57,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 11:13:57,975 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 11:13:57,975 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 11:13:57,979 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 11:13:57,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:13:54" (1/3) ... [2020-10-16 11:13:57,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@733abaa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:13:57, skipping insertion in model container [2020-10-16 11:13:57,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:13:55" (2/3) ... [2020-10-16 11:13:57,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@733abaa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:13:57, skipping insertion in model container [2020-10-16 11:13:57,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:13:57" (3/3) ... [2020-10-16 11:13:57,983 INFO L111 eAbstractionObserver]: Analyzing ICFG mix051_tso.oepc.i [2020-10-16 11:13:57,995 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 11:13:57,995 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 11:13:58,004 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 11:13:58,005 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 11:13:58,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,038 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,039 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,042 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,042 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,042 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,042 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,043 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,043 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,045 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,045 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,045 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,045 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,046 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,046 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,046 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,046 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,047 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,047 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,047 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,047 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,047 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,048 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,048 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,048 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,048 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,049 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,049 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,049 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,050 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,050 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,050 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,050 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,050 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,051 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,051 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,051 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,051 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,052 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,057 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,058 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,061 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,061 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,061 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,061 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,061 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,064 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,065 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,065 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,072 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,073 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,073 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,073 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,073 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,074 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,074 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,074 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,074 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,074 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:58,076 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 11:13:58,090 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 11:13:58,113 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 11:13:58,113 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 11:13:58,113 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 11:13:58,113 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 11:13:58,114 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 11:13:58,114 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 11:13:58,114 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 11:13:58,114 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 11:13:58,128 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 11:13:58,131 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 111 transitions, 242 flow [2020-10-16 11:13:58,134 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 111 transitions, 242 flow [2020-10-16 11:13:58,136 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 242 flow [2020-10-16 11:13:58,188 INFO L129 PetriNetUnfolder]: 2/107 cut-off events. [2020-10-16 11:13:58,188 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 11:13:58,194 INFO L80 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-16 11:13:58,198 INFO L117 LiptonReduction]: Number of co-enabled transitions 2606 [2020-10-16 11:13:58,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:13:58,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:58,409 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:58,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:58,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:58,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:13:58,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:13:58,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:13:58,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:13:58,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:58,441 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:58,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:58,445 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:58,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:13:58,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:13:58,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:13:58,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:13:58,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:58,481 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:58,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:58,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:58,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:13:58,487 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:13:58,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:13:58,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:13:58,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:58,510 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:58,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:58,514 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:58,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:13:58,517 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:13:58,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:13:58,697 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-10-16 11:13:58,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:58,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-16 11:13:58,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:58,722 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 11:13:58,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:58,724 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 11:13:58,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:59,921 WARN L193 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2020-10-16 11:13:59,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-16 11:13:59,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:59,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 11:13:59,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:00,709 WARN L193 SmtUtils]: Spent 743.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 124 [2020-10-16 11:14:00,730 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:00,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:00,731 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:00,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:00,734 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:00,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:00,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:00,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:00,760 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:00,760 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:00,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:00,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:00,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:00,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:00,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:00,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:00,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 11:14:00,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:00,873 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:00,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:00,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:00,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:00,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:00,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:00,880 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:00,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:00,900 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:00,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:00,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:00,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:00,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:00,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:00,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:00,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:00,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:00,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:00,973 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:00,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:00,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:00,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:00,977 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:00,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:00,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:00,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:00,994 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:00,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:00,996 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:00,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:00,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:00,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:01,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:01,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:01,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:01,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:01,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:01,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:01,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:01,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:01,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:01,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:01,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:01,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:01,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:01,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:01,106 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:01,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:01,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:01,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:01,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:01,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:01,374 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:01,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:01,376 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:01,377 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:01,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:01,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:01,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:01,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:01,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:01,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:01,397 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:01,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:01,600 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 11:14:01,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:01,977 WARN L193 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 11:14:02,317 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:02,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:02,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:02,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:02,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:02,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:02,325 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:02,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:02,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:02,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:02,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:02,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:02,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:02,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:02,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:02,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:02,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:02,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:02,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:02,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:02,617 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:02,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:02,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:02,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:02,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:02,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:02,635 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:02,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:02,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:02,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:02,639 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:02,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:02,691 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 11:14:02,691 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:02,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:02,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:02,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:02,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:02,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:02,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:02,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:02,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:02,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:02,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:02,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:02,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:02,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:02,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:02,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:02,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:03,084 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-16 11:14:03,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:03,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:03,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:03,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:03,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:03,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:03,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:03,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:03,242 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:03,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:03,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:03,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:03,397 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:03,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:03,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:03,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:03,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:03,416 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:03,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:03,418 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:03,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:03,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:03,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:03,456 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:03,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:03,459 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:03,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:03,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:03,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:03,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:03,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:03,477 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:03,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:03,533 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:03,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:03,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:03,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:03,537 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:03,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:03,550 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:03,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:03,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:03,555 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:03,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:03,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:03,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:03,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:03,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:03,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:03,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:03,596 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:03,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:03,597 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:03,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:03,601 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:03,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:03,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:03,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:03,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:03,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,633 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:03,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:03,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:03,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:03,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:03,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:03,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:03,658 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:03,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:03,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:03,685 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:03,687 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:03,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:03,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:03,701 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:03,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:03,704 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,704 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:03,706 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:03,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:03,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:03,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:03,781 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:03,782 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:03,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:03,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:03,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:03,798 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:03,800 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:03,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:03,802 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:03,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:04,296 WARN L193 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2020-10-16 11:14:04,447 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-16 11:14:04,459 INFO L132 LiptonReduction]: Checked pairs total: 7317 [2020-10-16 11:14:04,459 INFO L134 LiptonReduction]: Total number of compositions: 87 [2020-10-16 11:14:04,467 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 35 transitions, 90 flow [2020-10-16 11:14:04,738 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4872 states. [2020-10-16 11:14:04,741 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states. [2020-10-16 11:14:04,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-16 11:14:04,747 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:14:04,748 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 11:14:04,749 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:14:04,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:14:04,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1143317077, now seen corresponding path program 1 times [2020-10-16 11:14:04,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:14:04,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226800385] [2020-10-16 11:14:04,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:14:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:14:04,979 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-16 11:14:04,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226800385] [2020-10-16 11:14:04,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:14:04,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 11:14:04,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452402449] [2020-10-16 11:14:04,986 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:14:04,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:14:05,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:14:05,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:14:05,009 INFO L87 Difference]: Start difference. First operand 4872 states. Second operand 3 states. [2020-10-16 11:14:05,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:14:05,172 INFO L93 Difference]: Finished difference Result 4062 states and 16125 transitions. [2020-10-16 11:14:05,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:14:05,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-16 11:14:05,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:14:05,227 INFO L225 Difference]: With dead ends: 4062 [2020-10-16 11:14:05,227 INFO L226 Difference]: Without dead ends: 3437 [2020-10-16 11:14:05,229 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:14:05,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3437 states. [2020-10-16 11:14:05,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3437 to 3437. [2020-10-16 11:14:05,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3437 states. [2020-10-16 11:14:05,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3437 states to 3437 states and 13500 transitions. [2020-10-16 11:14:05,475 INFO L78 Accepts]: Start accepts. Automaton has 3437 states and 13500 transitions. Word has length 5 [2020-10-16 11:14:05,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:14:05,476 INFO L481 AbstractCegarLoop]: Abstraction has 3437 states and 13500 transitions. [2020-10-16 11:14:05,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:14:05,476 INFO L276 IsEmpty]: Start isEmpty. Operand 3437 states and 13500 transitions. [2020-10-16 11:14:05,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 11:14:05,481 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:14:05,481 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:14:05,482 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 11:14:05,482 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:14:05,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:14:05,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1452501124, now seen corresponding path program 1 times [2020-10-16 11:14:05,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:14:05,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830957518] [2020-10-16 11:14:05,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:14:05,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:14:05,680 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-16 11:14:05,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830957518] [2020-10-16 11:14:05,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:14:05,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:14:05,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892857417] [2020-10-16 11:14:05,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:14:05,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:14:05,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:14:05,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:14:05,683 INFO L87 Difference]: Start difference. First operand 3437 states and 13500 transitions. Second operand 5 states. [2020-10-16 11:14:05,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:14:05,895 INFO L93 Difference]: Finished difference Result 4162 states and 15878 transitions. [2020-10-16 11:14:05,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:14:05,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-16 11:14:05,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:14:05,935 INFO L225 Difference]: With dead ends: 4162 [2020-10-16 11:14:05,935 INFO L226 Difference]: Without dead ends: 3473 [2020-10-16 11:14:05,937 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:14:05,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3473 states. [2020-10-16 11:14:06,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3473 to 3473. [2020-10-16 11:14:06,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3473 states. [2020-10-16 11:14:06,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3473 states to 3473 states and 13512 transitions. [2020-10-16 11:14:06,229 INFO L78 Accepts]: Start accepts. Automaton has 3473 states and 13512 transitions. Word has length 12 [2020-10-16 11:14:06,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:14:06,230 INFO L481 AbstractCegarLoop]: Abstraction has 3473 states and 13512 transitions. [2020-10-16 11:14:06,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:14:06,230 INFO L276 IsEmpty]: Start isEmpty. Operand 3473 states and 13512 transitions. [2020-10-16 11:14:06,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 11:14:06,235 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:14:06,235 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:14:06,235 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 11:14:06,235 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:14:06,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:14:06,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1865471498, now seen corresponding path program 1 times [2020-10-16 11:14:06,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:14:06,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704950933] [2020-10-16 11:14:06,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:14:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:14:06,390 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-16 11:14:06,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704950933] [2020-10-16 11:14:06,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:14:06,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:14:06,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628299739] [2020-10-16 11:14:06,391 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:14:06,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:14:06,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:14:06,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:14:06,394 INFO L87 Difference]: Start difference. First operand 3473 states and 13512 transitions. Second operand 6 states. [2020-10-16 11:14:06,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:14:06,642 INFO L93 Difference]: Finished difference Result 4352 states and 16675 transitions. [2020-10-16 11:14:06,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 11:14:06,643 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-16 11:14:06,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:14:06,682 INFO L225 Difference]: With dead ends: 4352 [2020-10-16 11:14:06,682 INFO L226 Difference]: Without dead ends: 3845 [2020-10-16 11:14:06,682 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:14:06,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3845 states. [2020-10-16 11:14:06,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3845 to 3845. [2020-10-16 11:14:06,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3845 states. [2020-10-16 11:14:06,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3845 states to 3845 states and 14882 transitions. [2020-10-16 11:14:06,882 INFO L78 Accepts]: Start accepts. Automaton has 3845 states and 14882 transitions. Word has length 14 [2020-10-16 11:14:06,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:14:06,882 INFO L481 AbstractCegarLoop]: Abstraction has 3845 states and 14882 transitions. [2020-10-16 11:14:06,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:14:06,883 INFO L276 IsEmpty]: Start isEmpty. Operand 3845 states and 14882 transitions. [2020-10-16 11:14:06,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 11:14:06,890 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:14:06,890 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:14:06,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 11:14:06,890 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:14:06,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:14:06,891 INFO L82 PathProgramCache]: Analyzing trace with hash -762155726, now seen corresponding path program 1 times [2020-10-16 11:14:06,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:14:06,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308755881] [2020-10-16 11:14:06,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:14:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:14:07,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:14:07,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308755881] [2020-10-16 11:14:07,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:14:07,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:14:07,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926392836] [2020-10-16 11:14:07,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:14:07,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:14:07,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:14:07,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:14:07,007 INFO L87 Difference]: Start difference. First operand 3845 states and 14882 transitions. Second operand 6 states. [2020-10-16 11:14:07,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:14:07,217 INFO L93 Difference]: Finished difference Result 4789 states and 18259 transitions. [2020-10-16 11:14:07,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 11:14:07,218 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-16 11:14:07,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:14:07,248 INFO L225 Difference]: With dead ends: 4789 [2020-10-16 11:14:07,248 INFO L226 Difference]: Without dead ends: 4407 [2020-10-16 11:14:07,249 INFO L677 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-16 11:14:07,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4407 states. [2020-10-16 11:14:07,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4407 to 3913. [2020-10-16 11:14:07,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3913 states. [2020-10-16 11:14:07,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3913 states to 3913 states and 15031 transitions. [2020-10-16 11:14:07,504 INFO L78 Accepts]: Start accepts. Automaton has 3913 states and 15031 transitions. Word has length 15 [2020-10-16 11:14:07,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:14:07,505 INFO L481 AbstractCegarLoop]: Abstraction has 3913 states and 15031 transitions. [2020-10-16 11:14:07,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:14:07,505 INFO L276 IsEmpty]: Start isEmpty. Operand 3913 states and 15031 transitions. [2020-10-16 11:14:07,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 11:14:07,509 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:14:07,509 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:14:07,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 11:14:07,510 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:14:07,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:14:07,510 INFO L82 PathProgramCache]: Analyzing trace with hash 343410239, now seen corresponding path program 1 times [2020-10-16 11:14:07,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:14:07,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804954388] [2020-10-16 11:14:07,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:14:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:14:07,580 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-16 11:14:07,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804954388] [2020-10-16 11:14:07,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:14:07,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:14:07,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629010617] [2020-10-16 11:14:07,581 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:14:07,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:14:07,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:14:07,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:14:07,582 INFO L87 Difference]: Start difference. First operand 3913 states and 15031 transitions. Second operand 4 states. [2020-10-16 11:14:07,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:14:07,633 INFO L93 Difference]: Finished difference Result 3816 states and 13326 transitions. [2020-10-16 11:14:07,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 11:14:07,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-16 11:14:07,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:14:07,647 INFO L225 Difference]: With dead ends: 3816 [2020-10-16 11:14:07,648 INFO L226 Difference]: Without dead ends: 2945 [2020-10-16 11:14:07,648 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:14:07,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2020-10-16 11:14:07,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 2945. [2020-10-16 11:14:07,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2945 states. [2020-10-16 11:14:07,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2945 states to 2945 states and 10191 transitions. [2020-10-16 11:14:07,743 INFO L78 Accepts]: Start accepts. Automaton has 2945 states and 10191 transitions. Word has length 15 [2020-10-16 11:14:07,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:14:07,744 INFO L481 AbstractCegarLoop]: Abstraction has 2945 states and 10191 transitions. [2020-10-16 11:14:07,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:14:07,744 INFO L276 IsEmpty]: Start isEmpty. Operand 2945 states and 10191 transitions. [2020-10-16 11:14:07,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 11:14:07,748 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:14:07,748 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:14:07,748 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 11:14:07,748 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:14:07,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:14:07,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1703666539, now seen corresponding path program 1 times [2020-10-16 11:14:07,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:14:07,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930628735] [2020-10-16 11:14:07,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:14:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:14:07,818 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-16 11:14:07,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930628735] [2020-10-16 11:14:07,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:14:07,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:14:07,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390373308] [2020-10-16 11:14:07,820 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:14:07,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:14:07,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:14:07,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:14:07,820 INFO L87 Difference]: Start difference. First operand 2945 states and 10191 transitions. Second operand 5 states. [2020-10-16 11:14:07,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:14:07,873 INFO L93 Difference]: Finished difference Result 2302 states and 7300 transitions. [2020-10-16 11:14:07,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:14:07,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-16 11:14:07,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:14:07,880 INFO L225 Difference]: With dead ends: 2302 [2020-10-16 11:14:07,880 INFO L226 Difference]: Without dead ends: 1777 [2020-10-16 11:14:07,880 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:14:07,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2020-10-16 11:14:07,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1579. [2020-10-16 11:14:07,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-10-16 11:14:07,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 4838 transitions. [2020-10-16 11:14:07,923 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 4838 transitions. Word has length 16 [2020-10-16 11:14:07,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:14:07,924 INFO L481 AbstractCegarLoop]: Abstraction has 1579 states and 4838 transitions. [2020-10-16 11:14:07,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:14:07,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 4838 transitions. [2020-10-16 11:14:07,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 11:14:07,928 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:14:07,928 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:14:07,928 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 11:14:07,928 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:14:07,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:14:07,929 INFO L82 PathProgramCache]: Analyzing trace with hash -630169148, now seen corresponding path program 1 times [2020-10-16 11:14:07,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:14:07,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092167386] [2020-10-16 11:14:07,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:14:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:14:08,087 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-16 11:14:08,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092167386] [2020-10-16 11:14:08,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:14:08,088 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 11:14:08,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338499451] [2020-10-16 11:14:08,089 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:14:08,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:14:08,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:14:08,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:14:08,090 INFO L87 Difference]: Start difference. First operand 1579 states and 4838 transitions. Second operand 6 states. [2020-10-16 11:14:08,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:14:08,175 INFO L93 Difference]: Finished difference Result 1302 states and 3966 transitions. [2020-10-16 11:14:08,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 11:14:08,175 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-16 11:14:08,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:14:08,179 INFO L225 Difference]: With dead ends: 1302 [2020-10-16 11:14:08,179 INFO L226 Difference]: Without dead ends: 1153 [2020-10-16 11:14:08,180 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-16 11:14:08,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2020-10-16 11:14:08,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1033. [2020-10-16 11:14:08,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1033 states. [2020-10-16 11:14:08,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 3200 transitions. [2020-10-16 11:14:08,207 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 3200 transitions. Word has length 20 [2020-10-16 11:14:08,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:14:08,207 INFO L481 AbstractCegarLoop]: Abstraction has 1033 states and 3200 transitions. [2020-10-16 11:14:08,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:14:08,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 3200 transitions. [2020-10-16 11:14:08,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-16 11:14:08,211 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:14:08,211 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:14:08,211 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 11:14:08,211 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:14:08,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:14:08,211 INFO L82 PathProgramCache]: Analyzing trace with hash 785701746, now seen corresponding path program 1 times [2020-10-16 11:14:08,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:14:08,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341236373] [2020-10-16 11:14:08,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:14:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:14:08,312 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-16 11:14:08,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341236373] [2020-10-16 11:14:08,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:14:08,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:14:08,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392305889] [2020-10-16 11:14:08,314 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:14:08,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:14:08,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:14:08,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:14:08,316 INFO L87 Difference]: Start difference. First operand 1033 states and 3200 transitions. Second operand 5 states. [2020-10-16 11:14:08,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:14:08,367 INFO L93 Difference]: Finished difference Result 1511 states and 4603 transitions. [2020-10-16 11:14:08,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:14:08,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-10-16 11:14:08,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:14:08,371 INFO L225 Difference]: With dead ends: 1511 [2020-10-16 11:14:08,371 INFO L226 Difference]: Without dead ends: 1009 [2020-10-16 11:14:08,372 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:14:08,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2020-10-16 11:14:08,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1003. [2020-10-16 11:14:08,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1003 states. [2020-10-16 11:14:08,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 2974 transitions. [2020-10-16 11:14:08,397 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 2974 transitions. Word has length 24 [2020-10-16 11:14:08,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:14:08,397 INFO L481 AbstractCegarLoop]: Abstraction has 1003 states and 2974 transitions. [2020-10-16 11:14:08,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:14:08,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 2974 transitions. [2020-10-16 11:14:08,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-16 11:14:08,400 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:14:08,400 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:14:08,400 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 11:14:08,401 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:14:08,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:14:08,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1238395953, now seen corresponding path program 1 times [2020-10-16 11:14:08,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:14:08,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681975540] [2020-10-16 11:14:08,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:14:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:14:08,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:14:08,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681975540] [2020-10-16 11:14:08,507 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:14:08,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:14:08,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992679519] [2020-10-16 11:14:08,509 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:14:08,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:14:08,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:14:08,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:14:08,510 INFO L87 Difference]: Start difference. First operand 1003 states and 2974 transitions. Second operand 5 states. [2020-10-16 11:14:08,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:14:08,551 INFO L93 Difference]: Finished difference Result 1350 states and 3903 transitions. [2020-10-16 11:14:08,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:14:08,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-10-16 11:14:08,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:14:08,556 INFO L225 Difference]: With dead ends: 1350 [2020-10-16 11:14:08,556 INFO L226 Difference]: Without dead ends: 881 [2020-10-16 11:14:08,557 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:14:08,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2020-10-16 11:14:08,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 875. [2020-10-16 11:14:08,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2020-10-16 11:14:08,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 2456 transitions. [2020-10-16 11:14:08,577 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 2456 transitions. Word has length 24 [2020-10-16 11:14:08,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:14:08,578 INFO L481 AbstractCegarLoop]: Abstraction has 875 states and 2456 transitions. [2020-10-16 11:14:08,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:14:08,578 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 2456 transitions. [2020-10-16 11:14:08,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-16 11:14:08,580 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:14:08,580 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:14:08,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 11:14:08,581 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:14:08,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:14:08,581 INFO L82 PathProgramCache]: Analyzing trace with hash -341667952, now seen corresponding path program 2 times [2020-10-16 11:14:08,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:14:08,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987303231] [2020-10-16 11:14:08,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:14:08,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:14:08,733 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-16 11:14:08,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987303231] [2020-10-16 11:14:08,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:14:08,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 11:14:08,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871254530] [2020-10-16 11:14:08,735 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 11:14:08,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:14:08,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 11:14:08,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:14:08,736 INFO L87 Difference]: Start difference. First operand 875 states and 2456 transitions. Second operand 7 states. [2020-10-16 11:14:08,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:14:08,820 INFO L93 Difference]: Finished difference Result 830 states and 2366 transitions. [2020-10-16 11:14:08,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:14:08,821 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-16 11:14:08,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:14:08,823 INFO L225 Difference]: With dead ends: 830 [2020-10-16 11:14:08,823 INFO L226 Difference]: Without dead ends: 349 [2020-10-16 11:14:08,824 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-10-16 11:14:08,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2020-10-16 11:14:08,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 341. [2020-10-16 11:14:08,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-10-16 11:14:08,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 924 transitions. [2020-10-16 11:14:08,834 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 924 transitions. Word has length 24 [2020-10-16 11:14:08,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:14:08,834 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 924 transitions. [2020-10-16 11:14:08,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 11:14:08,834 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 924 transitions. [2020-10-16 11:14:08,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-16 11:14:08,836 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:14:08,836 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:14:08,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 11:14:08,836 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:14:08,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:14:08,837 INFO L82 PathProgramCache]: Analyzing trace with hash -807558987, now seen corresponding path program 1 times [2020-10-16 11:14:08,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:14:08,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654179637] [2020-10-16 11:14:08,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:14:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:14:09,100 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-16 11:14:09,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654179637] [2020-10-16 11:14:09,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:14:09,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 11:14:09,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261897563] [2020-10-16 11:14:09,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 11:14:09,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:14:09,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 11:14:09,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-10-16 11:14:09,103 INFO L87 Difference]: Start difference. First operand 341 states and 924 transitions. Second operand 11 states. [2020-10-16 11:14:09,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:14:09,413 INFO L93 Difference]: Finished difference Result 617 states and 1616 transitions. [2020-10-16 11:14:09,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-16 11:14:09,413 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-10-16 11:14:09,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:14:09,415 INFO L225 Difference]: With dead ends: 617 [2020-10-16 11:14:09,415 INFO L226 Difference]: Without dead ends: 440 [2020-10-16 11:14:09,415 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2020-10-16 11:14:09,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-10-16 11:14:09,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 371. [2020-10-16 11:14:09,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-10-16 11:14:09,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 953 transitions. [2020-10-16 11:14:09,424 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 953 transitions. Word has length 28 [2020-10-16 11:14:09,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:14:09,425 INFO L481 AbstractCegarLoop]: Abstraction has 371 states and 953 transitions. [2020-10-16 11:14:09,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 11:14:09,425 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 953 transitions. [2020-10-16 11:14:09,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-16 11:14:09,428 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:14:09,428 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:14:09,428 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 11:14:09,428 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:14:09,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:14:09,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1126677295, now seen corresponding path program 2 times [2020-10-16 11:14:09,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:14:09,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167536811] [2020-10-16 11:14:09,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:14:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:14:09,604 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-16 11:14:09,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167536811] [2020-10-16 11:14:09,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:14:09,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 11:14:09,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384258010] [2020-10-16 11:14:09,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 11:14:09,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:14:09,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 11:14:09,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-10-16 11:14:09,606 INFO L87 Difference]: Start difference. First operand 371 states and 953 transitions. Second operand 11 states. [2020-10-16 11:14:09,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:14:09,786 INFO L93 Difference]: Finished difference Result 458 states and 1139 transitions. [2020-10-16 11:14:09,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 11:14:09,787 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-10-16 11:14:09,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:14:09,788 INFO L225 Difference]: With dead ends: 458 [2020-10-16 11:14:09,788 INFO L226 Difference]: Without dead ends: 324 [2020-10-16 11:14:09,788 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-10-16 11:14:09,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-10-16 11:14:09,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 245. [2020-10-16 11:14:09,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2020-10-16 11:14:09,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 620 transitions. [2020-10-16 11:14:09,795 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 620 transitions. Word has length 28 [2020-10-16 11:14:09,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:14:09,795 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 620 transitions. [2020-10-16 11:14:09,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 11:14:09,795 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 620 transitions. [2020-10-16 11:14:09,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-16 11:14:09,796 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:14:09,796 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:14:09,796 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 11:14:09,797 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:14:09,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:14:09,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1883356825, now seen corresponding path program 3 times [2020-10-16 11:14:09,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:14:09,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506377699] [2020-10-16 11:14:09,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:14:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:14:09,918 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-16 11:14:09,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506377699] [2020-10-16 11:14:09,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:14:09,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 11:14:09,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942588837] [2020-10-16 11:14:09,919 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 11:14:09,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:14:09,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 11:14:09,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:14:09,920 INFO L87 Difference]: Start difference. First operand 245 states and 620 transitions. Second operand 7 states. [2020-10-16 11:14:10,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:14:10,011 INFO L93 Difference]: Finished difference Result 338 states and 854 transitions. [2020-10-16 11:14:10,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:14:10,012 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-10-16 11:14:10,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:14:10,013 INFO L225 Difference]: With dead ends: 338 [2020-10-16 11:14:10,013 INFO L226 Difference]: Without dead ends: 295 [2020-10-16 11:14:10,014 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:14:10,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-10-16 11:14:10,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 229. [2020-10-16 11:14:10,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2020-10-16 11:14:10,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 556 transitions. [2020-10-16 11:14:10,023 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 556 transitions. Word has length 28 [2020-10-16 11:14:10,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:14:10,023 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 556 transitions. [2020-10-16 11:14:10,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 11:14:10,024 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 556 transitions. [2020-10-16 11:14:10,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-16 11:14:10,033 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:14:10,034 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:14:10,034 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 11:14:10,034 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:14:10,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:14:10,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1689049401, now seen corresponding path program 4 times [2020-10-16 11:14:10,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:14:10,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970989390] [2020-10-16 11:14:10,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:14:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:14:10,502 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-16 11:14:10,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970989390] [2020-10-16 11:14:10,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:14:10,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 11:14:10,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988169021] [2020-10-16 11:14:10,505 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 11:14:10,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:14:10,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 11:14:10,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-16 11:14:10,505 INFO L87 Difference]: Start difference. First operand 229 states and 556 transitions. Second operand 10 states. [2020-10-16 11:14:10,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:14:10,890 INFO L93 Difference]: Finished difference Result 346 states and 832 transitions. [2020-10-16 11:14:10,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 11:14:10,891 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2020-10-16 11:14:10,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:14:10,892 INFO L225 Difference]: With dead ends: 346 [2020-10-16 11:14:10,892 INFO L226 Difference]: Without dead ends: 185 [2020-10-16 11:14:10,893 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2020-10-16 11:14:10,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-10-16 11:14:10,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 145. [2020-10-16 11:14:10,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-10-16 11:14:10,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 336 transitions. [2020-10-16 11:14:10,897 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 336 transitions. Word has length 28 [2020-10-16 11:14:10,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:14:10,898 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 336 transitions. [2020-10-16 11:14:10,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 11:14:10,898 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 336 transitions. [2020-10-16 11:14:10,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-16 11:14:10,899 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:14:10,899 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:14:10,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 11:14:10,899 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:14:10,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:14:10,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1155742525, now seen corresponding path program 5 times [2020-10-16 11:14:10,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:14:10,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412733682] [2020-10-16 11:14:10,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:14:10,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:14:11,466 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-16 11:14:11,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412733682] [2020-10-16 11:14:11,467 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:14:11,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 11:14:11,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20395003] [2020-10-16 11:14:11,468 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 11:14:11,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:14:11,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 11:14:11,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:14:11,469 INFO L87 Difference]: Start difference. First operand 145 states and 336 transitions. Second operand 8 states. [2020-10-16 11:14:11,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:14:11,613 INFO L93 Difference]: Finished difference Result 202 states and 474 transitions. [2020-10-16 11:14:11,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 11:14:11,614 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-10-16 11:14:11,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:14:11,615 INFO L225 Difference]: With dead ends: 202 [2020-10-16 11:14:11,615 INFO L226 Difference]: Without dead ends: 155 [2020-10-16 11:14:11,616 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-16 11:14:11,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-10-16 11:14:11,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 137. [2020-10-16 11:14:11,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-10-16 11:14:11,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 316 transitions. [2020-10-16 11:14:11,620 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 316 transitions. Word has length 28 [2020-10-16 11:14:11,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:14:11,621 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 316 transitions. [2020-10-16 11:14:11,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 11:14:11,621 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 316 transitions. [2020-10-16 11:14:11,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-16 11:14:11,622 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:14:11,622 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:14:11,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 11:14:11,622 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:14:11,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:14:11,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1465319953, now seen corresponding path program 6 times [2020-10-16 11:14:11,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:14:11,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102293439] [2020-10-16 11:14:11,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:14:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 11:14:11,678 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 11:14:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 11:14:11,728 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 11:14:11,772 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 11:14:11,772 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 11:14:11,772 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 11:14:11,804 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-16 11:14:11,804 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,806 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-16 11:14:11,806 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,807 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-16 11:14:11,807 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,807 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-16 11:14:11,807 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,807 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-16 11:14:11,807 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,807 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-16 11:14:11,808 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,808 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-16 11:14:11,808 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,808 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-16 11:14:11,808 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,809 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-16 11:14:11,809 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,809 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-16 11:14:11,809 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,809 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-16 11:14:11,809 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,810 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-16 11:14:11,810 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,810 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-16 11:14:11,811 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,811 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-16 11:14:11,811 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,811 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-16 11:14:11,811 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,811 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-16 11:14:11,811 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,812 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-16 11:14:11,812 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,812 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-16 11:14:11,812 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,813 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-16 11:14:11,813 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,813 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-16 11:14:11,813 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,813 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-16 11:14:11,813 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,814 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-16 11:14:11,814 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,815 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-16 11:14:11,815 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,815 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-16 11:14:11,815 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,815 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-16 11:14:11,815 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,816 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-16 11:14:11,816 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,816 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-16 11:14:11,816 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,816 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-16 11:14:11,816 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,817 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-16 11:14:11,817 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,817 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-16 11:14:11,817 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,817 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-16 11:14:11,817 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,818 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-16 11:14:11,818 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,818 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-16 11:14:11,818 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,818 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-16 11:14:11,818 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,818 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-16 11:14:11,819 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,819 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-16 11:14:11,819 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,819 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-16 11:14:11,819 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,819 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-16 11:14:11,819 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,820 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-16 11:14:11,820 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,820 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-16 11:14:11,820 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,820 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-16 11:14:11,820 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:14:11,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 11:14:11 BasicIcfg [2020-10-16 11:14:11,891 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 11:14:11,892 INFO L168 Benchmark]: Toolchain (without parser) took 17075.22 ms. Allocated memory was 140.5 MB in the beginning and 598.7 MB in the end (delta: 458.2 MB). Free memory was 101.8 MB in the beginning and 450.7 MB in the end (delta: -349.0 MB). Peak memory consumption was 109.3 MB. Max. memory is 7.1 GB. [2020-10-16 11:14:11,893 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 11:14:11,894 INFO L168 Benchmark]: CACSL2BoogieTranslator took 748.41 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 101.6 MB in the beginning and 155.5 MB in the end (delta: -53.9 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2020-10-16 11:14:11,894 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.59 ms. Allocated memory is still 203.4 MB. Free memory was 155.5 MB in the beginning and 152.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2020-10-16 11:14:11,895 INFO L168 Benchmark]: Boogie Preprocessor took 40.11 ms. Allocated memory is still 203.4 MB. Free memory was 152.3 MB in the beginning and 149.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-16 11:14:11,896 INFO L168 Benchmark]: RCFGBuilder took 2300.53 ms. Allocated memory was 203.4 MB in the beginning and 246.9 MB in the end (delta: 43.5 MB). Free memory was 149.7 MB in the beginning and 135.7 MB in the end (delta: 14.0 MB). Peak memory consumption was 100.2 MB. Max. memory is 7.1 GB. [2020-10-16 11:14:11,896 INFO L168 Benchmark]: TraceAbstraction took 13915.81 ms. Allocated memory was 246.9 MB in the beginning and 598.7 MB in the end (delta: 351.8 MB). Free memory was 135.7 MB in the beginning and 450.7 MB in the end (delta: -315.1 MB). Peak memory consumption was 36.7 MB. Max. memory is 7.1 GB. [2020-10-16 11:14:11,899 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.21 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 748.41 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 101.6 MB in the beginning and 155.5 MB in the end (delta: -53.9 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.59 ms. Allocated memory is still 203.4 MB. Free memory was 155.5 MB in the beginning and 152.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.11 ms. Allocated memory is still 203.4 MB. Free memory was 152.3 MB in the beginning and 149.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2300.53 ms. Allocated memory was 203.4 MB in the beginning and 246.9 MB in the end (delta: 43.5 MB). Free memory was 149.7 MB in the beginning and 135.7 MB in the end (delta: 14.0 MB). Peak memory consumption was 100.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13915.81 ms. Allocated memory was 246.9 MB in the beginning and 598.7 MB in the end (delta: 351.8 MB). Free memory was 135.7 MB in the beginning and 450.7 MB in the end (delta: -315.1 MB). Peak memory consumption was 36.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1733 VarBasedMoverChecksPositive, 98 VarBasedMoverChecksNegative, 32 SemBasedMoverChecksPositive, 66 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 251 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.3s, 122 PlacesBefore, 47 PlacesAfterwards, 111 TransitionsBefore, 35 TransitionsAfterwards, 2606 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 87 TotalNumberOfCompositions, 7317 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p1_EAX = 0; [L703] 0 int __unbuffered_p2_EAX = 0; [L705] 0 int __unbuffered_p3_EAX = 0; [L707] 0 int a = 0; [L708] 0 _Bool main$tmp_guard0; [L709] 0 _Bool main$tmp_guard1; [L711] 0 int x = 0; [L712] 0 _Bool x$flush_delayed; [L713] 0 int x$mem_tmp; [L714] 0 _Bool x$r_buff0_thd0; [L715] 0 _Bool x$r_buff0_thd1; [L716] 0 _Bool x$r_buff0_thd2; [L717] 0 _Bool x$r_buff0_thd3; [L718] 0 _Bool x$r_buff0_thd4; [L719] 0 _Bool x$r_buff1_thd0; [L720] 0 _Bool x$r_buff1_thd1; [L721] 0 _Bool x$r_buff1_thd2; [L722] 0 _Bool x$r_buff1_thd3; [L723] 0 _Bool x$r_buff1_thd4; [L724] 0 _Bool x$read_delayed; [L725] 0 int *x$read_delayed_var; [L726] 0 int x$w_buff0; [L727] 0 _Bool x$w_buff0_used; [L728] 0 int x$w_buff1; [L729] 0 _Bool x$w_buff1_used; [L731] 0 int y = 0; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L837] 0 pthread_t t1377; [L838] FCALL, FORK 0 pthread_create(&t1377, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L839] 0 pthread_t t1378; [L840] FCALL, FORK 0 pthread_create(&t1378, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L841] 0 pthread_t t1379; [L842] FCALL, FORK 0 pthread_create(&t1379, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L843] 0 pthread_t t1380; [L844] FCALL, FORK 0 pthread_create(&t1380, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L759] 2 x$w_buff1 = x$w_buff0 [L760] 2 x$w_buff0 = 2 [L761] 2 x$w_buff1_used = x$w_buff0_used [L762] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L764] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L765] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L766] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L767] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L768] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L769] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L789] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L792] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L809] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0: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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L812] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0: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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L739] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L815] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L815] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L816] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L816] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L817] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L817] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L818] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L818] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L819] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L819] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L795] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L795] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L799] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L802] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 3 return 0; [L742] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L745] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L747] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L749] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L822] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 4 return 0; [L782] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 2 return 0; [L752] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L754] 1 return 0; [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L3] COND FALSE 0 !(!cond) [L850] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L850] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L850] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L850] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L851] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L851] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L852] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L852] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L853] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L853] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L854] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L854] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L857] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L858] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L859] 0 x$flush_delayed = weak$$choice2 [L860] 0 x$mem_tmp = x [L861] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L861] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L861] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L862] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L862] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L863] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L863] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L863] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L863] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L864] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L864] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L865] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L865] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L866] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L866] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L866] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L866] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L866] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L867] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L868] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L869] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L869] 0 x = x$flush_delayed ? x$mem_tmp : x [L870] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 110 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.6s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.6s, HoareTripleCheckerStatistics: 604 SDtfs, 1002 SDslu, 1937 SDs, 0 SdLazy, 913 SolverSat, 236 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4872occurred 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: 1.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 1104 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 337 NumberOfCodeBlocks, 337 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 294 ConstructedInterpolants, 0 QuantifiedInterpolants, 60305 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...