/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/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 13:22:07,376 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 13:22:07,380 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 13:22:07,420 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 13:22:07,421 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 13:22:07,429 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 13:22:07,431 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 13:22:07,435 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 13:22:07,438 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 13:22:07,441 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 13:22:07,442 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 13:22:07,443 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 13:22:07,443 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 13:22:07,446 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 13:22:07,448 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 13:22:07,450 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 13:22:07,451 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 13:22:07,452 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 13:22:07,454 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 13:22:07,462 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 13:22:07,464 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 13:22:07,465 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 13:22:07,466 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 13:22:07,467 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 13:22:07,481 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 13:22:07,484 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 13:22:07,484 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 13:22:07,485 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 13:22:07,486 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 13:22:07,489 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 13:22:07,489 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 13:22:07,490 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 13:22:07,493 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 13:22:07,494 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 13:22:07,495 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 13:22:07,495 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 13:22:07,496 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 13:22:07,496 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 13:22:07,496 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 13:22:07,501 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 13:22:07,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 13:22:07,502 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-16 13:22:07,542 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 13:22:07,542 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 13:22:07,544 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 13:22:07,544 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 13:22:07,545 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 13:22:07,545 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 13:22:07,545 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 13:22:07,545 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 13:22:07,546 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 13:22:07,546 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 13:22:07,547 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 13:22:07,547 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 13:22:07,547 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 13:22:07,548 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 13:22:07,549 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 13:22:07,549 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 13:22:07,549 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 13:22:07,550 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 13:22:07,550 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 13:22:07,550 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 13:22:07,551 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 13:22:07,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 13:22:07,551 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 13:22:07,551 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 13:22:07,551 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 13:22:07,552 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 13:22:07,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 13:22:07,552 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-16 13:22:07,552 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 13:22:07,552 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 13:22:07,553 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-16 13:22:07,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 13:22:07,944 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 13:22:07,948 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 13:22:07,949 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 13:22:07,950 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 13:22:07,951 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.opt.i [2020-10-16 13:22:08,017 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2c157a2bc/b281da7c89204b1b80f39a2f9966425d/FLAG0a09a8d86 [2020-10-16 13:22:08,521 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 13:22:08,522 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix055_tso.opt.i [2020-10-16 13:22:08,537 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2c157a2bc/b281da7c89204b1b80f39a2f9966425d/FLAG0a09a8d86 [2020-10-16 13:22:08,809 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2c157a2bc/b281da7c89204b1b80f39a2f9966425d [2020-10-16 13:22:08,818 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 13:22:08,819 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 13:22:08,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 13:22:08,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 13:22:08,827 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 13:22:08,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:22:08" (1/1) ... [2020-10-16 13:22:08,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39842735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:08, skipping insertion in model container [2020-10-16 13:22:08,833 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:22:08" (1/1) ... [2020-10-16 13:22:08,841 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 13:22:08,908 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 13:22:09,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 13:22:09,487 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 13:22:09,569 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 13:22:09,678 INFO L208 MainTranslator]: Completed translation [2020-10-16 13:22:09,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:09 WrapperNode [2020-10-16 13:22:09,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 13:22:09,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 13:22:09,681 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 13:22:09,682 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 13:22:09,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:09" (1/1) ... [2020-10-16 13:22:09,713 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:09" (1/1) ... [2020-10-16 13:22:09,753 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 13:22:09,753 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 13:22:09,753 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 13:22:09,754 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 13:22:09,763 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:09" (1/1) ... [2020-10-16 13:22:09,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:09" (1/1) ... [2020-10-16 13:22:09,769 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:09" (1/1) ... [2020-10-16 13:22:09,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:09" (1/1) ... [2020-10-16 13:22:09,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:09" (1/1) ... [2020-10-16 13:22:09,785 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:09" (1/1) ... [2020-10-16 13:22:09,789 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:09" (1/1) ... [2020-10-16 13:22:09,795 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 13:22:09,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 13:22:09,796 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 13:22:09,796 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 13:22:09,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:09" (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 13:22:09,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 13:22:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 13:22:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 13:22:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 13:22:09,869 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 13:22:09,869 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 13:22:09,869 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 13:22:09,869 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 13:22:09,869 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 13:22:09,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 13:22:09,870 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 13:22:09,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 13:22:09,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 13:22:09,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 13:22:09,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 13:22:09,873 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 13:22:11,802 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 13:22:11,802 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 13:22:11,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:22:11 BoogieIcfgContainer [2020-10-16 13:22:11,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 13:22:11,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 13:22:11,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 13:22:11,811 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 13:22:11,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:22:08" (1/3) ... [2020-10-16 13:22:11,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@561ab930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:22:11, skipping insertion in model container [2020-10-16 13:22:11,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:09" (2/3) ... [2020-10-16 13:22:11,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@561ab930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:22:11, skipping insertion in model container [2020-10-16 13:22:11,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:22:11" (3/3) ... [2020-10-16 13:22:11,815 INFO L111 eAbstractionObserver]: Analyzing ICFG mix055_tso.opt.i [2020-10-16 13:22:11,829 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 13:22:11,830 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 13:22:11,839 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 13:22:11,840 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 13:22:11,874 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,875 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,875 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,876 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,877 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,877 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,877 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,877 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,878 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,878 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,879 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,879 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,881 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,881 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,882 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,882 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,882 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,882 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,883 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,883 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,883 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,884 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,884 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,884 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,884 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,884 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,885 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,885 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,885 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,886 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,886 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,891 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,891 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,891 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,891 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,892 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,898 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,898 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,898 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,899 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,899 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,899 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,899 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,899 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,900 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,900 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,900 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,900 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,902 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,903 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,905 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,905 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,905 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,905 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:11,907 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 13:22:11,923 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 13:22:11,946 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 13:22:11,946 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 13:22:11,946 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 13:22:11,946 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-16 13:22:11,947 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 13:22:11,947 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 13:22:11,947 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 13:22:11,947 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 13:22:11,963 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 13:22:11,964 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 108 transitions, 236 flow [2020-10-16 13:22:11,968 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 108 transitions, 236 flow [2020-10-16 13:22:11,970 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 119 places, 108 transitions, 236 flow [2020-10-16 13:22:12,027 INFO L129 PetriNetUnfolder]: 2/104 cut-off events. [2020-10-16 13:22:12,028 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 13:22:12,034 INFO L80 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2020-10-16 13:22:12,038 INFO L117 LiptonReduction]: Number of co-enabled transitions 2352 [2020-10-16 13:22:13,568 WARN L193 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-16 13:22:13,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-16 13:22:13,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 13:22:13,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 13:22:13,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 13:22:14,489 WARN L193 SmtUtils]: Spent 831.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-10-16 13:22:15,060 WARN L193 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 13:22:15,931 WARN L193 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-10-16 13:22:16,304 WARN L193 SmtUtils]: Spent 370.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-10-16 13:22:16,709 WARN L193 SmtUtils]: Spent 400.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-16 13:22:17,109 WARN L193 SmtUtils]: Spent 397.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-16 13:22:18,041 WARN L193 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2020-10-16 13:22:18,337 WARN L193 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-16 13:22:19,662 WARN L193 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 144 DAG size of output: 134 [2020-10-16 13:22:20,223 WARN L193 SmtUtils]: Spent 559.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2020-10-16 13:22:20,503 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2020-10-16 13:22:20,638 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-16 13:22:20,651 INFO L132 LiptonReduction]: Checked pairs total: 6503 [2020-10-16 13:22:20,651 INFO L134 LiptonReduction]: Total number of compositions: 89 [2020-10-16 13:22:20,661 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 31 transitions, 82 flow [2020-10-16 13:22:20,858 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2602 states. [2020-10-16 13:22:20,860 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states. [2020-10-16 13:22:20,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 13:22:20,870 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:20,871 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:20,871 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:20,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:20,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1341205228, now seen corresponding path program 1 times [2020-10-16 13:22:20,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:20,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64652721] [2020-10-16 13:22:20,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:21,184 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 13:22:21,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64652721] [2020-10-16 13:22:21,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:21,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:22:21,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [217812860] [2020-10-16 13:22:21,190 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:21,194 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:21,218 INFO L258 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-16 13:22:21,219 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:21,223 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:21,224 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:22:21,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:21,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:22:21,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:22:21,244 INFO L87 Difference]: Start difference. First operand 2602 states. Second operand 3 states. [2020-10-16 13:22:21,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:21,437 INFO L93 Difference]: Finished difference Result 2202 states and 8424 transitions. [2020-10-16 13:22:21,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:22:21,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-16 13:22:21,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:21,492 INFO L225 Difference]: With dead ends: 2202 [2020-10-16 13:22:21,493 INFO L226 Difference]: Without dead ends: 1802 [2020-10-16 13:22:21,495 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 13:22:21,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2020-10-16 13:22:21,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2020-10-16 13:22:21,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2020-10-16 13:22:21,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 6784 transitions. [2020-10-16 13:22:21,723 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 6784 transitions. Word has length 9 [2020-10-16 13:22:21,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:21,724 INFO L481 AbstractCegarLoop]: Abstraction has 1802 states and 6784 transitions. [2020-10-16 13:22:21,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:22:21,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 6784 transitions. [2020-10-16 13:22:21,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 13:22:21,731 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:21,731 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:21,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 13:22:21,732 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:21,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:21,733 INFO L82 PathProgramCache]: Analyzing trace with hash 408129342, now seen corresponding path program 1 times [2020-10-16 13:22:21,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:21,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847701788] [2020-10-16 13:22:21,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:21,901 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 13:22:21,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847701788] [2020-10-16 13:22:21,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:21,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:22:21,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [332203934] [2020-10-16 13:22:21,904 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:21,905 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:21,908 INFO L258 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-10-16 13:22:21,909 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:21,909 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:21,911 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:22:21,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:21,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:22:21,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:22:21,912 INFO L87 Difference]: Start difference. First operand 1802 states and 6784 transitions. Second operand 3 states. [2020-10-16 13:22:21,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:21,982 INFO L93 Difference]: Finished difference Result 1792 states and 6736 transitions. [2020-10-16 13:22:21,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:22:21,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-16 13:22:21,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:22,004 INFO L225 Difference]: With dead ends: 1792 [2020-10-16 13:22:22,005 INFO L226 Difference]: Without dead ends: 1792 [2020-10-16 13:22:22,006 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 13:22:22,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2020-10-16 13:22:22,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1792. [2020-10-16 13:22:22,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1792 states. [2020-10-16 13:22:22,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 6736 transitions. [2020-10-16 13:22:22,090 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 6736 transitions. Word has length 11 [2020-10-16 13:22:22,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:22,090 INFO L481 AbstractCegarLoop]: Abstraction has 1792 states and 6736 transitions. [2020-10-16 13:22:22,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:22:22,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 6736 transitions. [2020-10-16 13:22:22,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 13:22:22,095 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:22,095 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:22,095 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 13:22:22,096 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:22,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:22,096 INFO L82 PathProgramCache]: Analyzing trace with hash -671107810, now seen corresponding path program 1 times [2020-10-16 13:22:22,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:22,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198210721] [2020-10-16 13:22:22,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:22,220 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 13:22:22,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198210721] [2020-10-16 13:22:22,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:22,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 13:22:22,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1416651485] [2020-10-16 13:22:22,223 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:22,224 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:22,228 INFO L258 McrAutomatonBuilder]: Finished intersection with 19 states and 24 transitions. [2020-10-16 13:22:22,228 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:22,251 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-16 13:22:22,251 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:22,253 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:22:22,253 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:22,256 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:22,284 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:22,287 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:22,289 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:22,309 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:22,311 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:22,320 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:22,325 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:22,326 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:22,368 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:22,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 13:22:22,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:22,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 13:22:22,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:22:22,370 INFO L87 Difference]: Start difference. First operand 1792 states and 6736 transitions. Second operand 4 states. [2020-10-16 13:22:22,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:22,454 INFO L93 Difference]: Finished difference Result 1700 states and 6324 transitions. [2020-10-16 13:22:22,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:22:22,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-16 13:22:22,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:22,472 INFO L225 Difference]: With dead ends: 1700 [2020-10-16 13:22:22,473 INFO L226 Difference]: Without dead ends: 1700 [2020-10-16 13:22:22,473 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:22:22,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2020-10-16 13:22:22,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1700. [2020-10-16 13:22:22,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1700 states. [2020-10-16 13:22:22,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 6324 transitions. [2020-10-16 13:22:22,547 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 6324 transitions. Word has length 12 [2020-10-16 13:22:22,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:22,548 INFO L481 AbstractCegarLoop]: Abstraction has 1700 states and 6324 transitions. [2020-10-16 13:22:22,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 13:22:22,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 6324 transitions. [2020-10-16 13:22:22,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 13:22:22,551 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:22,551 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:22,552 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 13:22:22,552 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:22,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:22,553 INFO L82 PathProgramCache]: Analyzing trace with hash -689526251, now seen corresponding path program 1 times [2020-10-16 13:22:22,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:22,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293663358] [2020-10-16 13:22:22,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:22,621 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 13:22:22,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293663358] [2020-10-16 13:22:22,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:22,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 13:22:22,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1505953401] [2020-10-16 13:22:22,623 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:22,625 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:22,631 INFO L258 McrAutomatonBuilder]: Finished intersection with 31 states and 50 transitions. [2020-10-16 13:22:22,631 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:22,645 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 13:22:22,646 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:22,647 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:22,654 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:22,662 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 13:22:22,665 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 13:22:22,696 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 13:22:22,696 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:22,697 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:22,700 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:22,732 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 13:22:22,732 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:22,733 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:22,740 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 13:22:22,743 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:22,748 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 13:22:22,812 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:22,813 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 13:22:22,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:22,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 13:22:22,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:22:22,814 INFO L87 Difference]: Start difference. First operand 1700 states and 6324 transitions. Second operand 4 states. [2020-10-16 13:22:23,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:23,009 INFO L93 Difference]: Finished difference Result 1716 states and 6380 transitions. [2020-10-16 13:22:23,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:22:23,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-16 13:22:23,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:23,026 INFO L225 Difference]: With dead ends: 1716 [2020-10-16 13:22:23,026 INFO L226 Difference]: Without dead ends: 1716 [2020-10-16 13:22:23,026 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:22:23,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2020-10-16 13:22:23,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1716. [2020-10-16 13:22:23,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1716 states. [2020-10-16 13:22:23,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 6380 transitions. [2020-10-16 13:22:23,109 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 6380 transitions. Word has length 14 [2020-10-16 13:22:23,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:23,109 INFO L481 AbstractCegarLoop]: Abstraction has 1716 states and 6380 transitions. [2020-10-16 13:22:23,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 13:22:23,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 6380 transitions. [2020-10-16 13:22:23,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 13:22:23,112 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:23,113 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:23,113 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 13:22:23,113 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:23,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:23,114 INFO L82 PathProgramCache]: Analyzing trace with hash -690440441, now seen corresponding path program 2 times [2020-10-16 13:22:23,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:23,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502854130] [2020-10-16 13:22:23,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:23,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:22:23,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502854130] [2020-10-16 13:22:23,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:23,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:22:23,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1827377165] [2020-10-16 13:22:23,200 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:23,202 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:23,209 INFO L258 McrAutomatonBuilder]: Finished intersection with 35 states and 60 transitions. [2020-10-16 13:22:23,210 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:23,220 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:23,222 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:22:23,224 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:22:23,226 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 3, 2, 1] term [2020-10-16 13:22:23,226 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:23,227 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:23,231 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:23,235 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:23,238 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:23,244 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:23,245 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:23,251 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:23,257 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 13:22:23,258 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:23,265 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:23,272 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:23,273 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:23,274 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:23,353 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:23,353 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 13:22:23,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:23,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 13:22:23,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:22:23,354 INFO L87 Difference]: Start difference. First operand 1716 states and 6380 transitions. Second operand 5 states. [2020-10-16 13:22:23,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:23,448 INFO L93 Difference]: Finished difference Result 1674 states and 6208 transitions. [2020-10-16 13:22:23,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:22:23,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-16 13:22:23,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:23,465 INFO L225 Difference]: With dead ends: 1674 [2020-10-16 13:22:23,465 INFO L226 Difference]: Without dead ends: 1674 [2020-10-16 13:22:23,466 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-16 13:22:23,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2020-10-16 13:22:23,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1658. [2020-10-16 13:22:23,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1658 states. [2020-10-16 13:22:23,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 6152 transitions. [2020-10-16 13:22:23,542 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 6152 transitions. Word has length 14 [2020-10-16 13:22:23,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:23,543 INFO L481 AbstractCegarLoop]: Abstraction has 1658 states and 6152 transitions. [2020-10-16 13:22:23,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 13:22:23,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 6152 transitions. [2020-10-16 13:22:23,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 13:22:23,546 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:23,546 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:23,546 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 13:22:23,546 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:23,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:23,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1833687082, now seen corresponding path program 1 times [2020-10-16 13:22:23,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:23,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354844547] [2020-10-16 13:22:23,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:23,620 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 13:22:23,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354844547] [2020-10-16 13:22:23,621 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:23,621 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 13:22:23,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [994386888] [2020-10-16 13:22:23,622 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:23,625 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:23,631 INFO L258 McrAutomatonBuilder]: Finished intersection with 18 states and 20 transitions. [2020-10-16 13:22:23,631 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:23,641 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-16 13:22:23,642 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:23,644 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:23,646 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:23,647 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:23,655 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:22:23,655 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:23,656 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:23,672 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:23,672 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 13:22:23,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:23,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 13:22:23,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:22:23,673 INFO L87 Difference]: Start difference. First operand 1658 states and 6152 transitions. Second operand 4 states. [2020-10-16 13:22:23,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:23,775 INFO L93 Difference]: Finished difference Result 1626 states and 6010 transitions. [2020-10-16 13:22:23,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:22:23,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-16 13:22:23,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:23,794 INFO L225 Difference]: With dead ends: 1626 [2020-10-16 13:22:23,795 INFO L226 Difference]: Without dead ends: 1626 [2020-10-16 13:22:23,795 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 13:22:23,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2020-10-16 13:22:23,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1626. [2020-10-16 13:22:23,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1626 states. [2020-10-16 13:22:23,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 6010 transitions. [2020-10-16 13:22:23,869 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 6010 transitions. Word has length 14 [2020-10-16 13:22:23,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:23,869 INFO L481 AbstractCegarLoop]: Abstraction has 1626 states and 6010 transitions. [2020-10-16 13:22:23,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 13:22:23,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 6010 transitions. [2020-10-16 13:22:23,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 13:22:23,873 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:23,873 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:23,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 13:22:23,873 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:23,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:23,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1890097590, now seen corresponding path program 1 times [2020-10-16 13:22:23,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:23,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132534334] [2020-10-16 13:22:23,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:23,955 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 13:22:23,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132534334] [2020-10-16 13:22:23,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:23,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:22:23,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1516390539] [2020-10-16 13:22:23,957 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:23,960 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:23,968 INFO L258 McrAutomatonBuilder]: Finished intersection with 31 states and 48 transitions. [2020-10-16 13:22:23,968 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:24,001 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:24,015 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:24,033 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:24,070 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:24,084 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:24,085 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 13:22:24,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:24,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 13:22:24,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:22:24,086 INFO L87 Difference]: Start difference. First operand 1626 states and 6010 transitions. Second operand 4 states. [2020-10-16 13:22:24,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:24,144 INFO L93 Difference]: Finished difference Result 1682 states and 5674 transitions. [2020-10-16 13:22:24,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 13:22:24,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-16 13:22:24,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:24,157 INFO L225 Difference]: With dead ends: 1682 [2020-10-16 13:22:24,157 INFO L226 Difference]: Without dead ends: 1282 [2020-10-16 13:22:24,158 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 4 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 13:22:24,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2020-10-16 13:22:24,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1282. [2020-10-16 13:22:24,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1282 states. [2020-10-16 13:22:24,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 4290 transitions. [2020-10-16 13:22:24,278 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 4290 transitions. Word has length 15 [2020-10-16 13:22:24,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:24,279 INFO L481 AbstractCegarLoop]: Abstraction has 1282 states and 4290 transitions. [2020-10-16 13:22:24,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 13:22:24,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 4290 transitions. [2020-10-16 13:22:24,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 13:22:24,282 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:24,284 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:24,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 13:22:24,284 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:24,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:24,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1535573628, now seen corresponding path program 1 times [2020-10-16 13:22:24,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:24,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581020761] [2020-10-16 13:22:24,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:24,393 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 13:22:24,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581020761] [2020-10-16 13:22:24,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:24,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 13:22:24,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [156466610] [2020-10-16 13:22:24,394 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:24,397 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:24,404 INFO L258 McrAutomatonBuilder]: Finished intersection with 27 states and 36 transitions. [2020-10-16 13:22:24,404 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:24,423 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:24,469 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:24,470 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 13:22:24,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:24,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 13:22:24,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:22:24,471 INFO L87 Difference]: Start difference. First operand 1282 states and 4290 transitions. Second operand 5 states. [2020-10-16 13:22:24,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:24,543 INFO L93 Difference]: Finished difference Result 1105 states and 3390 transitions. [2020-10-16 13:22:24,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 13:22:24,544 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-16 13:22:24,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:24,551 INFO L225 Difference]: With dead ends: 1105 [2020-10-16 13:22:24,552 INFO L226 Difference]: Without dead ends: 849 [2020-10-16 13:22:24,552 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 13:22:24,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2020-10-16 13:22:24,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 849. [2020-10-16 13:22:24,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2020-10-16 13:22:24,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 2558 transitions. [2020-10-16 13:22:24,583 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 2558 transitions. Word has length 16 [2020-10-16 13:22:24,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:24,583 INFO L481 AbstractCegarLoop]: Abstraction has 849 states and 2558 transitions. [2020-10-16 13:22:24,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 13:22:24,583 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 2558 transitions. [2020-10-16 13:22:24,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-16 13:22:24,586 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:24,586 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:24,586 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 13:22:24,586 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:24,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:24,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1327185945, now seen corresponding path program 1 times [2020-10-16 13:22:24,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:24,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021674807] [2020-10-16 13:22:24,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:24,635 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 13:22:24,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021674807] [2020-10-16 13:22:24,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:24,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 13:22:24,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [466139657] [2020-10-16 13:22:24,636 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:24,640 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:24,652 INFO L258 McrAutomatonBuilder]: Finished intersection with 44 states and 68 transitions. [2020-10-16 13:22:24,652 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:24,703 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:24,704 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:22:24,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:24,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:22:24,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:22:24,705 INFO L87 Difference]: Start difference. First operand 849 states and 2558 transitions. Second operand 3 states. [2020-10-16 13:22:24,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:24,723 INFO L93 Difference]: Finished difference Result 1190 states and 3477 transitions. [2020-10-16 13:22:24,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:22:24,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-10-16 13:22:24,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:24,730 INFO L225 Difference]: With dead ends: 1190 [2020-10-16 13:22:24,731 INFO L226 Difference]: Without dead ends: 860 [2020-10-16 13:22:24,731 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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 13:22:24,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2020-10-16 13:22:24,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 840. [2020-10-16 13:22:24,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2020-10-16 13:22:24,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 2399 transitions. [2020-10-16 13:22:24,761 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 2399 transitions. Word has length 18 [2020-10-16 13:22:24,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:24,761 INFO L481 AbstractCegarLoop]: Abstraction has 840 states and 2399 transitions. [2020-10-16 13:22:24,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:22:24,762 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 2399 transitions. [2020-10-16 13:22:24,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-16 13:22:24,765 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:24,765 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:24,765 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 13:22:24,765 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:24,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:24,766 INFO L82 PathProgramCache]: Analyzing trace with hash 738469067, now seen corresponding path program 1 times [2020-10-16 13:22:24,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:24,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902328276] [2020-10-16 13:22:24,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:24,877 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 13:22:24,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902328276] [2020-10-16 13:22:24,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:24,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 13:22:24,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [851127320] [2020-10-16 13:22:24,878 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:24,883 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:24,893 INFO L258 McrAutomatonBuilder]: Finished intersection with 40 states and 60 transitions. [2020-10-16 13:22:24,893 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:24,985 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [46592#(<= ~__unbuffered_cnt~0 0)] [2020-10-16 13:22:24,985 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 13:22:24,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:24,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 13:22:24,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:22:24,986 INFO L87 Difference]: Start difference. First operand 840 states and 2399 transitions. Second operand 7 states. [2020-10-16 13:22:25,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:25,057 INFO L93 Difference]: Finished difference Result 733 states and 2056 transitions. [2020-10-16 13:22:25,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 13:22:25,058 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-10-16 13:22:25,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:25,062 INFO L225 Difference]: With dead ends: 733 [2020-10-16 13:22:25,062 INFO L226 Difference]: Without dead ends: 645 [2020-10-16 13:22:25,063 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-16 13:22:25,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2020-10-16 13:22:25,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 645. [2020-10-16 13:22:25,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2020-10-16 13:22:25,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1834 transitions. [2020-10-16 13:22:25,083 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1834 transitions. Word has length 18 [2020-10-16 13:22:25,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:25,083 INFO L481 AbstractCegarLoop]: Abstraction has 645 states and 1834 transitions. [2020-10-16 13:22:25,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 13:22:25,083 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1834 transitions. [2020-10-16 13:22:25,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 13:22:25,086 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:25,086 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] [2020-10-16 13:22:25,086 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 13:22:25,086 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:25,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:25,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1256513490, now seen corresponding path program 1 times [2020-10-16 13:22:25,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:25,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587388126] [2020-10-16 13:22:25,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:25,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:25,137 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 13:22:25,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587388126] [2020-10-16 13:22:25,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:25,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:22:25,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1887790310] [2020-10-16 13:22:25,138 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:25,143 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:25,173 INFO L258 McrAutomatonBuilder]: Finished intersection with 112 states and 223 transitions. [2020-10-16 13:22:25,174 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:25,470 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:25,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 13:22:25,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:25,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 13:22:25,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:22:25,472 INFO L87 Difference]: Start difference. First operand 645 states and 1834 transitions. Second operand 4 states. [2020-10-16 13:22:25,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:25,495 INFO L93 Difference]: Finished difference Result 852 states and 2354 transitions. [2020-10-16 13:22:25,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:22:25,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-10-16 13:22:25,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:25,505 INFO L225 Difference]: With dead ends: 852 [2020-10-16 13:22:25,505 INFO L226 Difference]: Without dead ends: 582 [2020-10-16 13:22:25,505 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 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 13:22:25,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-10-16 13:22:25,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 579. [2020-10-16 13:22:25,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2020-10-16 13:22:25,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1541 transitions. [2020-10-16 13:22:25,529 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1541 transitions. Word has length 21 [2020-10-16 13:22:25,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:25,530 INFO L481 AbstractCegarLoop]: Abstraction has 579 states and 1541 transitions. [2020-10-16 13:22:25,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 13:22:25,530 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1541 transitions. [2020-10-16 13:22:25,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 13:22:25,532 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:25,532 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] [2020-10-16 13:22:25,532 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 13:22:25,533 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:25,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:25,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1670045084, now seen corresponding path program 2 times [2020-10-16 13:22:25,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:25,539 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742245916] [2020-10-16 13:22:25,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:25,716 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 13:22:25,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742245916] [2020-10-16 13:22:25,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:25,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 13:22:25,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [301462749] [2020-10-16 13:22:25,717 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:25,722 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:25,740 INFO L258 McrAutomatonBuilder]: Finished intersection with 56 states and 91 transitions. [2020-10-16 13:22:25,741 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:25,794 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [50641#(<= ~__unbuffered_cnt~0 0)] [2020-10-16 13:22:25,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 13:22:25,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:25,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 13:22:25,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-16 13:22:25,796 INFO L87 Difference]: Start difference. First operand 579 states and 1541 transitions. Second operand 8 states. [2020-10-16 13:22:25,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:25,882 INFO L93 Difference]: Finished difference Result 554 states and 1491 transitions. [2020-10-16 13:22:25,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 13:22:25,883 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-10-16 13:22:25,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:25,888 INFO L225 Difference]: With dead ends: 554 [2020-10-16 13:22:25,888 INFO L226 Difference]: Without dead ends: 179 [2020-10-16 13:22:25,889 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-16 13:22:25,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-10-16 13:22:25,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2020-10-16 13:22:25,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-10-16 13:22:25,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 445 transitions. [2020-10-16 13:22:25,897 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 445 transitions. Word has length 21 [2020-10-16 13:22:25,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:25,898 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 445 transitions. [2020-10-16 13:22:25,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 13:22:25,898 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 445 transitions. [2020-10-16 13:22:25,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-16 13:22:25,899 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:25,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] [2020-10-16 13:22:25,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 13:22:25,899 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:25,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:25,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1669800279, now seen corresponding path program 1 times [2020-10-16 13:22:25,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:25,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612679626] [2020-10-16 13:22:25,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:26,110 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 13:22:26,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612679626] [2020-10-16 13:22:26,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:26,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 13:22:26,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [538258772] [2020-10-16 13:22:26,113 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:26,118 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:26,152 INFO L258 McrAutomatonBuilder]: Finished intersection with 88 states and 152 transitions. [2020-10-16 13:22:26,153 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:26,168 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-10-16 13:22:26,169 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,169 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-10-16 13:22:26,170 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,174 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-16 13:22:26,175 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,176 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:22:26,176 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,178 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,180 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,183 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,186 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,187 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,187 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:22:26,189 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,197 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:26,198 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,204 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:26,208 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:26,213 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,217 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,219 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,222 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,225 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,227 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:26,230 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,234 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,239 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,241 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,242 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,243 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:26,244 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:26,248 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,253 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,257 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:26,260 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:26,263 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:26,268 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,271 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:26,275 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,278 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,284 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,287 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,287 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:26,288 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 6 conjuncts [2020-10-16 13:22:26,289 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:26,293 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:26,298 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,304 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-16 13:22:26,313 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:26,326 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:26,334 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 13:22:26,339 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:26,344 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,350 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts [2020-10-16 13:22:26,358 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,361 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:26,366 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,368 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,374 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:26,381 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 13:22:26,387 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,387 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,393 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,394 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:26,405 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:26,408 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,413 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,415 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,420 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,421 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:26,456 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-10-16 13:22:26,457 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,458 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-10-16 13:22:26,458 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,461 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:22:26,461 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,463 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:22:26,463 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,464 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,466 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,467 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,473 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,474 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,476 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,477 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,478 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,484 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:22:26,485 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:26,486 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,488 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,489 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,500 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,501 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,502 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:26,505 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,508 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,516 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,517 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,518 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:26,519 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,520 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:26,525 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:26,528 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,537 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,538 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,539 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:26,541 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,544 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,550 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,551 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,552 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:26,552 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,553 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,557 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:26,560 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,565 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,565 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,567 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:26,569 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,575 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:22:26,576 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,577 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,580 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:26,583 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,589 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:26,590 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 13:22:26,595 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:26,601 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,607 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:26,613 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:26,614 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 13:22:26,619 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:26,625 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,632 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:26,638 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,638 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:22:26,639 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,640 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,644 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:26,647 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,654 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:26,655 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 13:22:26,661 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:26,668 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,739 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:26,744 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,746 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,749 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:26,751 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,757 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:26,757 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:26,758 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 13:22:26,762 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:26,767 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,773 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:26,778 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-16 13:22:26,779 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:26,779 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 13:22:26,784 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:26,789 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,795 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:26,802 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-16 13:22:26,808 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:26,813 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-16 13:22:26,815 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 13:22:26,852 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-10-16 13:22:26,853 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,854 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-10-16 13:22:26,854 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,858 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:22:26,858 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,859 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:22:26,860 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,861 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,863 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,870 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,871 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,875 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,876 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,878 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,879 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:26,883 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,886 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,887 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:22:26,887 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:26,916 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:26,927 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:26,948 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:27,008 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:27,031 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:27,032 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-16 13:22:27,036 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:27,076 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:27,094 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:27,124 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,136 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,147 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,156 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:22:27,157 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:22:27,158 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:22:27,158 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:27,159 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,163 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:27,166 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,170 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:27,173 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:27,178 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:27,179 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,185 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:27,188 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:27,193 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:27,193 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,199 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:22:27,200 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:27,203 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:27,208 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:27,209 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:27,215 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:27,216 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:27,218 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,223 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,227 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,236 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:22:27,237 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:22:27,238 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:27,239 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:27,240 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:27,245 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:27,248 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,255 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:22:27,255 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:27,261 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:27,262 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,262 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,263 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,270 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:27,274 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:27,275 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:27,275 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,307 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,321 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,324 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:27,325 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,355 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,372 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,373 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,378 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,422 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,439 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,445 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 4 conjuncts [2020-10-16 13:22:27,448 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 4 conjuncts [2020-10-16 13:22:27,450 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 4 conjuncts [2020-10-16 13:22:27,456 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:27,457 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:22:27,458 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:22:27,489 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:27,512 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:27,537 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:27,539 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,548 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:27,549 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:27,550 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:27,553 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,556 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 13:22:27,557 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,562 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:27,576 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:22:27,606 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:22:27,631 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 13:22:27,652 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,722 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-16 13:22:27,723 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:27,724 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:27,725 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:27,731 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,735 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:22:27,736 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:27,736 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:27,854 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-16 13:22:27,854 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:27,855 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:27,857 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,857 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,863 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:22:27,864 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:27,865 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:27,884 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:22:27,884 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:27,885 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:27,886 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:27,892 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,894 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:27,909 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:27,910 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,911 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,912 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:27,917 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,920 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,925 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:27,951 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-16 13:22:27,952 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:27,953 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:27,955 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,955 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,961 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:22:27,961 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:27,962 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:27,977 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:22:27,977 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:27,978 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:27,979 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:27,984 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,986 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:27,992 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:27,992 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:27,994 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:27,994 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:28,000 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:28,001 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:28,003 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:28,015 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:28,028 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:28,028 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 13:22:28,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:28,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 13:22:28,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:22:28,029 INFO L87 Difference]: Start difference. First operand 179 states and 445 transitions. Second operand 7 states. [2020-10-16 13:22:28,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:28,117 INFO L93 Difference]: Finished difference Result 274 states and 680 transitions. [2020-10-16 13:22:28,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 13:22:28,118 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-10-16 13:22:28,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:28,119 INFO L225 Difference]: With dead ends: 274 [2020-10-16 13:22:28,119 INFO L226 Difference]: Without dead ends: 172 [2020-10-16 13:22:28,119 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 6 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:22:28,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-10-16 13:22:28,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 139. [2020-10-16 13:22:28,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-10-16 13:22:28,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 317 transitions. [2020-10-16 13:22:28,124 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 317 transitions. Word has length 25 [2020-10-16 13:22:28,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:28,124 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 317 transitions. [2020-10-16 13:22:28,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 13:22:28,125 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 317 transitions. [2020-10-16 13:22:28,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-16 13:22:28,126 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:28,127 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] [2020-10-16 13:22:28,127 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 13:22:28,127 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:28,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:28,127 INFO L82 PathProgramCache]: Analyzing trace with hash 2056310337, now seen corresponding path program 2 times [2020-10-16 13:22:28,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:28,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171931881] [2020-10-16 13:22:28,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 13:22:28,187 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 13:22:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 13:22:28,257 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 13:22:28,311 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 13:22:28,312 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 13:22:28,312 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 13:22:28,313 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 13:22:28,328 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L2-->L843: Formula: (let ((.cse6 (= (mod ~z$r_buff0_thd0~0_In-872263438 256) 0)) (.cse7 (= (mod ~z$w_buff0_used~0_In-872263438 256) 0)) (.cse8 (= (mod ~z$w_buff1_used~0_In-872263438 256) 0)) (.cse9 (= (mod ~z$r_buff1_thd0~0_In-872263438 256) 0))) (let ((.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse0 (or .cse8 .cse9)) (.cse3 (or .cse6 .cse7)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (or (and (= ~z$w_buff1_used~0_Out-872263438 ~z$w_buff1_used~0_In-872263438) .cse0) (and .cse1 .cse2 (= ~z$w_buff1_used~0_Out-872263438 0))) (or (and .cse3 (= ~z$w_buff0_used~0_Out-872263438 ~z$w_buff0_used~0_In-872263438)) (and (= ~z$w_buff0_used~0_Out-872263438 0) .cse4 .cse5)) (= ~z$r_buff1_thd0~0_Out-872263438 ~z$r_buff1_thd0~0_In-872263438) (or (and (or (and .cse1 (= ~z$w_buff1~0_In-872263438 ~z~0_Out-872263438) .cse2) (and (= ~z~0_In-872263438 ~z~0_Out-872263438) .cse0)) .cse3) (and .cse4 (= ~z~0_Out-872263438 ~z$w_buff0~0_In-872263438) .cse5)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-872263438 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-872263438|) (= ~z$r_buff0_thd0~0_In-872263438 ~z$r_buff0_thd0~0_Out-872263438) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-872263438 0))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-872263438|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-872263438, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-872263438, ~z$w_buff0~0=~z$w_buff0~0_In-872263438, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-872263438, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-872263438, ~z$w_buff1~0=~z$w_buff1~0_In-872263438, ~z~0=~z~0_In-872263438} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-872263438, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-872263438|, ~z$w_buff0~0=~z$w_buff0~0_In-872263438, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-872263438|, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-872263438, ~z$w_buff1~0=~z$w_buff1~0_In-872263438, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-872263438|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-872263438|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-872263438|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-872263438|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-872263438|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-872263438, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-872263438, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-872263438, ~z~0=~z~0_Out-872263438} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-16 13:22:28,340 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 13:22:28,340 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:28,343 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 13:22:28,344 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:28,344 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:28,344 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:28,344 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:28,344 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:28,344 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:28,345 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:28,345 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 13:22:28,345 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:28,346 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 13:22:28,346 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:28,346 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 13:22:28,346 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:28,346 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 13:22:28,346 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:28,347 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 13:22:28,347 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:28,347 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 13:22:28,347 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:28,347 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 13:22:28,347 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:28,348 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 13:22:28,348 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:28,348 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 13:22:28,348 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:28,349 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 13:22:28,349 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:28,349 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 13:22:28,349 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:28,349 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 13:22:28,350 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:28,353 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:28,354 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:28,354 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:28,354 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:28,354 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:28,354 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:28,354 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:28,354 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:28,355 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:28,355 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:28,355 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:28,355 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:28,355 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:28,355 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:28,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:22:28 BasicIcfg [2020-10-16 13:22:28,437 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 13:22:28,439 INFO L168 Benchmark]: Toolchain (without parser) took 19620.25 ms. Allocated memory was 144.7 MB in the beginning and 485.5 MB in the end (delta: 340.8 MB). Free memory was 106.1 MB in the beginning and 315.8 MB in the end (delta: -209.7 MB). Peak memory consumption was 131.0 MB. Max. memory is 7.1 GB. [2020-10-16 13:22:28,440 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 144.7 MB. Free memory was 126.2 MB in the beginning and 125.8 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. [2020-10-16 13:22:28,441 INFO L168 Benchmark]: CACSL2BoogieTranslator took 859.43 ms. Allocated memory was 144.7 MB in the beginning and 205.5 MB in the end (delta: 60.8 MB). Free memory was 106.1 MB in the beginning and 158.8 MB in the end (delta: -52.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. [2020-10-16 13:22:28,441 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.82 ms. Allocated memory is still 205.5 MB. Free memory was 158.8 MB in the beginning and 155.3 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. [2020-10-16 13:22:28,442 INFO L168 Benchmark]: Boogie Preprocessor took 41.77 ms. Allocated memory is still 205.5 MB. Free memory was 155.3 MB in the beginning and 153.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2020-10-16 13:22:28,442 INFO L168 Benchmark]: RCFGBuilder took 2010.15 ms. Allocated memory was 205.5 MB in the beginning and 240.6 MB in the end (delta: 35.1 MB). Free memory was 153.5 MB in the beginning and 155.5 MB in the end (delta: -2.0 MB). Peak memory consumption was 85.2 MB. Max. memory is 7.1 GB. [2020-10-16 13:22:28,443 INFO L168 Benchmark]: TraceAbstraction took 16630.55 ms. Allocated memory was 240.6 MB in the beginning and 485.5 MB in the end (delta: 244.8 MB). Free memory was 155.5 MB in the beginning and 315.8 MB in the end (delta: -160.3 MB). Peak memory consumption was 84.5 MB. Max. memory is 7.1 GB. [2020-10-16 13:22:28,447 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.17 ms. Allocated memory is still 144.7 MB. Free memory was 126.2 MB in the beginning and 125.8 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 859.43 ms. Allocated memory was 144.7 MB in the beginning and 205.5 MB in the end (delta: 60.8 MB). Free memory was 106.1 MB in the beginning and 158.8 MB in the end (delta: -52.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.82 ms. Allocated memory is still 205.5 MB. Free memory was 158.8 MB in the beginning and 155.3 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.77 ms. Allocated memory is still 205.5 MB. Free memory was 155.3 MB in the beginning and 153.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2010.15 ms. Allocated memory was 205.5 MB in the beginning and 240.6 MB in the end (delta: 35.1 MB). Free memory was 153.5 MB in the beginning and 155.5 MB in the end (delta: -2.0 MB). Peak memory consumption was 85.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16630.55 ms. Allocated memory was 240.6 MB in the beginning and 485.5 MB in the end (delta: 244.8 MB). Free memory was 155.5 MB in the beginning and 315.8 MB in the end (delta: -160.3 MB). Peak memory consumption was 84.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1217 VarBasedMoverChecksPositive, 40 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 107 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.6s, 119 PlacesBefore, 44 PlacesAfterwards, 108 TransitionsBefore, 31 TransitionsAfterwards, 2352 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 89 TotalNumberOfCompositions, 6503 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_p3_EAX = 0; [L705] 0 int a = 0; [L706] 0 _Bool main$tmp_guard0; [L707] 0 _Bool main$tmp_guard1; [L709] 0 int x = 0; [L711] 0 int y = 0; [L713] 0 int z = 0; [L714] 0 _Bool z$flush_delayed; [L715] 0 int z$mem_tmp; [L716] 0 _Bool z$r_buff0_thd0; [L717] 0 _Bool z$r_buff0_thd1; [L718] 0 _Bool z$r_buff0_thd2; [L719] 0 _Bool z$r_buff0_thd3; [L720] 0 _Bool z$r_buff0_thd4; [L721] 0 _Bool z$r_buff1_thd0; [L722] 0 _Bool z$r_buff1_thd1; [L723] 0 _Bool z$r_buff1_thd2; [L724] 0 _Bool z$r_buff1_thd3; [L725] 0 _Bool z$r_buff1_thd4; [L726] 0 _Bool z$read_delayed; [L727] 0 int *z$read_delayed_var; [L728] 0 int z$w_buff0; [L729] 0 _Bool z$w_buff0_used; [L730] 0 int z$w_buff1; [L731] 0 _Bool z$w_buff1_used; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1485; [L826] FCALL, FORK 0 pthread_create(&t1485, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 pthread_t t1486; [L828] FCALL, FORK 0 pthread_create(&t1486, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 pthread_t t1487; [L830] FCALL, FORK 0 pthread_create(&t1487, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 0 pthread_t t1488; [L832] FCALL, FORK 0 pthread_create(&t1488, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 4 z$w_buff1 = z$w_buff0 [L788] 4 z$w_buff0 = 2 [L789] 4 z$w_buff1_used = z$w_buff0_used [L790] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L792] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L793] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L794] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L795] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L796] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L797] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L737] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L747] 1 return 0; [L752] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 2 return 0; [L767] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_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=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L803] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L804] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L804] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L805] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L805] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L806] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L807] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L807] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L810] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 4 return 0; [L773] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L773] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L773] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L773] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L774] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L774] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L775] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L776] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L776] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L777] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L777] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L780] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 3 return 0; [L834] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L845] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L846] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L847] 0 z$flush_delayed = weak$$choice2 [L848] 0 z$mem_tmp = z [L849] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L849] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L850] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L850] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0 [L850] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L850] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L850] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L851] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L851] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L852] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L852] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L853] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L854] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L855] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L855] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L855] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L855] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L855] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L855] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L856] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L857] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L857] 0 z = z$flush_delayed ? z$mem_tmp : z [L858] 0 z$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_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=9, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 107 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.3s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.9s, HoareTripleCheckerStatistics: 390 SDtfs, 367 SDslu, 630 SDs, 0 SdLazy, 292 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 255 GetRequests, 195 SyntacticMatches, 18 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2602occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 72 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 233 NumberOfCodeBlocks, 233 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 20419 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...