/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe027_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 11:21:12,281 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 11:21:12,284 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 11:21:12,326 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 11:21:12,327 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 11:21:12,335 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 11:21:12,338 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 11:21:12,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 11:21:12,345 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 11:21:12,348 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 11:21:12,349 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 11:21:12,350 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 11:21:12,350 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 11:21:12,353 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 11:21:12,355 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 11:21:12,357 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 11:21:12,359 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 11:21:12,360 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 11:21:12,361 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 11:21:12,369 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 11:21:12,372 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 11:21:12,372 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 11:21:12,373 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 11:21:12,374 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 11:21:12,386 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 11:21:12,390 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 11:21:12,390 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 11:21:12,391 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 11:21:12,392 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 11:21:12,396 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 11:21:12,396 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 11:21:12,397 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 11:21:12,397 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 11:21:12,398 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 11:21:12,399 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 11:21:12,399 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 11:21:12,400 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 11:21:12,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 11:21:12,400 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 11:21:12,403 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 11:21:12,404 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 11:21:12,405 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-16 11:21:12,427 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 11:21:12,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 11:21:12,428 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 11:21:12,428 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 11:21:12,428 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 11:21:12,429 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 11:21:12,429 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 11:21:12,429 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 11:21:12,429 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 11:21:12,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 11:21:12,430 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 11:21:12,430 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 11:21:12,430 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 11:21:12,430 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 11:21:12,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 11:21:12,431 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 11:21:12,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 11:21:12,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 11:21:12,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 11:21:12,431 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 11:21:12,431 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 11:21:12,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 11:21:12,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 11:21:12,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 11:21:12,432 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 11:21:12,432 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 11:21:12,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 11:21:12,433 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 11:21:12,433 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-16 11:21:12,433 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 11:21:12,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 11:21:12,764 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 11:21:12,769 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 11:21:12,770 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 11:21:12,771 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 11:21:12,772 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe027_power.opt.i [2020-10-16 11:21:12,829 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/674391c0d/484919d11e254e9ca2793fa20a8598e8/FLAG2c58f584a [2020-10-16 11:21:13,466 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 11:21:13,466 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe027_power.opt.i [2020-10-16 11:21:13,483 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/674391c0d/484919d11e254e9ca2793fa20a8598e8/FLAG2c58f584a [2020-10-16 11:21:13,722 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/674391c0d/484919d11e254e9ca2793fa20a8598e8 [2020-10-16 11:21:13,730 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 11:21:13,732 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 11:21:13,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 11:21:13,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 11:21:13,737 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 11:21:13,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:21:13" (1/1) ... [2020-10-16 11:21:13,741 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4007d872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:21:13, skipping insertion in model container [2020-10-16 11:21:13,741 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:21:13" (1/1) ... [2020-10-16 11:21:13,751 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 11:21:13,812 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 11:21:14,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 11:21:14,321 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 11:21:14,409 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 11:21:14,487 INFO L208 MainTranslator]: Completed translation [2020-10-16 11:21:14,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:21:14 WrapperNode [2020-10-16 11:21:14,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 11:21:14,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 11:21:14,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 11:21:14,489 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 11:21:14,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:21:14" (1/1) ... [2020-10-16 11:21:14,525 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:21:14" (1/1) ... [2020-10-16 11:21:14,567 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 11:21:14,568 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 11:21:14,568 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 11:21:14,568 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 11:21:14,579 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:21:14" (1/1) ... [2020-10-16 11:21:14,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:21:14" (1/1) ... [2020-10-16 11:21:14,585 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:21:14" (1/1) ... [2020-10-16 11:21:14,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:21:14" (1/1) ... [2020-10-16 11:21:14,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:21:14" (1/1) ... [2020-10-16 11:21:14,619 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:21:14" (1/1) ... [2020-10-16 11:21:14,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:21:14" (1/1) ... [2020-10-16 11:21:14,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 11:21:14,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 11:21:14,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 11:21:14,633 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 11:21:14,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:21:14" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 11:21:14,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-16 11:21:14,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 11:21:14,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 11:21:14,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 11:21:14,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 11:21:14,736 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 11:21:14,736 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 11:21:14,737 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 11:21:14,737 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 11:21:14,738 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 11:21:14,738 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 11:21:14,739 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 11:21:14,739 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 11:21:14,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-16 11:21:14,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 11:21:14,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 11:21:14,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 11:21:14,743 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 11:21:18,846 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 11:21:18,847 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 11:21:18,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:21:18 BoogieIcfgContainer [2020-10-16 11:21:18,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 11:21:18,852 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 11:21:18,852 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 11:21:18,856 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 11:21:18,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:21:13" (1/3) ... [2020-10-16 11:21:18,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6217a7fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:21:18, skipping insertion in model container [2020-10-16 11:21:18,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:21:14" (2/3) ... [2020-10-16 11:21:18,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6217a7fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:21:18, skipping insertion in model container [2020-10-16 11:21:18,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:21:18" (3/3) ... [2020-10-16 11:21:18,861 INFO L111 eAbstractionObserver]: Analyzing ICFG safe027_power.opt.i [2020-10-16 11:21:18,879 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 11:21:18,880 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 11:21:18,892 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 11:21:18,894 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 11:21:18,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,951 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,951 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,957 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,957 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,957 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,957 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,958 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,958 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,958 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,958 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,961 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,961 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,961 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,961 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,962 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,962 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,962 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,967 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,967 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,967 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,968 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,968 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,968 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,969 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,969 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,969 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,969 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,969 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,970 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,970 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,970 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,971 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,971 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,972 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,973 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,974 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,974 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,974 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,974 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,975 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,975 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,975 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,975 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,975 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,976 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,976 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,976 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,976 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,977 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,977 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,977 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,977 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,979 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,979 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,979 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,979 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,979 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,980 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,980 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,980 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,980 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,980 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,980 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,981 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,981 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,981 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,981 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,981 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,982 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,982 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,982 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,982 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:18,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite89| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite88| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite87| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite90| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite91| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,003 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,003 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,003 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,004 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,004 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~mem92| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,004 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite93| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,004 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~mem92| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,005 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite97| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,005 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite98| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,005 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite93| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,005 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite94| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,005 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite95| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,006 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite96| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,007 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,007 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,011 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite97| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,012 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite98| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,012 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~mem92| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,012 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,013 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,013 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,013 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite95| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,014 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite96| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,014 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite93| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,014 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,015 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite94| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,022 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,023 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,023 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,023 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,024 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,024 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,024 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,024 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,025 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,027 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,027 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,027 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,032 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,033 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,033 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,033 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,033 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,033 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,034 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,034 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite89| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite87| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,039 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,039 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,039 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite91| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,046 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite88| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,046 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,046 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,047 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,047 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,047 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,047 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,048 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,048 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,048 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,048 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite90| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,051 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,051 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,051 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,051 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,052 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,052 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,052 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:19,054 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 11:21:19,069 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 11:21:19,094 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 11:21:19,095 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 11:21:19,095 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 11:21:19,095 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 11:21:19,095 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 11:21:19,095 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 11:21:19,096 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 11:21:19,096 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 11:21:19,112 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 11:21:19,115 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 127 transitions, 274 flow [2020-10-16 11:21:19,117 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 127 transitions, 274 flow [2020-10-16 11:21:19,119 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 274 flow [2020-10-16 11:21:19,181 INFO L129 PetriNetUnfolder]: 2/123 cut-off events. [2020-10-16 11:21:19,181 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 11:21:19,188 INFO L80 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2020-10-16 11:21:19,192 INFO L117 LiptonReduction]: Number of co-enabled transitions 2274 [2020-10-16 11:21:19,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:19,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:19,333 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:19,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:19,359 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:19,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:19,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:19,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:19,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:19,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:19,460 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:19,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:19,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:19,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:19,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:19,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:19,594 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:19,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:19,596 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:19,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:19,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:19,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:19,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:19,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:19,729 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:19,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:19,753 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:19,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:19,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 5, 4, 5, 4, 2, 1] term [2020-10-16 11:21:19,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:19,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 4, 5, 4, 2, 1] term [2020-10-16 11:21:19,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:19,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 5, 4, 2, 1] term [2020-10-16 11:21:19,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:19,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-16 11:21:19,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:19,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 11:21:19,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:19,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 11:21:19,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:19,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 11:21:19,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:19,952 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 11:21:19,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:19,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 12, 2, 11, 2, 10, 4, 8, 4, 3, 1] term [2020-10-16 11:21:19,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:19,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-16 11:21:19,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:19,967 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 5, 4, 5, 4, 3, 2, 2, 2, 2, 1] term [2020-10-16 11:21:19,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:19,968 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-16 11:21:19,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:19,971 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 5, 4, 3, 2, 2, 2, 2, 1] term [2020-10-16 11:21:19,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:19,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 2, 2, 2, 1] term [2020-10-16 11:21:19,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:19,974 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 2, 2, 1] term [2020-10-16 11:21:19,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:19,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-16 11:21:19,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:19,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 2, 2, 2, 1] term [2020-10-16 11:21:19,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:19,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 2, 2, 1] term [2020-10-16 11:21:19,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:19,983 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 2, 2, 1] term [2020-10-16 11:21:19,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:20,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:20,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:20,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:20,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:20,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:20,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:20,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:20,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:21:20,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:20,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:20,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 1] term [2020-10-16 11:21:20,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:20,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-16 11:21:20,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:20,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:20,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:20,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:20,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:20,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:20,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:21:20,107 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:20,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:24,696 WARN L193 SmtUtils]: Spent 4.41 s on a formula simplification. DAG size of input: 406 DAG size of output: 364 [2020-10-16 11:21:24,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:24,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:24,741 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 5, 2, 4, 2, 4, 4, 3, 2, 1] term [2020-10-16 11:21:24,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:24,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 2, 2, 3, 4, 3, 2, 1] term [2020-10-16 11:21:24,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:24,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 4, 3, 2, 1] term [2020-10-16 11:21:24,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:24,744 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 4, 3, 2, 1] term [2020-10-16 11:21:24,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:24,745 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:24,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,955 WARN L193 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 198 DAG size of output: 174 [2020-10-16 11:21:27,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:27,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:27,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:27,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:27,211 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:27,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:27,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:27,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:27,547 WARN L193 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2020-10-16 11:21:27,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:27,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:27,554 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:27,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:27,679 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-16 11:21:27,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:27,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:27,693 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:27,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:27,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:27,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:27,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:27,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:27,927 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 3, 2, 2, 2, 1] term [2020-10-16 11:21:27,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:27,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 3, 3, 2, 2, 2, 1] term [2020-10-16 11:21:27,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:27,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 2, 2, 2, 1] term [2020-10-16 11:21:27,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:27,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 11:21:27,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:27,933 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 11:21:27,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:27,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 11:21:27,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:27,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 11:21:27,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:27,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 11:21:27,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:27,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 1] term [2020-10-16 11:21:27,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:27,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-16 11:21:27,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:27,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:27,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:28,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:28,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:28,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:28,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:28,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:28,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:28,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:28,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:28,358 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:28,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:28,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:28,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:28,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:28,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:28,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:21:28,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:28,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-16 11:21:28,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:28,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-16 11:21:28,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:28,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:28,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:28,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:28,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:28,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:28,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:28,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:28,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:28,734 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-16 11:21:28,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:28,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:21:28,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:28,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:28,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:28,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:28,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:28,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:21:28,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:21:28,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:21:28,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:21:28,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:21:28,751 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 5, 3, 4, 3, 5, 2, 5, 2, 1] term [2020-10-16 11:21:28,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:21:28,756 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:21:28,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:28,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:28,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:28,798 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:21:28,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:21:28,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:28,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:21:28,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:21:28,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:21:28,803 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:21:28,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:28,805 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:28,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:28,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:28,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:29,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:29,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:29,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,113 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:29,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:29,115 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:29,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:29,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,150 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:29,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:29,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:29,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:21:29,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:29,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:21:29,257 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:29,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:29,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,269 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:29,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,271 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:29,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,635 WARN L193 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2020-10-16 11:21:29,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:29,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,726 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:29,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:29,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:29,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,867 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:29,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:29,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,879 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:29,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:29,880 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:29,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:30,159 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:30,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:30,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:30,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:30,189 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:30,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:30,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:30,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:30,207 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 2, 3, 3, 2, 2, 2, 1] term [2020-10-16 11:21:30,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:30,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 3, 3, 2, 2, 2, 1] term [2020-10-16 11:21:30,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:30,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 2, 2, 2, 1] term [2020-10-16 11:21:30,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:30,211 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 11:21:30,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:30,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 11:21:30,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:30,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 11:21:30,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:30,269 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 11:21:30,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:30,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 11:21:30,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:30,289 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 2, 2, 2, 1] term [2020-10-16 11:21:30,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:30,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 2, 1] term [2020-10-16 11:21:30,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:30,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:30,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:30,407 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:30,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:30,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:30,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:30,460 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:30,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:30,473 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:30,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:30,475 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:30,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:30,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:30,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:30,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:30,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:30,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:30,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:30,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:30,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:30,991 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2020-10-16 11:21:31,003 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:31,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:31,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:31,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:31,007 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:31,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:21:31,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:31,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:21:31,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:31,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:31,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:31,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:31,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:31,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:31,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:31,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:31,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:31,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:31,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:31,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:31,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:31,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:31,066 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:31,067 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:31,067 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:31,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:31,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:31,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:31,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:31,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:31,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:31,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:31,175 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:31,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:31,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:31,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:31,189 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:31,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:31,504 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:31,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:31,505 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:31,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:31,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:31,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:31,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:31,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:31,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:31,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:31,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:31,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:31,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:31,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:31,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:31,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:31,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 2, 3, 3, 2, 2, 2, 1] term [2020-10-16 11:21:31,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:31,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 3, 3, 2, 2, 2, 1] term [2020-10-16 11:21:31,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:31,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 2, 2, 2, 1] term [2020-10-16 11:21:31,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:31,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 11:21:31,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:31,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 11:21:31,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:31,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 11:21:31,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:31,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 11:21:31,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:31,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 11:21:31,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:31,600 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 2, 2, 2, 1] term [2020-10-16 11:21:31,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:31,601 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 2, 1] term [2020-10-16 11:21:31,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:31,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:31,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:31,686 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:31,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:31,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:31,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:31,744 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:31,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:31,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:31,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:31,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:31,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:31,966 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-16 11:21:32,068 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:32,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,069 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:32,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:32,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:32,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,120 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:32,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:32,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,140 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:32,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:32,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,170 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:32,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:32,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:32,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,187 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:32,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:32,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,218 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:32,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:32,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,233 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:32,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:32,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,301 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:32,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,334 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:32,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:32,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,345 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:32,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:32,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:32,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,374 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:32,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:32,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:32,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:32,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,516 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:32,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:32,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:32,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:32,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:32,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:21:32,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:21:32,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:32,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:21:32,531 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:21:32,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:21:32,533 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:21:32,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:32,535 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:32,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:32,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:32,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:32,554 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:32,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:32,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 11:21:32,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:21:32,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:32,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:32,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:32,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:32,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:32,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,658 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:32,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:32,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,661 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:21:32,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:21:32,662 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:32,663 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:21:32,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:21:32,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:21:32,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:21:32,666 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:32,667 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:32,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:32,668 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:32,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:32,706 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:32,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 11:21:32,709 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:21:32,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:32,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:32,712 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-16 11:21:32,776 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:21:32,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:32,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:21:32,781 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 5, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:32,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-10-16 11:21:32,783 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 5, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:32,784 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-10-16 11:21:32,785 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 5, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:32,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-10-16 11:21:32,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[13, 2, 6, 3, 5, 3, 3, 2, 3, 3, 3, 2, 1] term [2020-10-16 11:21:32,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 8, 3, 9, 3, 5, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:32,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,791 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 8, 3, 9, 3, 5, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:32,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 3, 8, 3, 9, 3, 5, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:32,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,794 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 8, 3, 9, 3, 5, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:32,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 8, 3, 9, 3, 5, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:32,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,798 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 8, 3, 9, 3, 5, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:32,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 2, 2, 4, 3, 3, 3, 3, 3, 3, 2, 1] term [2020-10-16 11:21:32,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:21:32,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 3, 3, 3, 3, 2, 1] term [2020-10-16 11:21:32,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:21:32,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 3, 3, 3, 3, 3, 2, 1] term [2020-10-16 11:21:32,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:21:32,842 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 2, 5, 3, 3, 3, 3, 3, 3, 2, 1] term [2020-10-16 11:21:32,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 3, 3, 3, 2, 1] term [2020-10-16 11:21:32,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 3, 3, 3, 2, 1] term [2020-10-16 11:21:32,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:32,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:32,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:32,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:32,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:32,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 11:21:32,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:21:32,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:33,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:33,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:33,025 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:33,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:33,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:33,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:33,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:33,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:33,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:33,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:33,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:33,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:33,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:21:33,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:21:33,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:33,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:21:33,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:21:33,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:21:33,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:21:33,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:33,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:33,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:33,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:33,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:33,248 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-10-16 11:21:33,423 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-10-16 11:21:33,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:33,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:33,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:33,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 11:21:33,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:21:33,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:33,481 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:33,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:33,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:33,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:33,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:33,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:33,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:33,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:33,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:33,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:33,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:33,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:33,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:21:33,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:21:33,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:33,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:21:33,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:21:33,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:21:33,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:21:33,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:33,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:33,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:33,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:33,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:33,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:33,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 11:21:33,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:21:33,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:33,561 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:33,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:33,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:33,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:33,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:33,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:33,605 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:33,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:33,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:33,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:33,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:33,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:33,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:33,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:33,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:21:33,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:21:33,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:33,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:21:33,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:21:33,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:21:33,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:21:33,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:33,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:33,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:33,617 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:33,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:33,662 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:33,663 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:33,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:33,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:33,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:33,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:33,701 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:33,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:33,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:33,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:33,876 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:33,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:33,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:33,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:33,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:33,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:33,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:33,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:33,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:33,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:33,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:33,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:33,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:33,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:33,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:21:33,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:21:33,952 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:33,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:21:33,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:21:33,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:21:33,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:21:33,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:33,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:33,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:33,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:33,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:34,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:34,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 11:21:34,021 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:21:34,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:34,025 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:34,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:34,666 WARN L193 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 121 [2020-10-16 11:21:34,969 WARN L193 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2020-10-16 11:21:35,715 WARN L193 SmtUtils]: Spent 736.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 144 [2020-10-16 11:21:35,983 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-10-16 11:21:35,995 INFO L132 LiptonReduction]: Checked pairs total: 6559 [2020-10-16 11:21:35,995 INFO L134 LiptonReduction]: Total number of compositions: 108 [2020-10-16 11:21:36,002 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 30 transitions, 80 flow [2020-10-16 11:21:36,134 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2250 states. [2020-10-16 11:21:36,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states. [2020-10-16 11:21:36,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-16 11:21:36,143 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:36,144 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 11:21:36,144 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:36,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:36,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1763046774, now seen corresponding path program 1 times [2020-10-16 11:21:36,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:36,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772869437] [2020-10-16 11:21:36,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:21:36,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:21:36,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772869437] [2020-10-16 11:21:36,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:21:36,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 11:21:36,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748740856] [2020-10-16 11:21:36,523 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:21:36,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:21:36,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:21:36,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:21:36,544 INFO L87 Difference]: Start difference. First operand 2250 states. Second operand 3 states. [2020-10-16 11:21:36,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:21:36,719 INFO L93 Difference]: Finished difference Result 1802 states and 6784 transitions. [2020-10-16 11:21:36,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:21:36,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-16 11:21:36,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:21:36,758 INFO L225 Difference]: With dead ends: 1802 [2020-10-16 11:21:36,758 INFO L226 Difference]: Without dead ends: 1482 [2020-10-16 11:21:36,760 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:21:36,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2020-10-16 11:21:36,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2020-10-16 11:21:36,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1482 states. [2020-10-16 11:21:36,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 5488 transitions. [2020-10-16 11:21:36,925 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 5488 transitions. Word has length 5 [2020-10-16 11:21:36,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:21:36,925 INFO L481 AbstractCegarLoop]: Abstraction has 1482 states and 5488 transitions. [2020-10-16 11:21:36,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:21:36,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 5488 transitions. [2020-10-16 11:21:36,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 11:21:36,930 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:36,931 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:21:36,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 11:21:36,931 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:36,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:36,931 INFO L82 PathProgramCache]: Analyzing trace with hash 813589980, now seen corresponding path program 1 times [2020-10-16 11:21:36,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:36,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631016324] [2020-10-16 11:21:36,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:21:37,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:21:37,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631016324] [2020-10-16 11:21:37,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:21:37,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 11:21:37,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477860478] [2020-10-16 11:21:37,080 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:21:37,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:21:37,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:21:37,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:21:37,081 INFO L87 Difference]: Start difference. First operand 1482 states and 5488 transitions. Second operand 3 states. [2020-10-16 11:21:37,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:21:37,103 INFO L93 Difference]: Finished difference Result 1402 states and 5144 transitions. [2020-10-16 11:21:37,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:21:37,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-16 11:21:37,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:21:37,117 INFO L225 Difference]: With dead ends: 1402 [2020-10-16 11:21:37,117 INFO L226 Difference]: Without dead ends: 1402 [2020-10-16 11:21:37,118 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:21:37,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-10-16 11:21:37,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1402. [2020-10-16 11:21:37,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1402 states. [2020-10-16 11:21:37,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 5144 transitions. [2020-10-16 11:21:37,193 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 5144 transitions. Word has length 11 [2020-10-16 11:21:37,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:21:37,195 INFO L481 AbstractCegarLoop]: Abstraction has 1402 states and 5144 transitions. [2020-10-16 11:21:37,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:21:37,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 5144 transitions. [2020-10-16 11:21:37,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 11:21:37,202 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:37,202 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:21:37,203 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 11:21:37,203 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:37,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:37,203 INFO L82 PathProgramCache]: Analyzing trace with hash -58441524, now seen corresponding path program 1 times [2020-10-16 11:21:37,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:37,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300898640] [2020-10-16 11:21:37,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:37,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:21:37,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:21:37,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300898640] [2020-10-16 11:21:37,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:21:37,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 11:21:37,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161542111] [2020-10-16 11:21:37,329 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:21:37,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:21:37,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:21:37,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:21:37,330 INFO L87 Difference]: Start difference. First operand 1402 states and 5144 transitions. Second operand 4 states. [2020-10-16 11:21:37,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:21:37,393 INFO L93 Difference]: Finished difference Result 1882 states and 6808 transitions. [2020-10-16 11:21:37,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 11:21:37,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-16 11:21:37,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:21:37,405 INFO L225 Difference]: With dead ends: 1882 [2020-10-16 11:21:37,405 INFO L226 Difference]: Without dead ends: 1012 [2020-10-16 11:21:37,406 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:21:37,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2020-10-16 11:21:37,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1012. [2020-10-16 11:21:37,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2020-10-16 11:21:37,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 3628 transitions. [2020-10-16 11:21:37,442 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 3628 transitions. Word has length 12 [2020-10-16 11:21:37,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:21:37,442 INFO L481 AbstractCegarLoop]: Abstraction has 1012 states and 3628 transitions. [2020-10-16 11:21:37,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:21:37,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 3628 transitions. [2020-10-16 11:21:37,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 11:21:37,444 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:37,444 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:21:37,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 11:21:37,444 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:37,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:37,445 INFO L82 PathProgramCache]: Analyzing trace with hash 175926953, now seen corresponding path program 1 times [2020-10-16 11:21:37,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:37,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933664090] [2020-10-16 11:21:37,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:21:37,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:21:37,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933664090] [2020-10-16 11:21:37,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:21:37,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 11:21:37,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884944363] [2020-10-16 11:21:37,553 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:21:37,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:21:37,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:21:37,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:21:37,556 INFO L87 Difference]: Start difference. First operand 1012 states and 3628 transitions. Second operand 3 states. [2020-10-16 11:21:37,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:21:37,578 INFO L93 Difference]: Finished difference Result 976 states and 3481 transitions. [2020-10-16 11:21:37,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:21:37,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-16 11:21:37,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:21:37,587 INFO L225 Difference]: With dead ends: 976 [2020-10-16 11:21:37,587 INFO L226 Difference]: Without dead ends: 976 [2020-10-16 11:21:37,587 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:21:37,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2020-10-16 11:21:37,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2020-10-16 11:21:37,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2020-10-16 11:21:37,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 3481 transitions. [2020-10-16 11:21:37,622 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 3481 transitions. Word has length 13 [2020-10-16 11:21:37,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:21:37,622 INFO L481 AbstractCegarLoop]: Abstraction has 976 states and 3481 transitions. [2020-10-16 11:21:37,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:21:37,622 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 3481 transitions. [2020-10-16 11:21:37,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 11:21:37,624 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:37,624 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:21:37,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 11:21:37,624 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:37,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:37,624 INFO L82 PathProgramCache]: Analyzing trace with hash 842231876, now seen corresponding path program 1 times [2020-10-16 11:21:37,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:37,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601816770] [2020-10-16 11:21:37,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:21:38,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:21:38,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601816770] [2020-10-16 11:21:38,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:21:38,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 11:21:38,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672367782] [2020-10-16 11:21:38,046 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 11:21:38,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:21:38,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 11:21:38,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:21:38,047 INFO L87 Difference]: Start difference. First operand 976 states and 3481 transitions. Second operand 7 states. [2020-10-16 11:21:38,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:21:38,353 INFO L93 Difference]: Finished difference Result 1116 states and 4053 transitions. [2020-10-16 11:21:38,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:21:38,354 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-10-16 11:21:38,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:21:38,363 INFO L225 Difference]: With dead ends: 1116 [2020-10-16 11:21:38,363 INFO L226 Difference]: Without dead ends: 1116 [2020-10-16 11:21:38,364 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:21:38,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2020-10-16 11:21:38,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 996. [2020-10-16 11:21:38,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 996 states. [2020-10-16 11:21:38,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 3553 transitions. [2020-10-16 11:21:38,401 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 3553 transitions. Word has length 14 [2020-10-16 11:21:38,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:21:38,402 INFO L481 AbstractCegarLoop]: Abstraction has 996 states and 3553 transitions. [2020-10-16 11:21:38,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 11:21:38,402 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 3553 transitions. [2020-10-16 11:21:38,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 11:21:38,404 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:38,404 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:21:38,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 11:21:38,404 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:38,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:38,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1158601730, now seen corresponding path program 2 times [2020-10-16 11:21:38,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:38,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300926800] [2020-10-16 11:21:38,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:38,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:21:38,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:21:38,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300926800] [2020-10-16 11:21:38,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:21:38,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 11:21:38,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26568984] [2020-10-16 11:21:38,856 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 11:21:38,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:21:38,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 11:21:38,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:21:38,857 INFO L87 Difference]: Start difference. First operand 996 states and 3553 transitions. Second operand 8 states. [2020-10-16 11:21:39,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:21:39,171 INFO L93 Difference]: Finished difference Result 1150 states and 4171 transitions. [2020-10-16 11:21:39,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:21:39,172 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-10-16 11:21:39,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:21:39,182 INFO L225 Difference]: With dead ends: 1150 [2020-10-16 11:21:39,182 INFO L226 Difference]: Without dead ends: 1150 [2020-10-16 11:21:39,182 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-10-16 11:21:39,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2020-10-16 11:21:39,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1026. [2020-10-16 11:21:39,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2020-10-16 11:21:39,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 3647 transitions. [2020-10-16 11:21:39,220 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 3647 transitions. Word has length 14 [2020-10-16 11:21:39,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:21:39,221 INFO L481 AbstractCegarLoop]: Abstraction has 1026 states and 3647 transitions. [2020-10-16 11:21:39,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 11:21:39,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 3647 transitions. [2020-10-16 11:21:39,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 11:21:39,223 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:39,223 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:21:39,223 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 11:21:39,224 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:39,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:39,224 INFO L82 PathProgramCache]: Analyzing trace with hash -135037929, now seen corresponding path program 1 times [2020-10-16 11:21:39,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:39,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225573590] [2020-10-16 11:21:39,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:21:39,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:21:39,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225573590] [2020-10-16 11:21:39,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:21:39,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:21:39,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653051661] [2020-10-16 11:21:39,292 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:21:39,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:21:39,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:21:39,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:21:39,293 INFO L87 Difference]: Start difference. First operand 1026 states and 3647 transitions. Second operand 4 states. [2020-10-16 11:21:39,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:21:39,339 INFO L93 Difference]: Finished difference Result 1052 states and 3386 transitions. [2020-10-16 11:21:39,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:21:39,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-16 11:21:39,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:21:39,347 INFO L225 Difference]: With dead ends: 1052 [2020-10-16 11:21:39,347 INFO L226 Difference]: Without dead ends: 792 [2020-10-16 11:21:39,347 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:21:39,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2020-10-16 11:21:39,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 792. [2020-10-16 11:21:39,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-10-16 11:21:39,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 2539 transitions. [2020-10-16 11:21:39,370 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 2539 transitions. Word has length 15 [2020-10-16 11:21:39,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:21:39,371 INFO L481 AbstractCegarLoop]: Abstraction has 792 states and 2539 transitions. [2020-10-16 11:21:39,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:21:39,371 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 2539 transitions. [2020-10-16 11:21:39,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 11:21:39,372 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:39,372 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:21:39,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 11:21:39,373 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:39,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:39,373 INFO L82 PathProgramCache]: Analyzing trace with hash -406628143, now seen corresponding path program 1 times [2020-10-16 11:21:39,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:39,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425025848] [2020-10-16 11:21:39,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:21:39,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:21:39,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425025848] [2020-10-16 11:21:39,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:21:39,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 11:21:39,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231048094] [2020-10-16 11:21:39,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 11:21:39,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:21:39,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 11:21:39,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:21:39,769 INFO L87 Difference]: Start difference. First operand 792 states and 2539 transitions. Second operand 8 states. [2020-10-16 11:21:40,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:21:40,104 INFO L93 Difference]: Finished difference Result 892 states and 2871 transitions. [2020-10-16 11:21:40,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:21:40,106 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-10-16 11:21:40,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:21:40,112 INFO L225 Difference]: With dead ends: 892 [2020-10-16 11:21:40,113 INFO L226 Difference]: Without dead ends: 892 [2020-10-16 11:21:40,113 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-16 11:21:40,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2020-10-16 11:21:40,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 866. [2020-10-16 11:21:40,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 866 states. [2020-10-16 11:21:40,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 2798 transitions. [2020-10-16 11:21:40,141 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 2798 transitions. Word has length 16 [2020-10-16 11:21:40,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:21:40,141 INFO L481 AbstractCegarLoop]: Abstraction has 866 states and 2798 transitions. [2020-10-16 11:21:40,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 11:21:40,141 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 2798 transitions. [2020-10-16 11:21:40,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 11:21:40,143 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:40,143 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:21:40,143 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 11:21:40,144 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:40,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:40,144 INFO L82 PathProgramCache]: Analyzing trace with hash -521469095, now seen corresponding path program 1 times [2020-10-16 11:21:40,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:40,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819269462] [2020-10-16 11:21:40,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:21:40,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:21:40,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819269462] [2020-10-16 11:21:40,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:21:40,223 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:21:40,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212664365] [2020-10-16 11:21:40,223 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:21:40,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:21:40,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:21:40,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:21:40,224 INFO L87 Difference]: Start difference. First operand 866 states and 2798 transitions. Second operand 5 states. [2020-10-16 11:21:40,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:21:40,282 INFO L93 Difference]: Finished difference Result 767 states and 2242 transitions. [2020-10-16 11:21:40,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 11:21:40,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-16 11:21:40,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:21:40,287 INFO L225 Difference]: With dead ends: 767 [2020-10-16 11:21:40,288 INFO L226 Difference]: Without dead ends: 560 [2020-10-16 11:21:40,288 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-16 11:21:40,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-10-16 11:21:40,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 544. [2020-10-16 11:21:40,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2020-10-16 11:21:40,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1534 transitions. [2020-10-16 11:21:40,304 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1534 transitions. Word has length 17 [2020-10-16 11:21:40,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:21:40,304 INFO L481 AbstractCegarLoop]: Abstraction has 544 states and 1534 transitions. [2020-10-16 11:21:40,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:21:40,304 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1534 transitions. [2020-10-16 11:21:40,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-16 11:21:40,306 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:40,306 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-16 11:21:40,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 11:21:40,306 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:40,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:40,307 INFO L82 PathProgramCache]: Analyzing trace with hash -977153279, now seen corresponding path program 1 times [2020-10-16 11:21:40,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:40,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162868509] [2020-10-16 11:21:40,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:21:40,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-16 11:21:40,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162868509] [2020-10-16 11:21:40,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:21:40,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 11:21:40,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268936225] [2020-10-16 11:21:40,537 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 11:21:40,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:21:40,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 11:21:40,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:21:40,538 INFO L87 Difference]: Start difference. First operand 544 states and 1534 transitions. Second operand 8 states. [2020-10-16 11:21:41,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:21:41,111 INFO L93 Difference]: Finished difference Result 1187 states and 3363 transitions. [2020-10-16 11:21:41,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 11:21:41,112 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-10-16 11:21:41,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:21:41,120 INFO L225 Difference]: With dead ends: 1187 [2020-10-16 11:21:41,120 INFO L226 Difference]: Without dead ends: 1187 [2020-10-16 11:21:41,121 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-10-16 11:21:41,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2020-10-16 11:21:41,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 660. [2020-10-16 11:21:41,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2020-10-16 11:21:41,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1882 transitions. [2020-10-16 11:21:41,146 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1882 transitions. Word has length 19 [2020-10-16 11:21:41,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:21:41,146 INFO L481 AbstractCegarLoop]: Abstraction has 660 states and 1882 transitions. [2020-10-16 11:21:41,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 11:21:41,146 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1882 transitions. [2020-10-16 11:21:41,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-16 11:21:41,148 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:41,148 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-16 11:21:41,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 11:21:41,148 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:41,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:41,149 INFO L82 PathProgramCache]: Analyzing trace with hash -958235994, now seen corresponding path program 1 times [2020-10-16 11:21:41,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:41,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467987688] [2020-10-16 11:21:41,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:21:41,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:21:41,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467987688] [2020-10-16 11:21:41,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:21:41,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 11:21:41,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754339406] [2020-10-16 11:21:41,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:21:41,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:21:41,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:21:41,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:21:41,252 INFO L87 Difference]: Start difference. First operand 660 states and 1882 transitions. Second operand 6 states. [2020-10-16 11:21:41,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:21:41,330 INFO L93 Difference]: Finished difference Result 570 states and 1578 transitions. [2020-10-16 11:21:41,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:21:41,333 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-16 11:21:41,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:21:41,337 INFO L225 Difference]: With dead ends: 570 [2020-10-16 11:21:41,337 INFO L226 Difference]: Without dead ends: 478 [2020-10-16 11:21:41,338 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-16 11:21:41,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2020-10-16 11:21:41,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 410. [2020-10-16 11:21:41,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2020-10-16 11:21:41,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1122 transitions. [2020-10-16 11:21:41,350 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 1122 transitions. Word has length 19 [2020-10-16 11:21:41,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:21:41,350 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 1122 transitions. [2020-10-16 11:21:41,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:21:41,351 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1122 transitions. [2020-10-16 11:21:41,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 11:21:41,354 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:41,354 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:21:41,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 11:21:41,355 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:41,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:41,355 INFO L82 PathProgramCache]: Analyzing trace with hash -402143788, now seen corresponding path program 1 times [2020-10-16 11:21:41,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:41,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096723240] [2020-10-16 11:21:41,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:21:41,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:21:41,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096723240] [2020-10-16 11:21:41,830 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:21:41,830 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 11:21:41,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447389686] [2020-10-16 11:21:41,831 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 11:21:41,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:21:41,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 11:21:41,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-16 11:21:41,832 INFO L87 Difference]: Start difference. First operand 410 states and 1122 transitions. Second operand 9 states. [2020-10-16 11:21:42,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:21:42,784 INFO L93 Difference]: Finished difference Result 873 states and 2361 transitions. [2020-10-16 11:21:42,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 11:21:42,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-16 11:21:42,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:21:42,791 INFO L225 Difference]: With dead ends: 873 [2020-10-16 11:21:42,791 INFO L226 Difference]: Without dead ends: 769 [2020-10-16 11:21:42,791 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2020-10-16 11:21:42,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2020-10-16 11:21:42,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 394. [2020-10-16 11:21:42,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-10-16 11:21:42,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1072 transitions. [2020-10-16 11:21:42,805 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1072 transitions. Word has length 21 [2020-10-16 11:21:42,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:21:42,806 INFO L481 AbstractCegarLoop]: Abstraction has 394 states and 1072 transitions. [2020-10-16 11:21:42,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 11:21:42,806 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1072 transitions. [2020-10-16 11:21:42,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 11:21:42,807 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:42,807 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:21:42,808 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 11:21:42,808 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:42,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:42,808 INFO L82 PathProgramCache]: Analyzing trace with hash -404522372, now seen corresponding path program 2 times [2020-10-16 11:21:42,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:42,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782079150] [2020-10-16 11:21:42,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:21:43,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:21:43,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782079150] [2020-10-16 11:21:43,287 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:21:43,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 11:21:43,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278540079] [2020-10-16 11:21:43,288 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 11:21:43,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:21:43,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 11:21:43,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-10-16 11:21:43,289 INFO L87 Difference]: Start difference. First operand 394 states and 1072 transitions. Second operand 9 states. [2020-10-16 11:21:44,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:21:44,139 INFO L93 Difference]: Finished difference Result 916 states and 2390 transitions. [2020-10-16 11:21:44,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 11:21:44,140 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-16 11:21:44,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:21:44,146 INFO L225 Difference]: With dead ends: 916 [2020-10-16 11:21:44,146 INFO L226 Difference]: Without dead ends: 780 [2020-10-16 11:21:44,147 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2020-10-16 11:21:44,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2020-10-16 11:21:44,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 484. [2020-10-16 11:21:44,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2020-10-16 11:21:44,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1310 transitions. [2020-10-16 11:21:44,162 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 1310 transitions. Word has length 21 [2020-10-16 11:21:44,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:21:44,163 INFO L481 AbstractCegarLoop]: Abstraction has 484 states and 1310 transitions. [2020-10-16 11:21:44,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 11:21:44,163 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1310 transitions. [2020-10-16 11:21:44,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 11:21:44,165 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:44,165 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:21:44,165 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 11:21:44,165 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:44,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:44,165 INFO L82 PathProgramCache]: Analyzing trace with hash 575124820, now seen corresponding path program 3 times [2020-10-16 11:21:44,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:44,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551757436] [2020-10-16 11:21:44,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:21:44,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:21:44,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551757436] [2020-10-16 11:21:44,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:21:44,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 11:21:44,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861081811] [2020-10-16 11:21:44,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 11:21:44,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:21:44,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 11:21:44,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-16 11:21:44,639 INFO L87 Difference]: Start difference. First operand 484 states and 1310 transitions. Second operand 9 states. [2020-10-16 11:21:45,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:21:45,120 INFO L93 Difference]: Finished difference Result 866 states and 2275 transitions. [2020-10-16 11:21:45,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 11:21:45,121 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-16 11:21:45,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:21:45,125 INFO L225 Difference]: With dead ends: 866 [2020-10-16 11:21:45,125 INFO L226 Difference]: Without dead ends: 840 [2020-10-16 11:21:45,126 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-16 11:21:45,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2020-10-16 11:21:45,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 580. [2020-10-16 11:21:45,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2020-10-16 11:21:45,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 1573 transitions. [2020-10-16 11:21:45,142 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 1573 transitions. Word has length 21 [2020-10-16 11:21:45,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:21:45,142 INFO L481 AbstractCegarLoop]: Abstraction has 580 states and 1573 transitions. [2020-10-16 11:21:45,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 11:21:45,143 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 1573 transitions. [2020-10-16 11:21:45,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 11:21:45,144 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:45,145 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:21:45,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 11:21:45,145 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:45,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:45,145 INFO L82 PathProgramCache]: Analyzing trace with hash 572746236, now seen corresponding path program 4 times [2020-10-16 11:21:45,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:45,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869618957] [2020-10-16 11:21:45,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:21:45,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:21:45,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869618957] [2020-10-16 11:21:45,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:21:45,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 11:21:45,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449963161] [2020-10-16 11:21:45,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 11:21:45,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:21:45,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 11:21:45,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-10-16 11:21:45,590 INFO L87 Difference]: Start difference. First operand 580 states and 1573 transitions. Second operand 9 states. [2020-10-16 11:21:46,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:21:46,124 INFO L93 Difference]: Finished difference Result 728 states and 1992 transitions. [2020-10-16 11:21:46,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:21:46,125 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-16 11:21:46,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:21:46,130 INFO L225 Difference]: With dead ends: 728 [2020-10-16 11:21:46,131 INFO L226 Difference]: Without dead ends: 728 [2020-10-16 11:21:46,131 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-16 11:21:46,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2020-10-16 11:21:46,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 580. [2020-10-16 11:21:46,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2020-10-16 11:21:46,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 1573 transitions. [2020-10-16 11:21:46,146 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 1573 transitions. Word has length 21 [2020-10-16 11:21:46,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:21:46,146 INFO L481 AbstractCegarLoop]: Abstraction has 580 states and 1573 transitions. [2020-10-16 11:21:46,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 11:21:46,147 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 1573 transitions. [2020-10-16 11:21:46,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 11:21:46,149 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:46,149 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:21:46,150 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 11:21:46,150 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:46,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:46,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1498422226, now seen corresponding path program 5 times [2020-10-16 11:21:46,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:46,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913107507] [2020-10-16 11:21:46,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:21:46,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:21:46,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913107507] [2020-10-16 11:21:46,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:21:46,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 11:21:46,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219285125] [2020-10-16 11:21:46,298 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 11:21:46,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:21:46,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 11:21:46,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:21:46,298 INFO L87 Difference]: Start difference. First operand 580 states and 1573 transitions. Second operand 7 states. [2020-10-16 11:21:46,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:21:46,397 INFO L93 Difference]: Finished difference Result 555 states and 1519 transitions. [2020-10-16 11:21:46,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 11:21:46,398 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-10-16 11:21:46,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:21:46,402 INFO L225 Difference]: With dead ends: 555 [2020-10-16 11:21:46,402 INFO L226 Difference]: Without dead ends: 483 [2020-10-16 11:21:46,402 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-16 11:21:46,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2020-10-16 11:21:46,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 399. [2020-10-16 11:21:46,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-10-16 11:21:46,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1109 transitions. [2020-10-16 11:21:46,413 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1109 transitions. Word has length 21 [2020-10-16 11:21:46,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:21:46,414 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 1109 transitions. [2020-10-16 11:21:46,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 11:21:46,414 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1109 transitions. [2020-10-16 11:21:46,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-16 11:21:46,416 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:46,416 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:21:46,416 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 11:21:46,417 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:46,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:46,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1242988323, now seen corresponding path program 1 times [2020-10-16 11:21:46,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:46,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329569896] [2020-10-16 11:21:46,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:21:46,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:21:46,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329569896] [2020-10-16 11:21:46,991 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:21:46,991 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 11:21:46,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302386522] [2020-10-16 11:21:46,992 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 11:21:46,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:21:46,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 11:21:46,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-16 11:21:46,993 INFO L87 Difference]: Start difference. First operand 399 states and 1109 transitions. Second operand 10 states. [2020-10-16 11:21:47,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:21:47,782 INFO L93 Difference]: Finished difference Result 773 states and 2035 transitions. [2020-10-16 11:21:47,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 11:21:47,784 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-16 11:21:47,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:21:47,787 INFO L225 Difference]: With dead ends: 773 [2020-10-16 11:21:47,787 INFO L226 Difference]: Without dead ends: 563 [2020-10-16 11:21:47,788 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2020-10-16 11:21:47,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-10-16 11:21:47,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 377. [2020-10-16 11:21:47,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-10-16 11:21:47,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1037 transitions. [2020-10-16 11:21:47,799 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1037 transitions. Word has length 24 [2020-10-16 11:21:47,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:21:47,799 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 1037 transitions. [2020-10-16 11:21:47,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 11:21:47,799 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1037 transitions. [2020-10-16 11:21:47,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-16 11:21:47,807 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:47,807 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:21:47,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 11:21:47,807 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:47,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:47,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1277780317, now seen corresponding path program 2 times [2020-10-16 11:21:47,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:47,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905549511] [2020-10-16 11:21:47,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:21:48,244 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 41 [2020-10-16 11:21:48,437 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 39 [2020-10-16 11:21:48,558 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2020-10-16 11:21:48,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:21:48,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905549511] [2020-10-16 11:21:48,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:21:48,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 11:21:48,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178175967] [2020-10-16 11:21:48,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 11:21:48,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:21:48,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 11:21:48,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-16 11:21:48,683 INFO L87 Difference]: Start difference. First operand 377 states and 1037 transitions. Second operand 10 states. [2020-10-16 11:21:49,271 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2020-10-16 11:21:49,411 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2020-10-16 11:21:49,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:21:49,691 INFO L93 Difference]: Finished difference Result 922 states and 2406 transitions. [2020-10-16 11:21:49,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 11:21:49,692 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-16 11:21:49,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:21:49,694 INFO L225 Difference]: With dead ends: 922 [2020-10-16 11:21:49,694 INFO L226 Difference]: Without dead ends: 706 [2020-10-16 11:21:49,694 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2020-10-16 11:21:49,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2020-10-16 11:21:49,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 435. [2020-10-16 11:21:49,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2020-10-16 11:21:49,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 1188 transitions. [2020-10-16 11:21:49,706 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 1188 transitions. Word has length 24 [2020-10-16 11:21:49,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:21:49,706 INFO L481 AbstractCegarLoop]: Abstraction has 435 states and 1188 transitions. [2020-10-16 11:21:49,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 11:21:49,706 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 1188 transitions. [2020-10-16 11:21:49,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-16 11:21:49,708 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:49,708 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:21:49,708 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 11:21:49,708 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:49,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:49,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1275401733, now seen corresponding path program 3 times [2020-10-16 11:21:49,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:49,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542703772] [2020-10-16 11:21:49,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:21:50,232 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 43 [2020-10-16 11:21:50,355 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2020-10-16 11:21:50,494 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2020-10-16 11:21:50,716 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2020-10-16 11:21:50,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:21:50,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542703772] [2020-10-16 11:21:50,773 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:21:50,773 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 11:21:50,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687756547] [2020-10-16 11:21:50,774 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 11:21:50,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:21:50,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 11:21:50,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-16 11:21:50,775 INFO L87 Difference]: Start difference. First operand 435 states and 1188 transitions. Second operand 10 states. [2020-10-16 11:21:51,087 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2020-10-16 11:21:51,232 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2020-10-16 11:21:51,631 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2020-10-16 11:21:51,865 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2020-10-16 11:21:51,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:21:51,881 INFO L93 Difference]: Finished difference Result 608 states and 1615 transitions. [2020-10-16 11:21:51,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 11:21:51,882 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-16 11:21:51,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:21:51,885 INFO L225 Difference]: With dead ends: 608 [2020-10-16 11:21:51,885 INFO L226 Difference]: Without dead ends: 558 [2020-10-16 11:21:51,886 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2020-10-16 11:21:51,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-10-16 11:21:51,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 451. [2020-10-16 11:21:51,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2020-10-16 11:21:51,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 1220 transitions. [2020-10-16 11:21:51,898 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 1220 transitions. Word has length 24 [2020-10-16 11:21:51,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:21:51,898 INFO L481 AbstractCegarLoop]: Abstraction has 451 states and 1220 transitions. [2020-10-16 11:21:51,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 11:21:51,898 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 1220 transitions. [2020-10-16 11:21:51,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-16 11:21:51,900 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:51,900 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:21:51,900 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 11:21:51,900 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:51,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:51,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1063968541, now seen corresponding path program 4 times [2020-10-16 11:21:51,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:51,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967699088] [2020-10-16 11:21:51,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:21:52,241 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 44 [2020-10-16 11:21:52,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:21:52,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967699088] [2020-10-16 11:21:52,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:21:52,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 11:21:52,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863773007] [2020-10-16 11:21:52,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 11:21:52,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:21:52,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 11:21:52,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-16 11:21:52,476 INFO L87 Difference]: Start difference. First operand 451 states and 1220 transitions. Second operand 10 states. [2020-10-16 11:21:52,901 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2020-10-16 11:21:52,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:21:52,991 INFO L93 Difference]: Finished difference Result 624 states and 1659 transitions. [2020-10-16 11:21:52,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 11:21:52,992 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-16 11:21:52,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:21:52,994 INFO L225 Difference]: With dead ends: 624 [2020-10-16 11:21:52,994 INFO L226 Difference]: Without dead ends: 582 [2020-10-16 11:21:52,994 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-10-16 11:21:52,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-10-16 11:21:53,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 443. [2020-10-16 11:21:53,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2020-10-16 11:21:53,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1196 transitions. [2020-10-16 11:21:53,006 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 1196 transitions. Word has length 24 [2020-10-16 11:21:53,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:21:53,007 INFO L481 AbstractCegarLoop]: Abstraction has 443 states and 1196 transitions. [2020-10-16 11:21:53,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 11:21:53,007 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 1196 transitions. [2020-10-16 11:21:53,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-16 11:21:53,008 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:53,008 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:21:53,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-16 11:21:53,009 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:53,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:53,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1221850683, now seen corresponding path program 5 times [2020-10-16 11:21:53,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:53,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394955725] [2020-10-16 11:21:53,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:21:53,332 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2020-10-16 11:21:53,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:21:53,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394955725] [2020-10-16 11:21:53,656 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:21:53,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 11:21:53,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658552314] [2020-10-16 11:21:53,657 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 11:21:53,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:21:53,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 11:21:53,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-16 11:21:53,658 INFO L87 Difference]: Start difference. First operand 443 states and 1196 transitions. Second operand 10 states. [2020-10-16 11:21:54,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:21:54,162 INFO L93 Difference]: Finished difference Result 627 states and 1644 transitions. [2020-10-16 11:21:54,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 11:21:54,163 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-16 11:21:54,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:21:54,166 INFO L225 Difference]: With dead ends: 627 [2020-10-16 11:21:54,166 INFO L226 Difference]: Without dead ends: 500 [2020-10-16 11:21:54,166 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-10-16 11:21:54,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2020-10-16 11:21:54,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 377. [2020-10-16 11:21:54,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-10-16 11:21:54,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1007 transitions. [2020-10-16 11:21:54,176 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1007 transitions. Word has length 24 [2020-10-16 11:21:54,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:21:54,176 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 1007 transitions. [2020-10-16 11:21:54,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 11:21:54,176 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1007 transitions. [2020-10-16 11:21:54,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-16 11:21:54,177 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:54,177 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:21:54,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-16 11:21:54,178 INFO L429 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:54,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:54,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1669415775, now seen corresponding path program 6 times [2020-10-16 11:21:54,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:54,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061692746] [2020-10-16 11:21:54,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 11:21:54,268 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 11:21:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 11:21:54,359 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 11:21:54,409 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 11:21:54,409 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 11:21:54,410 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-16 11:21:54,411 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 11:21:54,446 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1791] [1791] L4-->L891: Formula: (let ((.cse7 (= (mod ~x$r_buff1_thd0~0_In-1563186610 256) 0)) (.cse8 (= (mod ~x$w_buff1_used~0_In-1563186610 256) 0)) (.cse10 (= (mod ~x$w_buff0_used~0_In-1563186610 256) 0)) (.cse9 (= (mod ~x$r_buff0_thd0~0_In-1563186610 256) 0))) (let ((.cse6 (or .cse10 .cse9)) (.cse0 (not .cse10)) (.cse2 (not .cse9)) (.cse3 (or .cse7 .cse8)) (.cse4 (not .cse8)) (.cse5 (not .cse7))) (and (let ((.cse1 (select |#memory_int_In-1563186610| |~#x~0.base_In-1563186610|))) (or (and .cse0 (= |#memory_int_Out-1563186610| (store |#memory_int_In-1563186610| |~#x~0.base_In-1563186610| (store .cse1 |~#x~0.offset_In-1563186610| ~x$w_buff0~0_In-1563186610))) .cse2) (and (or (and .cse3 (= |#memory_int_Out-1563186610| (store |#memory_int_In-1563186610| |~#x~0.base_In-1563186610| (store .cse1 |~#x~0.offset_In-1563186610| (select .cse1 |~#x~0.offset_In-1563186610|))))) (and (= |#memory_int_Out-1563186610| (store |#memory_int_In-1563186610| |~#x~0.base_In-1563186610| (store .cse1 |~#x~0.offset_In-1563186610| ~x$w_buff1~0_In-1563186610))) .cse4 .cse5)) .cse6))) (= ~x$r_buff1_thd0~0_Out-1563186610 ~x$r_buff1_thd0~0_In-1563186610) (or (and .cse6 (= ~x$w_buff0_used~0_Out-1563186610 ~x$w_buff0_used~0_In-1563186610)) (and (= ~x$w_buff0_used~0_Out-1563186610 0) .cse0 .cse2)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In-1563186610 0)) (= ~x$r_buff0_thd0~0_In-1563186610 ~x$r_buff0_thd0~0_Out-1563186610) (or (and (= ~x$w_buff1_used~0_In-1563186610 ~x$w_buff1_used~0_Out-1563186610) .cse3) (and (= ~x$w_buff1_used~0_Out-1563186610 0) .cse4 .cse5))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1563186610, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1563186610, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-1563186610, ~#x~0.offset=|~#x~0.offset_In-1563186610|, ~x$w_buff1~0=~x$w_buff1~0_In-1563186610, #memory_int=|#memory_int_In-1563186610|, ~#x~0.base=|~#x~0.base_In-1563186610|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1563186610, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1563186610, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1563186610} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1563186610, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-1563186610, ~#x~0.offset=|~#x~0.offset_In-1563186610|, ~x$w_buff1~0=~x$w_buff1~0_In-1563186610, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1563186610, ULTIMATE.start_main_#t~ite104=|ULTIMATE.start_main_#t~ite104_Out-1563186610|, ULTIMATE.start_main_#t~ite105=|ULTIMATE.start_main_#t~ite105_Out-1563186610|, ULTIMATE.start_main_#t~ite106=|ULTIMATE.start_main_#t~ite106_Out-1563186610|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1563186610, ULTIMATE.start_main_#t~ite107=|ULTIMATE.start_main_#t~ite107_Out-1563186610|, ULTIMATE.start_main_#t~ite108=|ULTIMATE.start_main_#t~ite108_Out-1563186610|, ULTIMATE.start_main_#t~ite109=|ULTIMATE.start_main_#t~ite109_Out-1563186610|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1563186610, ULTIMATE.start_main_#t~mem103=|ULTIMATE.start_main_#t~mem103_Out-1563186610|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-1563186610, #memory_int=|#memory_int_Out-1563186610|, ~#x~0.base=|~#x~0.base_In-1563186610|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~mem103, #memory_int, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite104, ULTIMATE.start_main_#t~ite105, ULTIMATE.start_main_#t~ite106, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite107, ULTIMATE.start_main_#t~ite108, ULTIMATE.start_main_#t~ite109, ~x$w_buff0_used~0] because there is no mapped edge [2020-10-16 11:21:54,455 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,455 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,457 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,457 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,457 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,458 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,458 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,458 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,458 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,458 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,459 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,459 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,459 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,459 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,459 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,460 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,460 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,460 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,460 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,460 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,460 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,461 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,461 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,461 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,461 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,461 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,461 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,462 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,462 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,462 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,463 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,463 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,463 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,463 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,464 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,464 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,464 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,464 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,464 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,464 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,465 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,465 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,466 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,466 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,466 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,466 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,467 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,467 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,467 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,467 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,467 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,468 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,468 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,468 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,468 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,468 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,468 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,468 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,469 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,469 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,469 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,469 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,469 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,469 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,469 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,470 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,470 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,470 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,470 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,471 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,471 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,471 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,471 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,471 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,471 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,472 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,472 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,472 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,472 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,472 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,472 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,472 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,473 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,473 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,473 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,474 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,474 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,474 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,475 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:54,476 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:54,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 11:21:54 BasicIcfg [2020-10-16 11:21:54,588 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 11:21:54,590 INFO L168 Benchmark]: Toolchain (without parser) took 40858.37 ms. Allocated memory was 147.8 MB in the beginning and 653.3 MB in the end (delta: 505.4 MB). Free memory was 102.0 MB in the beginning and 116.7 MB in the end (delta: -14.7 MB). Peak memory consumption was 490.7 MB. Max. memory is 7.1 GB. [2020-10-16 11:21:54,592 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 147.8 MB. Free memory was 122.6 MB in the beginning and 122.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 11:21:54,592 INFO L168 Benchmark]: CACSL2BoogieTranslator took 755.31 ms. Allocated memory was 147.8 MB in the beginning and 205.0 MB in the end (delta: 57.1 MB). Free memory was 101.8 MB in the beginning and 154.6 MB in the end (delta: -52.8 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. [2020-10-16 11:21:54,593 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.57 ms. Allocated memory is still 205.0 MB. Free memory was 154.6 MB in the beginning and 152.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-16 11:21:54,594 INFO L168 Benchmark]: Boogie Preprocessor took 65.02 ms. Allocated memory is still 205.0 MB. Free memory was 152.0 MB in the beginning and 148.2 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. [2020-10-16 11:21:54,594 INFO L168 Benchmark]: RCFGBuilder took 4217.23 ms. Allocated memory was 205.0 MB in the beginning and 296.7 MB in the end (delta: 91.8 MB). Free memory was 148.2 MB in the beginning and 163.0 MB in the end (delta: -14.8 MB). Peak memory consumption was 102.7 MB. Max. memory is 7.1 GB. [2020-10-16 11:21:54,595 INFO L168 Benchmark]: TraceAbstraction took 35736.79 ms. Allocated memory was 296.7 MB in the beginning and 653.3 MB in the end (delta: 356.5 MB). Free memory was 163.0 MB in the beginning and 116.7 MB in the end (delta: 46.3 MB). Peak memory consumption was 402.8 MB. Max. memory is 7.1 GB. [2020-10-16 11:21:54,603 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.20 ms. Allocated memory is still 147.8 MB. Free memory was 122.6 MB in the beginning and 122.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 755.31 ms. Allocated memory was 147.8 MB in the beginning and 205.0 MB in the end (delta: 57.1 MB). Free memory was 101.8 MB in the beginning and 154.6 MB in the end (delta: -52.8 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.57 ms. Allocated memory is still 205.0 MB. Free memory was 154.6 MB in the beginning and 152.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 65.02 ms. Allocated memory is still 205.0 MB. Free memory was 152.0 MB in the beginning and 148.2 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4217.23 ms. Allocated memory was 205.0 MB in the beginning and 296.7 MB in the end (delta: 91.8 MB). Free memory was 148.2 MB in the beginning and 163.0 MB in the end (delta: -14.8 MB). Peak memory consumption was 102.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 35736.79 ms. Allocated memory was 296.7 MB in the beginning and 653.3 MB in the end (delta: 356.5 MB). Free memory was 163.0 MB in the beginning and 116.7 MB in the end (delta: 46.3 MB). Peak memory consumption was 402.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1416 VarBasedMoverChecksPositive, 99 VarBasedMoverChecksNegative, 12 SemBasedMoverChecksPositive, 87 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 4.0s, 121 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 16.8s, 138 PlacesBefore, 43 PlacesAfterwards, 127 TransitionsBefore, 30 TransitionsAfterwards, 2274 CoEnabledTransitionPairs, 8 FixpointIterations, 55 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 108 TotalNumberOfCompositions, 6559 MoverChecksTotal - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L700] 0 int __unbuffered_cnt = 0; [L702] 0 int __unbuffered_p0_EAX = 0; [L704] 0 int __unbuffered_p0_EBX = 0; [L706] 0 int __unbuffered_p2_EAX = 0; [L707] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L708] 0 int __unbuffered_p2_EAX$mem_tmp; [L709] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L710] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L711] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L712] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L713] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L714] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L715] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L716] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L719] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L720] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L721] 0 int __unbuffered_p2_EAX$w_buff0; [L722] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L723] 0 int __unbuffered_p2_EAX$w_buff1; [L724] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L726] 0 int __unbuffered_p2_EBX = 0; [L727] 0 _Bool main$tmp_guard0; [L728] 0 _Bool main$tmp_guard1; [L730] 0 int x = 0; [L731] 0 _Bool x$flush_delayed; [L732] 0 int x$mem_tmp; [L733] 0 _Bool x$r_buff0_thd0; [L734] 0 _Bool x$r_buff0_thd1; [L735] 0 _Bool x$r_buff0_thd2; [L736] 0 _Bool x$r_buff0_thd3; [L737] 0 _Bool x$r_buff0_thd4; [L738] 0 _Bool x$r_buff1_thd0; [L739] 0 _Bool x$r_buff1_thd1; [L740] 0 _Bool x$r_buff1_thd2; [L741] 0 _Bool x$r_buff1_thd3; [L742] 0 _Bool x$r_buff1_thd4; [L743] 0 _Bool x$read_delayed; [L744] 0 int *x$read_delayed_var; [L745] 0 int x$w_buff0; [L746] 0 _Bool x$w_buff0_used; [L747] 0 int x$w_buff1; [L748] 0 _Bool x$w_buff1_used; [L750] 0 int y = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice1; [L753] 0 _Bool weak$$choice2; [L873] 0 pthread_t t2421; [L874] FCALL, FORK 0 pthread_create(&t2421, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L875] 0 pthread_t t2422; [L876] FCALL, FORK 0 pthread_create(&t2422, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L785] 2 x$w_buff1 = x$w_buff0 [L786] 2 x$w_buff0 = 1 [L787] 2 x$w_buff1_used = x$w_buff0_used [L788] 2 x$w_buff0_used = (_Bool)1 [L8] COND FALSE 2 !(!expression) [L790] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L791] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L792] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L793] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L794] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L795] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L877] 0 pthread_t t2423; [L878] FCALL, FORK 0 pthread_create(&t2423, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L879] 0 pthread_t t2424; [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 x$flush_delayed = weak$$choice2 [L815] EXPR 3 \read(x) [L815] 3 x$mem_tmp = x [L816] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L817] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L817] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L817] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L817] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L817] EXPR 3 \read(x) [L817] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L817] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L817] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L817] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L817] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L818] EXPR 3 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L818] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L819] EXPR 3 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L819] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L820] EXPR 3 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L820] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L821] EXPR 3 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L821] EXPR 3 !x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))) [L821] EXPR 3 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L821] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L822] EXPR 3 weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L822] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L823] EXPR 3 weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L823] EXPR 3 !x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))) [L823] EXPR 3 weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L823] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L824] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L825] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L826] EXPR 3 \read(x) [L826] 3 __unbuffered_p2_EAX = x [L827] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L827] 3 x = x$flush_delayed ? x$mem_tmp : x [L828] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=255, weak$$choice2=255, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L880] FCALL, FORK 0 pthread_create(&t2424, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=255, weak$$choice2=255, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L831] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=255, weak$$choice2=255, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L834] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L834] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L834] EXPR 3 \read(x) [L834] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L834] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L834] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L835] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L835] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L836] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L836] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L837] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L837] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L838] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L838] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L841] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 3 return 0; [L848] 4 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=255, weak$$choice2=255, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L757] 1 __unbuffered_p0_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=255, weak$$choice2=255, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L760] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 1 x$flush_delayed = weak$$choice2 [L763] EXPR 1 \read(x) [L763] 1 x$mem_tmp = x [L764] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L764] EXPR 1 \read(x) [L764] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L764] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L765] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L765] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L765] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0 [L765] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L765] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L765] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L766] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L766] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L766] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1 [L766] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L766] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L766] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L767] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L767] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L768] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L768] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L768] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L769] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L769] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L770] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L770] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L771] EXPR 1 \read(x) [L771] 1 __unbuffered_p0_EBX = x [L772] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L772] 1 x = x$flush_delayed ? x$mem_tmp : x [L773] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=255, weak$$choice2=0, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L851] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L851] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L851] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L851] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L852] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L852] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L853] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L853] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L854] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L854] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L855] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L855] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L860] 4 return 0; [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L778] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 1 return 0; [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 2 return 0; [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L893] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L894] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L894] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L895] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L8] COND TRUE 0 !expression [L8] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 126 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 35.3s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 17.0s, HoareTripleCheckerStatistics: 741 SDtfs, 952 SDslu, 2817 SDs, 0 SdLazy, 2487 SolverSat, 392 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 159 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2250occurred 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.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 2870 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 404 NumberOfCodeBlocks, 404 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 359 ConstructedInterpolants, 0 QuantifiedInterpolants, 165834 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...