/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix046_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 18:21:34,669 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 18:21:34,672 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 18:21:34,700 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 18:21:34,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 18:21:34,709 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 18:21:34,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 18:21:34,716 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 18:21:34,718 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 18:21:34,721 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 18:21:34,722 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 18:21:34,723 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 18:21:34,724 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 18:21:34,726 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 18:21:34,728 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 18:21:34,730 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 18:21:34,732 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 18:21:34,733 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 18:21:34,734 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 18:21:34,742 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 18:21:34,746 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 18:21:34,747 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 18:21:34,748 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 18:21:34,748 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 18:21:34,760 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 18:21:34,760 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 18:21:34,760 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 18:21:34,761 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 18:21:34,762 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 18:21:34,762 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 18:21:34,763 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 18:21:34,763 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 18:21:34,764 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 18:21:34,765 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 18:21:34,765 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 18:21:34,766 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 18:21:34,766 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 18:21:34,766 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 18:21:34,767 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 18:21:34,767 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 18:21:34,768 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 18:21:34,769 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-15 18:21:34,790 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 18:21:34,790 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 18:21:34,791 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 18:21:34,791 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 18:21:34,791 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 18:21:34,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 18:21:34,792 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 18:21:34,792 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 18:21:34,792 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 18:21:34,792 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 18:21:34,793 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 18:21:34,793 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 18:21:34,793 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 18:21:34,793 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 18:21:34,793 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 18:21:34,794 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 18:21:34,794 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 18:21:34,794 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 18:21:34,794 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 18:21:34,794 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 18:21:34,794 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 18:21:34,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 18:21:34,795 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 18:21:34,795 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 18:21:34,795 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 18:21:34,795 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 18:21:34,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 18:21:34,796 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 18:21:34,796 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-15 18:21:34,796 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 18:21:35,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 18:21:35,118 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 18:21:35,121 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 18:21:35,123 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 18:21:35,123 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 18:21:35,124 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046_power.opt.i [2020-10-15 18:21:35,192 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efa5f91ba/4ae92019d1094a538063e540970b38ee/FLAG47349095d [2020-10-15 18:21:35,810 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 18:21:35,811 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046_power.opt.i [2020-10-15 18:21:35,826 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efa5f91ba/4ae92019d1094a538063e540970b38ee/FLAG47349095d [2020-10-15 18:21:36,031 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efa5f91ba/4ae92019d1094a538063e540970b38ee [2020-10-15 18:21:36,040 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 18:21:36,042 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 18:21:36,043 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 18:21:36,043 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 18:21:36,048 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 18:21:36,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:21:36" (1/1) ... [2020-10-15 18:21:36,052 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c0813b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:21:36, skipping insertion in model container [2020-10-15 18:21:36,052 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:21:36" (1/1) ... [2020-10-15 18:21:36,060 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 18:21:36,105 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 18:21:36,660 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:21:36,672 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 18:21:36,762 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:21:36,852 INFO L208 MainTranslator]: Completed translation [2020-10-15 18:21:36,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:21:36 WrapperNode [2020-10-15 18:21:36,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 18:21:36,853 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 18:21:36,853 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 18:21:36,854 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 18:21:36,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:21:36" (1/1) ... [2020-10-15 18:21:36,884 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:21:36" (1/1) ... [2020-10-15 18:21:36,926 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 18:21:36,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 18:21:36,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 18:21:36,927 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 18:21:36,937 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:21:36" (1/1) ... [2020-10-15 18:21:36,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:21:36" (1/1) ... [2020-10-15 18:21:36,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:21:36" (1/1) ... [2020-10-15 18:21:36,944 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:21:36" (1/1) ... [2020-10-15 18:21:36,956 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:21:36" (1/1) ... [2020-10-15 18:21:36,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:21:36" (1/1) ... [2020-10-15 18:21:36,966 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:21:36" (1/1) ... [2020-10-15 18:21:36,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 18:21:36,973 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 18:21:36,973 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 18:21:36,973 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 18:21:36,974 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:21:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 18:21:37,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 18:21:37,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-15 18:21:37,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 18:21:37,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 18:21:37,045 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-15 18:21:37,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-15 18:21:37,045 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-15 18:21:37,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-15 18:21:37,045 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-15 18:21:37,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-15 18:21:37,046 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-15 18:21:37,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-15 18:21:37,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-15 18:21:37,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 18:21:37,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 18:21:37,048 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-15 18:21:39,069 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 18:21:39,070 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-15 18:21:39,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:21:39 BoogieIcfgContainer [2020-10-15 18:21:39,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 18:21:39,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 18:21:39,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 18:21:39,077 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 18:21:39,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 06:21:36" (1/3) ... [2020-10-15 18:21:39,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12cfb0d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:21:39, skipping insertion in model container [2020-10-15 18:21:39,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:21:36" (2/3) ... [2020-10-15 18:21:39,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12cfb0d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:21:39, skipping insertion in model container [2020-10-15 18:21:39,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:21:39" (3/3) ... [2020-10-15 18:21:39,081 INFO L111 eAbstractionObserver]: Analyzing ICFG mix046_power.opt.i [2020-10-15 18:21:39,093 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 18:21:39,093 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 18:21:39,101 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-15 18:21:39,102 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 18:21:39,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,133 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,133 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,135 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,135 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,136 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,136 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,137 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,137 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,137 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,137 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,138 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,138 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,138 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,139 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,139 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,140 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,140 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,140 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,140 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,140 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,141 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,147 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,147 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,154 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,154 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,154 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,154 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,154 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,157 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,157 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,158 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,158 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,158 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,158 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,158 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,159 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,159 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,159 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,159 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,159 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,161 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,162 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:39,177 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-15 18:21:39,198 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 18:21:39,198 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 18:21:39,198 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 18:21:39,198 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 18:21:39,199 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 18:21:39,199 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 18:21:39,199 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 18:21:39,199 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 18:21:39,213 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 18:21:39,216 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 112 transitions, 244 flow [2020-10-15 18:21:39,219 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 112 transitions, 244 flow [2020-10-15 18:21:39,221 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow [2020-10-15 18:21:39,275 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2020-10-15 18:21:39,275 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-15 18:21:39,280 INFO L80 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-15 18:21:39,285 INFO L117 LiptonReduction]: Number of co-enabled transitions 2540 [2020-10-15 18:21:39,620 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-15 18:21:40,062 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-15 18:21:40,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:21:40,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:40,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:21:40,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:40,242 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:21:40,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:40,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:21:40,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:40,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:21:40,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:40,292 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term [2020-10-15 18:21:40,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:40,315 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:21:40,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:40,317 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:21:40,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:40,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:21:40,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:40,487 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:21:40,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:40,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-15 18:21:40,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:21:40,501 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-15 18:21:40,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:40,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:21:40,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:40,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:40,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:40,597 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:40,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:40,602 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:40,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:21:40,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:40,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:21:40,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:40,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:21:40,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-15 18:21:40,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:40,618 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-15 18:21:40,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:40,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-15 18:21:40,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:40,709 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:21:40,710 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:40,711 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:21:40,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:40,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:21:40,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:40,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:21:40,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:40,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:21:40,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:40,803 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:21:40,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:40,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:21:40,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:40,849 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:21:40,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:40,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:21:40,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:40,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:40,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:40,947 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:40,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:40,953 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:40,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:21:40,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:40,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:21:40,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:40,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:21:40,965 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-15 18:21:40,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:40,970 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-15 18:21:40,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:40,973 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-15 18:21:40,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:41,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:21:41,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:41,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:21:41,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:41,053 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-15 18:21:41,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:21:41,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-15 18:21:41,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:42,545 WARN L193 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 230 DAG size of output: 189 [2020-10-15 18:21:42,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-10-15 18:21:42,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:42,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:21:42,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:44,137 WARN L193 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 147 DAG size of output: 127 [2020-10-15 18:21:44,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:21:44,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:44,159 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:21:44,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:44,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:21:44,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:44,189 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term [2020-10-15 18:21:44,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:44,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:44,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:44,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:44,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:44,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:44,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:44,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:44,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:21:44,250 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:44,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:21:44,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:44,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:21:44,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-15 18:21:44,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:44,257 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-15 18:21:44,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:44,259 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-15 18:21:44,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:44,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:21:44,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:44,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:21:44,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:44,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-15 18:21:44,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:21:44,333 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-15 18:21:44,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:44,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:21:44,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:44,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:21:44,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:44,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:21:44,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:44,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:21:44,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:44,478 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:21:44,478 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:44,479 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:21:44,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:44,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:21:44,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:44,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:21:44,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:44,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:21:44,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:44,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:44,600 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:44,601 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:44,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:44,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:21:44,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:44,618 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:44,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:44,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:44,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:44,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:44,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:21:44,625 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:21:44,625 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:21:44,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 18:21:44,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:44,946 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-15 18:21:45,409 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-15 18:21:45,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:45,411 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-10-15 18:21:45,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:45,412 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:45,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:45,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:45,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:45,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:45,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:45,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:45,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:45,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-15 18:21:45,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:45,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:45,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:45,422 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:45,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:45,441 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-15 18:21:45,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:21:45,443 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-15 18:21:45,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:45,676 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 18:21:45,677 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:45,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-15 18:21:45,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:21:45,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-15 18:21:45,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:45,791 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-15 18:21:45,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:45,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-10-15 18:21:45,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:45,794 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:45,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:45,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:45,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:45,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:45,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:45,798 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:45,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:45,800 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-15 18:21:45,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:45,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:45,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:45,803 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:45,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:46,644 WARN L193 SmtUtils]: Spent 748.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 129 [2020-10-15 18:21:46,990 WARN L193 SmtUtils]: Spent 344.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-15 18:21:47,752 WARN L193 SmtUtils]: Spent 749.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 111 [2020-10-15 18:21:48,074 WARN L193 SmtUtils]: Spent 319.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-15 18:21:48,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:21:48,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:48,245 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:48,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:48,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:48,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:48,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:21:48,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:48,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:48,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:48,278 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:48,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:48,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:48,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:21:48,284 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:21:48,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:21:49,192 WARN L193 SmtUtils]: Spent 540.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-10-15 18:21:49,532 WARN L193 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-15 18:21:49,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:49,546 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:49,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:49,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:49,550 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:49,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:21:49,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:21:49,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:21:49,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:49,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:49,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:49,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:49,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:49,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:49,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:21:49,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:50,138 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2020-10-15 18:21:50,283 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-15 18:21:50,293 INFO L132 LiptonReduction]: Checked pairs total: 6932 [2020-10-15 18:21:50,293 INFO L134 LiptonReduction]: Total number of compositions: 93 [2020-10-15 18:21:50,299 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 33 transitions, 86 flow [2020-10-15 18:21:50,501 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3002 states. [2020-10-15 18:21:50,503 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states. [2020-10-15 18:21:50,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-15 18:21:50,516 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:50,517 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:21:50,517 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-15 18:21:50,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:50,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1805630863, now seen corresponding path program 1 times [2020-10-15 18:21:50,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:50,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985118974] [2020-10-15 18:21:50,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:50,816 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-15 18:21:50,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985118974] [2020-10-15 18:21:50,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:50,818 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:21:50,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424160044] [2020-10-15 18:21:50,823 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:21:50,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:50,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:21:50,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:21:50,838 INFO L87 Difference]: Start difference. First operand 3002 states. Second operand 3 states. [2020-10-15 18:21:50,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:50,970 INFO L93 Difference]: Finished difference Result 2602 states and 10064 transitions. [2020-10-15 18:21:50,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:21:50,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-15 18:21:50,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:51,027 INFO L225 Difference]: With dead ends: 2602 [2020-10-15 18:21:51,027 INFO L226 Difference]: Without dead ends: 2122 [2020-10-15 18:21:51,029 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-15 18:21:51,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2020-10-15 18:21:51,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2122. [2020-10-15 18:21:51,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2020-10-15 18:21:51,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 8080 transitions. [2020-10-15 18:21:51,244 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 8080 transitions. Word has length 9 [2020-10-15 18:21:51,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:51,245 INFO L481 AbstractCegarLoop]: Abstraction has 2122 states and 8080 transitions. [2020-10-15 18:21:51,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:21:51,246 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 8080 transitions. [2020-10-15 18:21:51,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-15 18:21:51,251 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:51,251 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:21:51,251 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 18:21:51,251 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-15 18:21:51,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:51,252 INFO L82 PathProgramCache]: Analyzing trace with hash 44553062, now seen corresponding path program 1 times [2020-10-15 18:21:51,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:51,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101954417] [2020-10-15 18:21:51,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:51,409 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-15 18:21:51,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101954417] [2020-10-15 18:21:51,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:51,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:21:51,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359791952] [2020-10-15 18:21:51,412 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:21:51,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:51,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:21:51,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:21:51,413 INFO L87 Difference]: Start difference. First operand 2122 states and 8080 transitions. Second operand 3 states. [2020-10-15 18:21:51,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:51,440 INFO L93 Difference]: Finished difference Result 1962 states and 7392 transitions. [2020-10-15 18:21:51,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:21:51,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-15 18:21:51,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:51,458 INFO L225 Difference]: With dead ends: 1962 [2020-10-15 18:21:51,458 INFO L226 Difference]: Without dead ends: 1962 [2020-10-15 18:21:51,459 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-15 18:21:51,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2020-10-15 18:21:51,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1962. [2020-10-15 18:21:51,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2020-10-15 18:21:51,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 7392 transitions. [2020-10-15 18:21:51,535 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 7392 transitions. Word has length 11 [2020-10-15 18:21:51,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:51,535 INFO L481 AbstractCegarLoop]: Abstraction has 1962 states and 7392 transitions. [2020-10-15 18:21:51,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:21:51,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 7392 transitions. [2020-10-15 18:21:51,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 18:21:51,539 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:51,539 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:21:51,540 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 18:21:51,540 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-15 18:21:51,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:51,540 INFO L82 PathProgramCache]: Analyzing trace with hash -182792945, now seen corresponding path program 1 times [2020-10-15 18:21:51,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:51,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831346373] [2020-10-15 18:21:51,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:51,715 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-15 18:21:51,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831346373] [2020-10-15 18:21:51,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:51,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:21:51,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924533811] [2020-10-15 18:21:51,716 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:21:51,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:51,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:21:51,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:21:51,717 INFO L87 Difference]: Start difference. First operand 1962 states and 7392 transitions. Second operand 5 states. [2020-10-15 18:21:51,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:51,818 INFO L93 Difference]: Finished difference Result 1946 states and 7316 transitions. [2020-10-15 18:21:51,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:21:51,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-15 18:21:51,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:51,842 INFO L225 Difference]: With dead ends: 1946 [2020-10-15 18:21:51,842 INFO L226 Difference]: Without dead ends: 1946 [2020-10-15 18:21:51,843 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:21:51,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2020-10-15 18:21:51,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1946. [2020-10-15 18:21:51,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2020-10-15 18:21:51,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 7316 transitions. [2020-10-15 18:21:51,918 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 7316 transitions. Word has length 13 [2020-10-15 18:21:51,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:51,919 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 7316 transitions. [2020-10-15 18:21:51,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:21:51,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 7316 transitions. [2020-10-15 18:21:51,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 18:21:51,922 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:51,922 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:21:51,922 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 18:21:51,922 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-15 18:21:51,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:51,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1371614753, now seen corresponding path program 1 times [2020-10-15 18:21:51,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:51,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048892000] [2020-10-15 18:21:51,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:52,088 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-15 18:21:52,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048892000] [2020-10-15 18:21:52,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:52,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:21:52,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361586467] [2020-10-15 18:21:52,089 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:21:52,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:52,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:21:52,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:21:52,090 INFO L87 Difference]: Start difference. First operand 1946 states and 7316 transitions. Second operand 5 states. [2020-10-15 18:21:52,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:52,188 INFO L93 Difference]: Finished difference Result 1898 states and 7104 transitions. [2020-10-15 18:21:52,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 18:21:52,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-15 18:21:52,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:52,204 INFO L225 Difference]: With dead ends: 1898 [2020-10-15 18:21:52,205 INFO L226 Difference]: Without dead ends: 1898 [2020-10-15 18:21:52,205 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:21:52,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2020-10-15 18:21:52,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1898. [2020-10-15 18:21:52,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2020-10-15 18:21:52,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 7104 transitions. [2020-10-15 18:21:52,267 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 7104 transitions. Word has length 14 [2020-10-15 18:21:52,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:52,267 INFO L481 AbstractCegarLoop]: Abstraction has 1898 states and 7104 transitions. [2020-10-15 18:21:52,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:21:52,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 7104 transitions. [2020-10-15 18:21:52,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 18:21:52,270 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:52,271 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:21:52,271 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 18:21:52,271 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-15 18:21:52,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:52,271 INFO L82 PathProgramCache]: Analyzing trace with hash 366071342, now seen corresponding path program 1 times [2020-10-15 18:21:52,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:52,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789743018] [2020-10-15 18:21:52,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:52,324 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-15 18:21:52,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789743018] [2020-10-15 18:21:52,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:52,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:21:52,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090066457] [2020-10-15 18:21:52,325 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:21:52,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:52,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:21:52,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:21:52,326 INFO L87 Difference]: Start difference. First operand 1898 states and 7104 transitions. Second operand 3 states. [2020-10-15 18:21:52,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:52,348 INFO L93 Difference]: Finished difference Result 1882 states and 7036 transitions. [2020-10-15 18:21:52,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:21:52,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-10-15 18:21:52,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:52,366 INFO L225 Difference]: With dead ends: 1882 [2020-10-15 18:21:52,366 INFO L226 Difference]: Without dead ends: 1882 [2020-10-15 18:21:52,367 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-15 18:21:52,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2020-10-15 18:21:52,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1882. [2020-10-15 18:21:52,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1882 states. [2020-10-15 18:21:52,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 7036 transitions. [2020-10-15 18:21:52,432 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 7036 transitions. Word has length 15 [2020-10-15 18:21:52,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:52,432 INFO L481 AbstractCegarLoop]: Abstraction has 1882 states and 7036 transitions. [2020-10-15 18:21:52,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:21:52,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 7036 transitions. [2020-10-15 18:21:52,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 18:21:52,436 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:52,436 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:21:52,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 18:21:52,437 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-15 18:21:52,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:52,437 INFO L82 PathProgramCache]: Analyzing trace with hash 429613437, now seen corresponding path program 1 times [2020-10-15 18:21:52,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:52,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129034837] [2020-10-15 18:21:52,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:52,593 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-15 18:21:52,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129034837] [2020-10-15 18:21:52,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:52,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:21:52,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476546574] [2020-10-15 18:21:52,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:21:52,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:52,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:21:52,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:21:52,596 INFO L87 Difference]: Start difference. First operand 1882 states and 7036 transitions. Second operand 5 states. [2020-10-15 18:21:52,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:52,699 INFO L93 Difference]: Finished difference Result 2074 states and 7708 transitions. [2020-10-15 18:21:52,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:21:52,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-15 18:21:52,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:52,717 INFO L225 Difference]: With dead ends: 2074 [2020-10-15 18:21:52,718 INFO L226 Difference]: Without dead ends: 2074 [2020-10-15 18:21:52,718 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:21:52,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2020-10-15 18:21:52,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 1978. [2020-10-15 18:21:52,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1978 states. [2020-10-15 18:21:52,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 7356 transitions. [2020-10-15 18:21:52,793 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 7356 transitions. Word has length 15 [2020-10-15 18:21:52,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:52,794 INFO L481 AbstractCegarLoop]: Abstraction has 1978 states and 7356 transitions. [2020-10-15 18:21:52,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:21:52,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 7356 transitions. [2020-10-15 18:21:52,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 18:21:52,797 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:52,797 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:21:52,798 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 18:21:52,798 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-15 18:21:52,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:52,798 INFO L82 PathProgramCache]: Analyzing trace with hash 427993377, now seen corresponding path program 2 times [2020-10-15 18:21:52,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:52,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276277693] [2020-10-15 18:21:52,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:52,917 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-15 18:21:52,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276277693] [2020-10-15 18:21:52,918 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:52,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:21:52,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103723347] [2020-10-15 18:21:52,918 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:21:52,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:52,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:21:52,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:21:52,919 INFO L87 Difference]: Start difference. First operand 1978 states and 7356 transitions. Second operand 6 states. [2020-10-15 18:21:53,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:53,052 INFO L93 Difference]: Finished difference Result 2074 states and 7660 transitions. [2020-10-15 18:21:53,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:21:53,053 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-15 18:21:53,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:53,086 INFO L225 Difference]: With dead ends: 2074 [2020-10-15 18:21:53,086 INFO L226 Difference]: Without dead ends: 2074 [2020-10-15 18:21:53,086 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:21:53,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2020-10-15 18:21:53,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 1946. [2020-10-15 18:21:53,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2020-10-15 18:21:53,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 7244 transitions. [2020-10-15 18:21:53,159 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 7244 transitions. Word has length 15 [2020-10-15 18:21:53,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:53,160 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 7244 transitions. [2020-10-15 18:21:53,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:21:53,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 7244 transitions. [2020-10-15 18:21:53,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 18:21:53,166 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:53,166 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:21:53,166 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 18:21:53,167 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-15 18:21:53,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:53,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1536691040, now seen corresponding path program 1 times [2020-10-15 18:21:53,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:53,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686709782] [2020-10-15 18:21:53,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:53,284 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-15 18:21:53,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686709782] [2020-10-15 18:21:53,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:53,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:21:53,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346973380] [2020-10-15 18:21:53,286 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:21:53,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:53,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:21:53,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:21:53,286 INFO L87 Difference]: Start difference. First operand 1946 states and 7244 transitions. Second operand 4 states. [2020-10-15 18:21:53,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:53,348 INFO L93 Difference]: Finished difference Result 2032 states and 6903 transitions. [2020-10-15 18:21:53,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:21:53,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-15 18:21:53,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:53,362 INFO L225 Difference]: With dead ends: 2032 [2020-10-15 18:21:53,363 INFO L226 Difference]: Without dead ends: 1520 [2020-10-15 18:21:53,365 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:21:53,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2020-10-15 18:21:53,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1520. [2020-10-15 18:21:53,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1520 states. [2020-10-15 18:21:53,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 5114 transitions. [2020-10-15 18:21:53,412 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 5114 transitions. Word has length 16 [2020-10-15 18:21:53,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:53,413 INFO L481 AbstractCegarLoop]: Abstraction has 1520 states and 5114 transitions. [2020-10-15 18:21:53,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:21:53,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 5114 transitions. [2020-10-15 18:21:53,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 18:21:53,416 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:53,417 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:21:53,417 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 18:21:53,417 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-15 18:21:53,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:53,417 INFO L82 PathProgramCache]: Analyzing trace with hash -383258267, now seen corresponding path program 1 times [2020-10-15 18:21:53,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:53,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232641433] [2020-10-15 18:21:53,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:53,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:21:53,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232641433] [2020-10-15 18:21:53,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:53,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:21:53,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740774803] [2020-10-15 18:21:53,485 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:21:53,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:53,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:21:53,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:21:53,486 INFO L87 Difference]: Start difference. First operand 1520 states and 5114 transitions. Second operand 5 states. [2020-10-15 18:21:53,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:53,542 INFO L93 Difference]: Finished difference Result 1320 states and 4082 transitions. [2020-10-15 18:21:53,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:21:53,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-15 18:21:53,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:53,546 INFO L225 Difference]: With dead ends: 1320 [2020-10-15 18:21:53,546 INFO L226 Difference]: Without dead ends: 997 [2020-10-15 18:21:53,547 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:21:53,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2020-10-15 18:21:53,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2020-10-15 18:21:53,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2020-10-15 18:21:53,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 3022 transitions. [2020-10-15 18:21:53,571 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 3022 transitions. Word has length 17 [2020-10-15 18:21:53,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:53,572 INFO L481 AbstractCegarLoop]: Abstraction has 997 states and 3022 transitions. [2020-10-15 18:21:53,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:21:53,572 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 3022 transitions. [2020-10-15 18:21:53,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-15 18:21:53,574 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:53,574 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:21:53,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 18:21:53,575 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-15 18:21:53,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:53,575 INFO L82 PathProgramCache]: Analyzing trace with hash 709308523, now seen corresponding path program 1 times [2020-10-15 18:21:53,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:53,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318046297] [2020-10-15 18:21:53,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:53,611 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-15 18:21:53,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318046297] [2020-10-15 18:21:53,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:53,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 18:21:53,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175857068] [2020-10-15 18:21:53,612 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:21:53,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:53,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:21:53,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:21:53,613 INFO L87 Difference]: Start difference. First operand 997 states and 3022 transitions. Second operand 3 states. [2020-10-15 18:21:53,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:53,627 INFO L93 Difference]: Finished difference Result 1421 states and 4197 transitions. [2020-10-15 18:21:53,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:21:53,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-10-15 18:21:53,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:53,632 INFO L225 Difference]: With dead ends: 1421 [2020-10-15 18:21:53,632 INFO L226 Difference]: Without dead ends: 1011 [2020-10-15 18:21:53,632 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-15 18:21:53,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2020-10-15 18:21:53,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 991. [2020-10-15 18:21:53,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2020-10-15 18:21:53,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 2843 transitions. [2020-10-15 18:21:53,657 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 2843 transitions. Word has length 19 [2020-10-15 18:21:53,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:53,657 INFO L481 AbstractCegarLoop]: Abstraction has 991 states and 2843 transitions. [2020-10-15 18:21:53,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:21:53,657 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 2843 transitions. [2020-10-15 18:21:53,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-15 18:21:53,660 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:53,660 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:21:53,660 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-15 18:21:53,660 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-15 18:21:53,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:53,661 INFO L82 PathProgramCache]: Analyzing trace with hash 513726979, now seen corresponding path program 1 times [2020-10-15 18:21:53,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:53,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274090295] [2020-10-15 18:21:53,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:53,743 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-15 18:21:53,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274090295] [2020-10-15 18:21:53,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:53,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:21:53,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172622041] [2020-10-15 18:21:53,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:21:53,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:53,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:21:53,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:21:53,746 INFO L87 Difference]: Start difference. First operand 991 states and 2843 transitions. Second operand 6 states. [2020-10-15 18:21:53,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:53,812 INFO L93 Difference]: Finished difference Result 868 states and 2450 transitions. [2020-10-15 18:21:53,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:21:53,813 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-15 18:21:53,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:53,816 INFO L225 Difference]: With dead ends: 868 [2020-10-15 18:21:53,816 INFO L226 Difference]: Without dead ends: 761 [2020-10-15 18:21:53,816 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:21:53,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2020-10-15 18:21:53,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 745. [2020-10-15 18:21:53,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2020-10-15 18:21:53,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 2133 transitions. [2020-10-15 18:21:53,835 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 2133 transitions. Word has length 20 [2020-10-15 18:21:53,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:53,835 INFO L481 AbstractCegarLoop]: Abstraction has 745 states and 2133 transitions. [2020-10-15 18:21:53,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:21:53,836 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 2133 transitions. [2020-10-15 18:21:53,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-15 18:21:53,838 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:53,838 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] [2020-10-15 18:21:53,839 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-15 18:21:53,839 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-15 18:21:53,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:53,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1443499883, now seen corresponding path program 1 times [2020-10-15 18:21:53,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:53,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558494889] [2020-10-15 18:21:53,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:53,934 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-15 18:21:53,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558494889] [2020-10-15 18:21:53,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:53,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 18:21:53,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245648187] [2020-10-15 18:21:53,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 18:21:53,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:53,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 18:21:53,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-15 18:21:53,937 INFO L87 Difference]: Start difference. First operand 745 states and 2133 transitions. Second operand 9 states. [2020-10-15 18:21:54,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:54,062 INFO L93 Difference]: Finished difference Result 1033 states and 2849 transitions. [2020-10-15 18:21:54,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-15 18:21:54,063 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-15 18:21:54,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:54,066 INFO L225 Difference]: With dead ends: 1033 [2020-10-15 18:21:54,067 INFO L226 Difference]: Without dead ends: 745 [2020-10-15 18:21:54,067 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-10-15 18:21:54,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2020-10-15 18:21:54,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2020-10-15 18:21:54,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2020-10-15 18:21:54,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 2072 transitions. [2020-10-15 18:21:54,092 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 2072 transitions. Word has length 23 [2020-10-15 18:21:54,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:54,092 INFO L481 AbstractCegarLoop]: Abstraction has 745 states and 2072 transitions. [2020-10-15 18:21:54,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 18:21:54,093 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 2072 transitions. [2020-10-15 18:21:54,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-15 18:21:54,096 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:54,096 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] [2020-10-15 18:21:54,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-15 18:21:54,097 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-15 18:21:54,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:54,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1704617267, now seen corresponding path program 2 times [2020-10-15 18:21:54,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:54,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849692719] [2020-10-15 18:21:54,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:54,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:54,149 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-15 18:21:54,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849692719] [2020-10-15 18:21:54,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:54,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:21:54,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368030231] [2020-10-15 18:21:54,151 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:21:54,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:54,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:21:54,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:21:54,152 INFO L87 Difference]: Start difference. First operand 745 states and 2072 transitions. Second operand 4 states. [2020-10-15 18:21:54,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:54,175 INFO L93 Difference]: Finished difference Result 966 states and 2620 transitions. [2020-10-15 18:21:54,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 18:21:54,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-10-15 18:21:54,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:54,178 INFO L225 Difference]: With dead ends: 966 [2020-10-15 18:21:54,178 INFO L226 Difference]: Without dead ends: 628 [2020-10-15 18:21:54,178 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:21:54,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2020-10-15 18:21:54,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 625. [2020-10-15 18:21:54,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2020-10-15 18:21:54,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 1629 transitions. [2020-10-15 18:21:54,198 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 1629 transitions. Word has length 23 [2020-10-15 18:21:54,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:54,199 INFO L481 AbstractCegarLoop]: Abstraction has 625 states and 1629 transitions. [2020-10-15 18:21:54,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:21:54,199 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 1629 transitions. [2020-10-15 18:21:54,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-15 18:21:54,201 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:54,202 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] [2020-10-15 18:21:54,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-15 18:21:54,202 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-15 18:21:54,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:54,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1237726519, now seen corresponding path program 1 times [2020-10-15 18:21:54,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:54,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145139876] [2020-10-15 18:21:54,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:54,320 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-15 18:21:54,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145139876] [2020-10-15 18:21:54,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:54,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 18:21:54,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353427697] [2020-10-15 18:21:54,321 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 18:21:54,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:54,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 18:21:54,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-15 18:21:54,322 INFO L87 Difference]: Start difference. First operand 625 states and 1629 transitions. Second operand 9 states. [2020-10-15 18:21:54,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:54,471 INFO L93 Difference]: Finished difference Result 862 states and 2137 transitions. [2020-10-15 18:21:54,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-15 18:21:54,473 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-15 18:21:54,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:54,476 INFO L225 Difference]: With dead ends: 862 [2020-10-15 18:21:54,476 INFO L226 Difference]: Without dead ends: 706 [2020-10-15 18:21:54,476 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-10-15 18:21:54,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2020-10-15 18:21:54,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 650. [2020-10-15 18:21:54,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2020-10-15 18:21:54,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1635 transitions. [2020-10-15 18:21:54,495 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1635 transitions. Word has length 23 [2020-10-15 18:21:54,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:54,496 INFO L481 AbstractCegarLoop]: Abstraction has 650 states and 1635 transitions. [2020-10-15 18:21:54,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 18:21:54,496 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1635 transitions. [2020-10-15 18:21:54,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-15 18:21:54,499 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:54,499 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] [2020-10-15 18:21:54,499 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-15 18:21:54,499 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:21:54,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:54,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1601293001, now seen corresponding path program 2 times [2020-10-15 18:21:54,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:54,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103672712] [2020-10-15 18:21:54,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:54,702 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-15 18:21:54,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103672712] [2020-10-15 18:21:54,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:54,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 18:21:54,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063128945] [2020-10-15 18:21:54,704 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 18:21:54,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:54,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 18:21:54,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-15 18:21:54,706 INFO L87 Difference]: Start difference. First operand 650 states and 1635 transitions. Second operand 9 states. [2020-10-15 18:21:54,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:54,802 INFO L93 Difference]: Finished difference Result 831 states and 1986 transitions. [2020-10-15 18:21:54,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-15 18:21:54,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-15 18:21:54,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:54,806 INFO L225 Difference]: With dead ends: 831 [2020-10-15 18:21:54,806 INFO L226 Difference]: Without dead ends: 668 [2020-10-15 18:21:54,806 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-15 18:21:54,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2020-10-15 18:21:54,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 549. [2020-10-15 18:21:54,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2020-10-15 18:21:54,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1312 transitions. [2020-10-15 18:21:54,822 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1312 transitions. Word has length 23 [2020-10-15 18:21:54,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:54,823 INFO L481 AbstractCegarLoop]: Abstraction has 549 states and 1312 transitions. [2020-10-15 18:21:54,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 18:21:54,823 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1312 transitions. [2020-10-15 18:21:54,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-15 18:21:54,824 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:54,825 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] [2020-10-15 18:21:54,825 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-15 18:21:54,825 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:21:54,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:54,826 INFO L82 PathProgramCache]: Analyzing trace with hash 2036096425, now seen corresponding path program 1 times [2020-10-15 18:21:54,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:54,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107853457] [2020-10-15 18:21:54,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:54,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:55,095 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-15 18:21:55,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107853457] [2020-10-15 18:21:55,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:55,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:21:55,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308935032] [2020-10-15 18:21:55,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 18:21:55,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:55,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 18:21:55,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:21:55,097 INFO L87 Difference]: Start difference. First operand 549 states and 1312 transitions. Second operand 7 states. [2020-10-15 18:21:55,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:55,299 INFO L93 Difference]: Finished difference Result 653 states and 1528 transitions. [2020-10-15 18:21:55,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:21:55,299 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-15 18:21:55,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:55,301 INFO L225 Difference]: With dead ends: 653 [2020-10-15 18:21:55,301 INFO L226 Difference]: Without dead ends: 341 [2020-10-15 18:21:55,302 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-10-15 18:21:55,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-10-15 18:21:55,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 338. [2020-10-15 18:21:55,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2020-10-15 18:21:55,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 746 transitions. [2020-10-15 18:21:55,309 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 746 transitions. Word has length 23 [2020-10-15 18:21:55,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:55,310 INFO L481 AbstractCegarLoop]: Abstraction has 338 states and 746 transitions. [2020-10-15 18:21:55,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 18:21:55,310 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 746 transitions. [2020-10-15 18:21:55,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-15 18:21:55,311 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:55,311 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] [2020-10-15 18:21:55,311 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-15 18:21:55,311 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:21:55,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:55,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1350496215, now seen corresponding path program 2 times [2020-10-15 18:21:55,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:55,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24790429] [2020-10-15 18:21:55,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:55,394 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-15 18:21:55,394 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24790429] [2020-10-15 18:21:55,394 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:55,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 18:21:55,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504361602] [2020-10-15 18:21:55,395 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 18:21:55,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:55,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 18:21:55,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:21:55,396 INFO L87 Difference]: Start difference. First operand 338 states and 746 transitions. Second operand 7 states. [2020-10-15 18:21:55,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:55,465 INFO L93 Difference]: Finished difference Result 317 states and 704 transitions. [2020-10-15 18:21:55,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 18:21:55,465 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-15 18:21:55,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:55,466 INFO L225 Difference]: With dead ends: 317 [2020-10-15 18:21:55,467 INFO L226 Difference]: Without dead ends: 171 [2020-10-15 18:21:55,467 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:21:55,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-10-15 18:21:55,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2020-10-15 18:21:55,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-10-15 18:21:55,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 370 transitions. [2020-10-15 18:21:55,471 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 370 transitions. Word has length 23 [2020-10-15 18:21:55,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:55,472 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 370 transitions. [2020-10-15 18:21:55,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 18:21:55,472 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 370 transitions. [2020-10-15 18:21:55,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-15 18:21:55,472 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:55,473 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:21:55,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-15 18:21:55,473 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:21:55,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:55,473 INFO L82 PathProgramCache]: Analyzing trace with hash -2059432109, now seen corresponding path program 1 times [2020-10-15 18:21:55,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:55,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872175749] [2020-10-15 18:21:55,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:55,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:55,535 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-15 18:21:55,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872175749] [2020-10-15 18:21:55,535 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:55,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:21:55,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400994365] [2020-10-15 18:21:55,536 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:21:55,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:55,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:21:55,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:21:55,537 INFO L87 Difference]: Start difference. First operand 171 states and 370 transitions. Second operand 6 states. [2020-10-15 18:21:55,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:55,596 INFO L93 Difference]: Finished difference Result 243 states and 527 transitions. [2020-10-15 18:21:55,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:21:55,597 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-10-15 18:21:55,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:55,597 INFO L225 Difference]: With dead ends: 243 [2020-10-15 18:21:55,598 INFO L226 Difference]: Without dead ends: 132 [2020-10-15 18:21:55,598 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:21:55,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-10-15 18:21:55,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2020-10-15 18:21:55,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-10-15 18:21:55,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 280 transitions. [2020-10-15 18:21:55,603 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 280 transitions. Word has length 26 [2020-10-15 18:21:55,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:55,604 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 280 transitions. [2020-10-15 18:21:55,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:21:55,604 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 280 transitions. [2020-10-15 18:21:55,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-15 18:21:55,605 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:55,605 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:21:55,605 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-15 18:21:55,605 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:21:55,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:55,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1261190255, now seen corresponding path program 2 times [2020-10-15 18:21:55,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:55,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178809902] [2020-10-15 18:21:55,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:55,687 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-15 18:21:55,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178809902] [2020-10-15 18:21:55,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:55,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:21:55,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121302422] [2020-10-15 18:21:55,688 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:21:55,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:55,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:21:55,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:21:55,689 INFO L87 Difference]: Start difference. First operand 132 states and 280 transitions. Second operand 6 states. [2020-10-15 18:21:55,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:55,744 INFO L93 Difference]: Finished difference Result 136 states and 283 transitions. [2020-10-15 18:21:55,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:21:55,745 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-10-15 18:21:55,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:55,745 INFO L225 Difference]: With dead ends: 136 [2020-10-15 18:21:55,746 INFO L226 Difference]: Without dead ends: 64 [2020-10-15 18:21:55,746 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:21:55,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-10-15 18:21:55,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-10-15 18:21:55,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-15 18:21:55,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 122 transitions. [2020-10-15 18:21:55,748 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 122 transitions. Word has length 26 [2020-10-15 18:21:55,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:55,749 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 122 transitions. [2020-10-15 18:21:55,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:21:55,749 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 122 transitions. [2020-10-15 18:21:55,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-15 18:21:55,749 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:55,749 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:21:55,750 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-15 18:21:55,750 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:21:55,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:55,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1680604651, now seen corresponding path program 3 times [2020-10-15 18:21:55,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:55,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149102434] [2020-10-15 18:21:55,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 18:21:55,785 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 18:21:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 18:21:55,815 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 18:21:55,852 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-15 18:21:55,852 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-15 18:21:55,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-15 18:21:55,853 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-15 18:21:55,867 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L846-->L853: Formula: (let ((.cse7 (= 0 (mod ~z$r_buff1_thd0~0_In1361579734 256))) (.cse6 (= (mod ~z$w_buff1_used~0_In1361579734 256) 0)) (.cse9 (= (mod ~z$w_buff0_used~0_In1361579734 256) 0)) (.cse8 (= (mod ~z$r_buff0_thd0~0_In1361579734 256) 0))) (let ((.cse0 (or .cse9 .cse8)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse3 (or .cse7 .cse6)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1361579734 0)) (= ~z$r_buff1_thd0~0_Out1361579734 ~z$r_buff1_thd0~0_In1361579734) (or (and (= ~z$w_buff0_used~0_In1361579734 ~z$w_buff0_used~0_Out1361579734) .cse0) (and (= ~z$w_buff0_used~0_Out1361579734 0) .cse1 .cse2)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1361579734 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1361579734|) (or (and .cse0 (or (and (= ~z~0_In1361579734 ~z~0_Out1361579734) .cse3) (and .cse4 .cse5 (= ~z$w_buff1~0_In1361579734 ~z~0_Out1361579734)))) (and (= ~z~0_Out1361579734 ~z$w_buff0~0_In1361579734) .cse1 .cse2)) (= ~z$r_buff0_thd0~0_In1361579734 ~z$r_buff0_thd0~0_Out1361579734) (or (and (= ~z$w_buff1_used~0_In1361579734 ~z$w_buff1_used~0_Out1361579734) .cse3) (and .cse4 .cse5 (= ~z$w_buff1_used~0_Out1361579734 0)))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1361579734|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1361579734, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1361579734, ~z$w_buff0~0=~z$w_buff0~0_In1361579734, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1361579734, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1361579734, ~z$w_buff1~0=~z$w_buff1~0_In1361579734, ~z~0=~z~0_In1361579734} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out1361579734, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1361579734|, ~z$w_buff0~0=~z$w_buff0~0_In1361579734, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1361579734|, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1361579734, ~z$w_buff1~0=~z$w_buff1~0_In1361579734, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1361579734|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1361579734|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1361579734|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1361579734|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1361579734|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out1361579734, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1361579734, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1361579734, ~z~0=~z~0_Out1361579734} 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-15 18:21:55,873 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-15 18:21:55,874 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:55,876 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-15 18:21:55,876 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:55,876 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-15 18:21:55,877 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:55,877 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-15 18:21:55,877 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:55,877 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-15 18:21:55,877 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:55,877 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-15 18:21:55,877 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:55,878 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-15 18:21:55,878 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:55,878 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-15 18:21:55,878 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:55,879 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-15 18:21:55,879 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:55,879 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-15 18:21:55,879 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:55,879 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-15 18:21:55,879 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:55,880 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-15 18:21:55,880 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:55,880 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-15 18:21:55,880 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:55,881 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-15 18:21:55,881 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:55,881 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-15 18:21:55,881 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:55,881 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-15 18:21:55,881 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:55,882 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-15 18:21:55,882 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:55,882 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-15 18:21:55,882 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:55,882 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-15 18:21:55,882 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:55,883 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-15 18:21:55,883 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:55,883 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-15 18:21:55,883 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:55,883 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-15 18:21:55,883 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:55,884 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-15 18:21:55,884 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:55,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 06:21:55 BasicIcfg [2020-10-15 18:21:55,998 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 18:21:56,002 INFO L168 Benchmark]: Toolchain (without parser) took 19958.58 ms. Allocated memory was 252.7 MB in the beginning and 642.8 MB in the end (delta: 390.1 MB). Free memory was 207.4 MB in the beginning and 365.4 MB in the end (delta: -158.0 MB). Peak memory consumption was 232.1 MB. Max. memory is 14.2 GB. [2020-10-15 18:21:56,003 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 252.7 MB. Free memory is still 229.1 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-15 18:21:56,004 INFO L168 Benchmark]: CACSL2BoogieTranslator took 810.10 ms. Allocated memory was 252.7 MB in the beginning and 317.2 MB in the end (delta: 64.5 MB). Free memory was 207.4 MB in the beginning and 267.5 MB in the end (delta: -60.1 MB). Peak memory consumption was 33.0 MB. Max. memory is 14.2 GB. [2020-10-15 18:21:56,004 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.04 ms. Allocated memory is still 317.2 MB. Free memory was 267.5 MB in the beginning and 265.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 18:21:56,005 INFO L168 Benchmark]: Boogie Preprocessor took 45.98 ms. Allocated memory is still 317.2 MB. Free memory was 265.0 MB in the beginning and 262.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 18:21:56,005 INFO L168 Benchmark]: RCFGBuilder took 2099.39 ms. Allocated memory was 317.2 MB in the beginning and 360.7 MB in the end (delta: 43.5 MB). Free memory was 262.5 MB in the beginning and 207.8 MB in the end (delta: 54.7 MB). Peak memory consumption was 99.6 MB. Max. memory is 14.2 GB. [2020-10-15 18:21:56,006 INFO L168 Benchmark]: TraceAbstraction took 16924.58 ms. Allocated memory was 360.7 MB in the beginning and 642.8 MB in the end (delta: 282.1 MB). Free memory was 207.8 MB in the beginning and 365.4 MB in the end (delta: -157.6 MB). Peak memory consumption was 124.4 MB. Max. memory is 14.2 GB. [2020-10-15 18:21:56,009 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.24 ms. Allocated memory is still 252.7 MB. Free memory is still 229.1 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 810.10 ms. Allocated memory was 252.7 MB in the beginning and 317.2 MB in the end (delta: 64.5 MB). Free memory was 207.4 MB in the beginning and 267.5 MB in the end (delta: -60.1 MB). Peak memory consumption was 33.0 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 73.04 ms. Allocated memory is still 317.2 MB. Free memory was 267.5 MB in the beginning and 265.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 45.98 ms. Allocated memory is still 317.2 MB. Free memory was 265.0 MB in the beginning and 262.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2099.39 ms. Allocated memory was 317.2 MB in the beginning and 360.7 MB in the end (delta: 43.5 MB). Free memory was 262.5 MB in the beginning and 207.8 MB in the end (delta: 54.7 MB). Peak memory consumption was 99.6 MB. Max. memory is 14.2 GB. * TraceAbstraction took 16924.58 ms. Allocated memory was 360.7 MB in the beginning and 642.8 MB in the end (delta: 282.1 MB). Free memory was 207.8 MB in the beginning and 365.4 MB in the end (delta: -157.6 MB). Peak memory consumption was 124.4 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1746 VarBasedMoverChecksPositive, 95 VarBasedMoverChecksNegative, 31 SemBasedMoverChecksPositive, 64 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.2s, 233 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 11.0s, 123 PlacesBefore, 45 PlacesAfterwards, 112 TransitionsBefore, 33 TransitionsAfterwards, 2540 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 93 TotalNumberOfCompositions, 6932 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_p0_EAX = 0; [L703] 0 int __unbuffered_p3_EAX = 0; [L705] 0 int __unbuffered_p3_EBX = 0; [L707] 0 int a = 0; [L709] 0 int b = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff0_thd4; [L725] 0 _Bool z$r_buff1_thd0; [L726] 0 _Bool z$r_buff1_thd1; [L727] 0 _Bool z$r_buff1_thd2; [L728] 0 _Bool z$r_buff1_thd3; [L729] 0 _Bool z$r_buff1_thd4; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L835] 0 pthread_t t1221; [L836] FCALL, FORK 0 pthread_create(&t1221, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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] [L837] 0 pthread_t t1222; [L838] FCALL, FORK 0 pthread_create(&t1222, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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] [L839] 0 pthread_t t1223; [L840] FCALL, FORK 0 pthread_create(&t1223, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L841] 0 pthread_t t1224; [L842] FCALL, FORK 0 pthread_create(&t1224, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L791] 4 z$w_buff1 = z$w_buff0 [L792] 4 z$w_buff0 = 2 [L793] 4 z$w_buff1_used = z$w_buff0_used [L794] 4 z$w_buff0_used = (_Bool)1 [L7] COND FALSE 4 !(!expression) [L796] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L797] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L798] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L799] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L800] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L801] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L804] 4 a = 1 [L807] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L810] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L741] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L744] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L756] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L759] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L764] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 2 return 0; [L771] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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] [L774] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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] [L777] 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) [L777] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L777] 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) [L777] 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) [L778] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L778] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L779] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L779] 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 [L780] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L780] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L781] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L781] 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 [L784] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 3 return 0; [L813] 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) [L813] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L813] 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) [L813] 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) [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] 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 [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L817] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L817] 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 [L820] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 4 return 0; [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L855] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L856] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L857] 0 z$flush_delayed = weak$$choice2 [L858] 0 z$mem_tmp = z [L859] 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) [L859] 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) [L860] 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)) [L860] 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)) [L861] 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)) [L861] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L861] 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)) [L861] 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)) [L862] 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)) [L862] 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)) [L863] 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)) [L863] 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)) [L864] 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)) [L864] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L864] 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)) [L864] 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)) [L865] 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)) [L865] 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)) [L866] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L867] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L867] 0 z = z$flush_delayed ? z$mem_tmp : z [L868] 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_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, 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, 111 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.6s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.3s, HoareTripleCheckerStatistics: 640 SDtfs, 917 SDslu, 1382 SDs, 0 SdLazy, 602 SolverSat, 169 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3002occurred 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, 19 MinimizatonAttempts, 441 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 380 NumberOfCodeBlocks, 380 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 335 ConstructedInterpolants, 0 QuantifiedInterpolants, 40289 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...